Type-respecting amalgamation and big Ramsey degrees
We give an infinitary extension of the Nešetřil-Rödl theorem for category of relational structures with special type-respecting embeddings.
math.CO↗
arXiv subjects
Jan Hubička
Publications and source records attributed to Jan Hubička.
Finlay, Thames, Dufay, and Paget color screen process collections: Using digital registration of viewing screens to reveal original color
We discuss digitization, subsequent digital analysis and processing of negatives (and diapositives) made by Finlay, Thames, Dufay, Paget, and similar additive color screen processes. These early color processes (introduced in the 1890s and popular until the 1950s) used a special color screen filter and a monochromatic negative. Due to poor stability of dyes used to produce color screens many of the photographs appear faded; others exist only in the form of (monochromatic) negatives. We discuss the possibility of digitally reconstructing the original color from scans of original negatives or by virtue of infrared imaging of original transparencies (which eliminates the physically coupled color filters) and digitally recreating the original color filter pattern using a new open-source software tool. Photographs taken using additive color screen processes are some of the very earliest color images of our shared cultural heritage. They depict people, places, and events for which there are no other surviving color images. We hope that our new software tool can bring these images back to life.
cs.GR↗
On the Homomorphism Order of Oriented Paths and Trees
A partial order is universal if it contains every countable partial order as a suborder. In 2017, Fiala, Hubička, Long and Nešetřil showed that every interval in the homomorphism order of graphs is universal, with the only exception being the trivial gap $[K_1,K_2]$. We consider the homomorphism order restricted to the class of oriented paths and trees. We show that every interval between two oriented paths or oriented trees of height at least 4 is universal. The exceptional intervals coincide for oriented paths and trees and are contained in the class of oriented paths of height at most 3, which forms a chain.
math.CO↗
All those EPPA classes (Strengthenings of the Herwig-Lascar theorem)
In this paper we prove a general theorem showing the extension property for partial automorphisms (EPPA, also called the Hrushovski property) for classes of structures containing relations and unary functions, optionally equipped with a permutation group of the language. The proof is elementary, combinatorial and fully self-contained. Our result is a common strengthening of the Herwig-Lascar theorem on EPPA for relational classes with forbidden homomorphisms, the Hodkinson-Otto theorem on EPPA for relational free amalgamation classes, its strengthening for unary functions by Evans, Hubička and Nešetřil and their coherent variants by Siniora and Solecki. We also prove an EPPA analogue of the main results of J. Hubička and J. Nešetřil: All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms), thereby establishing a common framework for proving EPPA and the Ramsey property. Our results have numerous applications, we include a solution of a problem related to a class constructed by the Hrushovski predimension construction.
math.CO↗
Big Ramsey degrees of 3-uniform hypergraphs are finite
We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or product) form of Milliken's Tree Theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.
math.CO↗
Ramsey expansions of 3-hypertournaments
We study Ramsey expansions of certain homogeneous 3-hypertournaments. We show that they exhibit an interesting behaviour and, in one case, they seem not to submit to current gold-standard methods for obtaining Ramsey expansions. This makes these examples very interesting from the point of view of structural Ramsey theory as there is a large demand for novel examples.
math.CO↗
Big Ramsey degrees and forbidden cycles
Using the Carlson-Simpson theorem, we give a new general condition for a structure in a finite binary relational language to have finite big Ramsey degrees
math.CO↗
Big Ramsey degrees of the generic partial order
As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order in a similar way as Devlin characterised big Ramsey degrees of the generic linear order (the order of rationals).
math.CO↗
Simplicity of the automorphism groups of generalised metric spaces
Tent and Ziegler proved that the automorphism group of the Urysohn sphere is simple and that the automorphism group of the Urysohn space is simple modulo bounded automorphisms. A key component of their proof is the definition of a stationary independence relation (SIR). In this paper we prove that the existence of a SIR satisfying some extra axioms is enough to prove simplicity of the automorphism group of a countable structure. The extra axioms are chosen with applications in mind, namely homogeneous structures which admit a "metric-like amalgamation", for example all primitive 3-constrained metrically homogeneous graphs of finite diameter from Cherlin's list.
math.GR↗
Structural Ramsey Theory and the Extension Property for Partial Automorphisms
We survey recent developments concerning two properties of classes of finite structures: the Ramsey property and the extension property for partial automorphisms (EPPA).
math.CO↗
Ramsey properties and extending partial automorphisms for classes of finite structures
We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the Nešetřil-Rödl Theorem and the second and third authors' Ramsey theorem for finite models (that is, structures with both relations and functions). We also find subclasses with the ordering property. For languages with relational symbols and unary functions we also show the extension property for partial automorphisms (EPPA) of free amalgamation classes. These general results solve several conjectures and provide an easy Ramseyness test for many classes of structures.
math.CO↗
Conant's generalised metric spaces are Ramsey
We give Ramsey expansions of classes of generalised metric spaces where distances come from a linearly ordered commutative monoid. This complements results of Conant about the extension property for partial automorphisms and extends an earlier result of the first and the last author giving the Ramsey property of convexly ordered $S$-metric spaces. Unlike Conant's approach, our analysis does not require the monoid to be semi-archimedean.
math.CO↗
EPPA for two-graphs and antipodal metric spaces
We prove that the class of finite two-graphs has the extension property for partial automorphisms (EPPA, or Hrushovski property), thereby answering a question of Macpherson. In other words, we show that the class of graphs has the extension property for switching automorphisms. We present a short, self-contained, purely combinatorial proof which also proves EPPA for the class of integer valued antipodal metric spaces of diameter 3, answering a question of Aranda et al. The class of two-graphs is an important new example which behaves differently from all the other known classes with EPPA: Two-graphs do not have the amalgamation property with automorphisms (APA), their Ramsey expansion has to add a graph, it is not known if they have coherent EPPA and even EPPA itself cannot be proved using the Herwig--Lascar theorem.
math.CO↗
All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Nešetřil-Rödl Theorem, the Ramsey property of partial orders and metric spaces as well as the authors' Ramsey lift of bowtie-free graphs. We use this framework to solve several open problems and give new examples of Ramsey classes. Among others, we find Ramsey lifts of convexly ordered $S$-metric spaces and prove the Ramsey theorem for finite models (i.e. structures with both functions and relations) thus providing the ultimate generalisation of the structural Ramsey theorem. Both of these results are natural, and easy to state, yet their proofs involve most of the theory developed here. We also characterise Ramsey lifts of classes of structures defined by finitely many forbidden homomorphisms and extend this to special cases of classes with closures. This has numerous applications. For example, we find Ramsey lifts of many Cherlin-Shelah-Shi classes.
math.CO↗
Density and Fractal Property of the Class of Oriented Trees
We show the density theorem for the class of finite oriented trees ordered by the homomorphism order. We also show that every interval of oriented trees, in addition to be dense, is in fact universal. We end by considering the fractal property in the class of all finite digraphs.
math.CO↗
Big Ramsey degrees of 3-uniform hypergraphs
Given a countably infinite hypergraph $\mathcal R$ and a finite hypergraph $\mathcal A$, the big Ramsey degree of $\mathcal A$ in $\mathcal R$ is the least number $L$ such that, for every finite $k$ and every $k$-colouring of the embeddings of $\mathcal A$ to $\mathcal R$, there exists an embedding $f$ from $\mathcal R$ to $\mathcal R$ such that all the embeddings of $\mathcal A$ to the image $f(\mathcal R)$ have at most $L$ different colours. We describe the big Ramsey degrees of the random countably infinite 3-uniform hypergraph, thereby solving a question of Sauer. We also give a new presentation of the results of Devlin and Sauer on, respectively, big Ramsey degrees of the order of the rationals and the countably infinite random graph. Our techniques generalise (in a natural way) to relational structures and give new examples of Ramsey structures (a concept recently introduced by Zucker with applications to topological dynamics).
math.CO↗
Extending partial automorphisms of $n$-partite tournaments
We prove that for every $n\geq 2$ the class of all finite $n$-partite tournaments (orientations of complete $n$-partite graphs) has the extension property for partial automorphisms, that is, for every finite $n$-partite tournament $G$ there is a finite $n$-partite tournament $H$ such that every isomorphism of induced subgraphs of $G$ extends to an automorphism of $H$. Our constructions are purely combinatorial (whereas many earlier EPPA results use deep results from group theory) and extend to other classes such as the class of all finite semi-generic tournaments.
math.CO↗
Completing graphs to metric spaces
We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.
math.CO↗