Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/29030
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kurilić Miloš | - |
dc.contributor.author | Kuzeljević Boriša | - |
dc.contributor.other | Pilipović Stevan | - |
dc.contributor.other | Kurilić Miloš | - |
dc.contributor.other | Grulović Milan | - |
dc.contributor.other | Mijajlović Žarko | - |
dc.contributor.other | Šobot Boris | - |
dc.date.accessioned | 2020-12-14T16:11:54Z | - |
dc.date.available | 2020-12-14T16:11:54Z | - |
dc.date.issued | 2014-06-02 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/29030 | - |
dc.description.abstract | <p>Cilj ove teze je da se ispitaju lanci u parcijalnim uredjenjima (P(X), ⊂), pri čemu je P(X) skup domena izomorfnih podstruktura relacijske strukture X. Pošto se svaki lanac u parcijalnom uredjenju može produžiti do maksimalnog lanca, dovoljno je ispitati maksimalne lance u P(X). Dokazano je da, ako je X ultrahomogena relacijska struktura koja ima netrivijalne izomorfne podstrukture, onda je svaki maksimalan lanac u (P(X) ∪ {∅} , ⊂) kompletno linearno uredjenje koje se utapa u R i ima neizolovan minimum. Ako je X relacijska struktura, dat je dovoljan uslov da za svako kompletno linearno uredjenje L koje se utapa u R i ima neizolovan minimum, postoji maksimalan lanac u (P(X) ∪ {∅} , ⊂) izomorfan L. Dokazano je i da ako je X neka od sledećih relacijskih struktura: Rado graf, Hensonov graf, random poset, ultrahomogeni poset Bn ili ultrahomogeni poset Cn; onda je L izomorfno maksimalnom lancu u (P(X) ∪ {∅} , ⊂) ako i samo ako je L kompletno, utapa se u R i ima neizolovan minimum. Ako je X prebrojiv antilanac ili disjunktna unija µ kompletnih grafova sa ν tačaka za µν = ω, onda je L izomorfno maksimalnom lancu u (P(X) ∪ {∅} , ⊂) ako i samo ako je bulovsko, utapa se u R i ima neizolovan minimum.</p> | sr |
dc.description.abstract | <p>The purpose of this thesis is to investigate chains in partial orders (P(X), ⊂), where P(X) is the set of domains of isomorphic substructures of a relational structure X. Since each chain in a partial order can be extended to a maximal one, it is enough to describe maximal chains in P(X). It is proved that, if X is an ultrahomogeneous relational structure with non-trivial isomorphic substructures, then each maximal chain in (P(X)∪ {∅} , ⊂) is a complete, R-embeddable linear order with minimum non-isolated. If X is a relational structure, a condition is given for X, which is sufficient for (P(X) ∪ {∅} , ⊂) to embed each complete, R-embeddable linear order with minimum non-isolated as a maximal chain. It is also proved that if X is one of the follow- ing relational structures: Rado graph, Henson graph, random poset, ultrahomogeneous poset Bn or ultrahomogeneous poset Cn; then L is isomorphic to a maximal chain in (P(X) ∪ {∅} , ⊂) if and only if L is complete, R-embeddable with minimum non-isolated. If X is a countable antichain or disjoint union of µ complete graphs with ν points where µν = ω, then L is isomorphic to a maximal chain in (P(X) ∪ {∅} , ⊂) if and only if L is Boolean, R-embeddable with minimum non-isolated.</p> | en |
dc.language.iso | sr (latin script) | - |
dc.publisher | Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu | sr |
dc.publisher | University of Novi Sad, Faculty of Sciences at Novi Sad | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.subject | linear order, partial order, relational structure, isomorphic copy | en |
dc.subject | linearno uredjenje, relacijska struktura, izomorfna kopija, parcijalno uredjenje | sr |
dc.title | Partial orders of isomorphic substructures of relational structures | en |
dc.title | Parcijalna uredjenja izomorfnih podstruktura relacijskih stuktura | sr |
dc.type | Thesis | en |
dc.identifier.url | https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija139513071805425.pdf?controlNumber=(BISIS)85727&fileName=139513071805425.pdf&id=1582&source=BEOPEN&language=en | en |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=85727&source=BEOPEN&language=en | en |
dc.identifier.externalcrisreference | (BISIS)85727 | - |
dc.source.institution | Prirodno-matematički fakultet u Novom Sadu | sr |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0001-8660-0215 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Teze/Theses |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.