| dc.contributor.advisor |
Vrećica, Siniša |
|
| dc.contributor.author |
Jelić Milutinović, Marija |
|
| dc.date.accessioned |
2021-03-01T15:51:21Z |
|
| dc.date.available |
2021-03-01T15:51:21Z |
|
| dc.date.issued |
2021 |
|
| dc.identifier.uri |
http://hdl.handle.net/123456789/5184 |
|
| dc.description.abstract |
In this dissertation we examine several important objects and concepts in combinatorialtopology, using both combinatorial and topological methods.The matching complexM(G) of a graphGis the complex whose vertex set is the setof all edges ofG, and whose faces are given by sets of pairwise disjoint edges. These com-plexes appear in many areas of mathematics. Our first approach to these complexes is newand structural - we give complete classification of all pairs (G,M(G)) for whichM(G) is ahomology manifold, with or without boundary. Our second approach focuses on determiningthe homotopy type or connectivity of matching complexes of several classes of graphs. Weuse a tool from discrete Morse theory called the Matching Tree Algorithm and inductiveconstructions of homotopy type.Two other complexes of interest are unavoidable complexes and threshold complexes.Simplicial complexK⊆2[n]is calledr-unavoidable if for each partitionA1t···tAr= [n] atleast one of the setsAiis inK. Inspired by the role of unavoidable complexes in the Tverbergtype theorems and Gromov-Blagojevi ́c-Frick-Ziegler reduction, we begin a systematic studyof their combinatorial properties. We investigate relations between unavoidable and thre-shold complexes. The main goal is to find unavoidable complexes which are unavoidable fordeeper reasons than containment of an unavoidable threshold complex. Our main examplesare constructed as joins of self-dual minimal triangulations ofRP2,CP2,HP2, and joins ofRamsey complex.The dissertation contains as well an application of the important “configuration space -test map” method. First, we prove a cohomological generalization of Dold’s theorem fromequivariant topology. Then we apply it to Yang’s case of Knaster’s problem, and obtain anew simpler proof. Also, we slightly improve few other cases of Knaster’s problem. |
en_US |
| dc.description.provenance |
Submitted by Slavisha Milisavljevic (slavisha) on 2021-03-01T15:51:21Z
No. of bitstreams: 1
Marija_Jelic_Milutinovic.pdf: 5212575 bytes, checksum: be1673aeb45e53da047e688ac314b8a3 (MD5) |
en |
| dc.description.provenance |
Made available in DSpace on 2021-03-01T15:51:21Z (GMT). No. of bitstreams: 1
Marija_Jelic_Milutinovic.pdf: 5212575 bytes, checksum: be1673aeb45e53da047e688ac314b8a3 (MD5)
Previous issue date: 2021 |
en |
| dc.language.iso |
sr |
en_US |
| dc.publisher |
Beograd |
en_US |
| dc.title |
KOMBINATORNA TOPOLOGIJA I GRAFOVSKI KOMPLEKSI |
en_US |
| mf.author.birth-date |
1989-07-01 |
|
| mf.author.birth-place |
Beograd |
en_US |
| mf.author.birth-country |
Srbija |
en_US |
| mf.author.residence-state |
Srbija |
en_US |
| mf.author.citizenship |
Srpsko |
en_US |
| mf.author.nationality |
Srpkinja |
en_US |
| mf.subject.area |
Mathematics |
en_US |
| mf.subject.keywords |
simplicial complex, matching complex, homology manifold, homotopy type,unavoidable complex, threshold characteristic, self-dual triangulation, Matching Tree algo-rithm, Knaster’s problem, “configuration space - test map” method |
en_US |
| mf.subject.subarea |
Topology, Combinatorics |
en_US |
| mf.contributor.committee |
Grujić, Vladimir |
|
| mf.contributor.committee |
Živaljević, Rade |
|
| mf.contributor.committee |
Petrić, Zoran |
|
| mf.university.faculty |
Mathematical faculty |
en_US |
| mf.document.references |
107 |
en_US |
| mf.document.pages |
151 |
en_US |
| mf.document.location |
Beograd |
en_US |
| mf.document.genealogy-project |
No |
en_US |
| mf.university |
Belgrade University |
en_US |