|
|
Semigroup-valued metric spaces
Konečný, Matěj ; Hubička, Jan (advisor)
The structural Ramsey theory is a field on the boundary of combinatorics and model theory with deep connections to topological dynamics. Most of the known Ramsey classes in finite binary symmetric relational language can be shown to be Ramsey by utilizing a variant of the shortest path completion (e.g. Sauer's S-metric spaces, Conant's generalised metric spaces, Braunfeld's Λ-ultrametric spaces or Cherlin's metrically homogeneous graphs). In this thesis we explore the limits of the shortest path completion. We offer a unifying framework - semigroup-valued metric spaces - for all the aforementioned Ramsey classes and study their Ramsey expansions and EPPA (the extension property for partial automorphisms). Our results can be seen as evidence for the importance of studying the completion problem for amalgamation classes and have some further applications (such as the stationary independence relation). As a corollary of our general theorems, we reprove results of Hubička and Nešetřil on Sauer's S-metric spaces, results of Hubička, Nešetřil and the author on Conant's generalised metric spaces, Braunfeld's results on Λ-ultrametric spaces and the results of Aranda et al. on Cherlin's primitive 3-constrained metrically homogeneous graphs. We also solve several open problems such as EPPA for Λ-ultrametric...
|
|
|
Semigroup-valued metric spaces
Konečný, Matěj ; Hubička, Jan (advisor)
The structural Ramsey theory is a field on the boundary of combinatorics and model theory with deep connections to topological dynamics. Most of the known Ramsey classes in finite binary symmetric relational language can be shown to be Ramsey by utilizing a variant of the shortest path completion (e.g. Sauer's S-metric spaces, Conant's generalised metric spaces, Braunfeld's Λ-ultrametric spaces or Cherlin's metrically homogeneous graphs). In this thesis we explore the limits of the shortest path completion. We offer a unifying framework - semigroup-valued metric spaces - for all the aforementioned Ramsey classes and study their Ramsey expansions and EPPA (the extension property for partial automorphisms). Our results can be seen as evidence for the importance of studying the completion problem for amalgamation classes and have some further applications (such as the stationary independence relation). As a corollary of our general theorems, we reprove results of Hubička and Nešetřil on Sauer's S-metric spaces, results of Hubička, Nešetřil and the author on Conant's generalised metric spaces, Braunfeld's results on Λ-ultrametric spaces and the results of Aranda et al. on Cherlin's primitive 3-constrained metrically homogeneous graphs. We also solve several open problems such as EPPA for Λ-ultrametric...
|
|
|
Semigroup-valued metric spaces
Konečný, Matěj ; Hubička, Jan (advisor) ; Pultr, Aleš (referee)
The structural Ramsey theory is a field on the boundary of combinatorics and model theory with deep connections to topological dynamics. Most of the known Ramsey classes in finite binary symmetric relational language can be shown to be Ramsey by utilizing a variant of the shortest path completion (e.g. Sauer's S-metric spaces, Conant's generalised metric spaces, Braunfeld's Λ-ultrametric spaces or Cherlin's metrically homogeneous graphs). In this thesis we explore the limits of the shortest path completion. We offer a unifying framework - semigroup-valued metric spaces - for all the aforementioned Ramsey classes and study their Ramsey expansions and EPPA (the extension property for partial automorphisms). Our results can be seen as evidence for the importance of studying the completion problem for amalgamation classes and have some further applications (such as the stationary independence relation). As a corollary of our general theorems, we reprove results of Hubička and Nešetřil on Sauer's S-metric spaces, results of Hubička, Nešetřil and the author on Conant's generalised metric spaces, Braunfeld's results on Λ-ultrametric spaces and the results of Aranda et al. on Cherlin's primitive 3-constrained metrically homogeneous graphs. We also solve several open problems such as EPPA for Λ-ultrametric...
|
|
|
Combinatorial Properties of Metrically Homogeneous Graphs
Konečný, Matěj ; Hubička, Jan (advisor) ; Nešetřil, Jaroslav (referee)
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory com- bines these two fields and is concerned with Ramsey-type questions about certain model-theoretic structures. In 2005, Nešetřil initiated a systematic study of the so-called Ramsey classes of finite structures. This thesis is a contribution to the programme; we find Ramsey expansions of the primitive 3-constrained classes from Cherlin's catalogue of metrically homogeneous graphs. A key ingredient is an explicit combinatorial algorithm to fill-in the missing distances in edge-labelled graphs to obtain structures from Cherlin's classes. This algorithm also implies the extension property for partial automorphisms (EPPA), another combinatorial property of classes of finite structures. 1
|
guest ::
