| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:PREDSTAVITVE DELNIH UREJENOSTI
Authors:ID Gologranc, Tanja (Author)
ID Bokal, Drago (Mentor) More about this mentor... New window
Files:.pdf UNI_Gologranc_Tanja_2009.pdf (387,93 KB)
MD5: 5B97483FDC08482176646EEF785EE950
PID: 20.500.12556/dkum/5ae8eaa9-299d-4ac7-a64c-5941ea2c3fab
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Prvi del diplomskega dela govori o predstavitvah delnih urejenosti z družinami množic, kot so družina konveksnih poligonov, družina pravilnih n-kotnikov, družina krogov ipd. Lastnost, ki nam pomaga pri raziskovanju predstavitev delnih urejenosti, je prekrižno število. Ker zlahka preverimo, da lahko poljubno končno delno urejeno množico predstavimo z družino množic in z družino konveksnih poligonov, je glavni cilj prvega dela preveriti, kakšno je prekrižno število delnih urejenosti, ki jih lahko predstavimo z družino krogov oziroma z družino pravilnih n-kotnikov. V drugem delu diplomskega dela najprej definiramo podatkovno hierarhijo in dokažemo, da vsaka podatkovna hierarhija predstavlja delno urejenost. Glavni rezultat drugega dela je dokaz, da lahko vsako delno urejeno množico predstavimo kot podatkovno hierarhijo. Pri tem je najpomembnejša ugotovitev, da lahko vsako delno urejeno množico predstavimo z relacijo deljivosti na neki podmnožici naravnih števil in da lahko relacijo deljivosti predstavimo kot podatkovno hierarhijo. V zaključku diplomskega dela pa so vpeljane posebne vrste podatkovnih hierarhij, ki odpirajo možnosti za nadaljnje raziskovanje.
Keywords:Delna urejenost, predstavitvena množica, funkcijski diagram, prekrižno število, permutacijski diagram, normalna predstavitev, ekvivalenčna relacija, relacija finejši, podatkovna hierarhija.
Place of publishing:Maribor
Publisher:[T. Gologranc]
Year of publishing:2009
PID:20.500.12556/DKUM-9971 New window
UDC:51(043.2)
COBISS.SI-ID:16790280 New window
NUK URN:URN:SI:UM:DK:DB3M4BYH
Publication date in DKUM:20.04.2009
Views:4402
Downloads:354
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:REPRESENTATION OF PARTIAL ORDERS
Abstract:The first part of the thesis studies representations of partial orders using family of sets like convex polygons, regular n-gons, and circles. The feature that we use in this investigation is the crossing number. Because it is easy to check that every final poset has set representation and representation using convex polygons, our main goal is to check the crossing number of posets that we can represent with a family of circles or with family of regular n-gons. In the second part of the thesis, we first define data hierarchy, and prove that each data hierarchy presents a partial order. The main result of the second part is that each finite partial order can be represented as a data hierarchy. This is established using the fact that each finite poset can be represented by a relation of divisibility on a certain subset of natural numbers and that the relation of divisibility can be represented as a data hierarchy. In the conclusion, we present some special types of data hierarchies, which give several possibilities of further research.
Keywords:Partial order, set representation, function diagram, crossing number, permutation diagram, normal representation, equivalence relation, refinement relation, data hierarhy.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica