Related papers: Structured sunflowers and canonical Ramsey propert…
The ordinary Structure Identity Principle states that any property of set-level structures (e.g., posets, groups, rings, fields) definable in Univalent Foundations is invariant under isomorphism: more specifically, identifications of…
Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that for any finite non-empty subset X' of X, the color of the…
The classical Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under Poisson brackets. This polynomial closure is typical for 2nd order superintegrable…
Ramsey's theorem states that for all finite colorings of an infinite set, there exists an infinite homogeneous subset. What if we seek a homogeneous subset that is also order-equivalent to the original set? Let $S$ be a linearly ordered set…
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…
In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…
A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…
Nontrivial combinatory algebras with S and K must be infinite. Associativity is incompatible with combining a classifier and a retraction pair in a finite extensional magma. These obstructions exclude several standard settings from the…
A relational structure is indivisible if for every partition of its set of elements into two parts there exists an embedding of the structure into one of the parts of the partition. A relational structure is homogeneous if every embedding…
In set theory without the Axiom of Choice, we study the set-theoretic strength of a generalized version of the Rainbow Ramsey theorem and the Canonical Ramsey Theorem for pairs introduced by Erd\H{o}s and Rado, concerning their…
A class K of finite structures is said to have the extension property for automorphisms (EP) if for every A in K there exists an extension B in K such that every partial isomorphism on the structure A extends to an automorphism of B.…
A factorisation $x = u_1 u_2 \cdots$ of an infinite word $x$ on alphabet $X$ is called `monochromatic', for a given colouring of the finite words $X^*$ on alphabet $X$, if each $u_i$ is the same colour. Wojcik and Zamboni proved that the…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures,extending Zheng's work for the profinite graph to the setting of Fra\"{\i}ss\'{e} classes of finite ordered binary relational…
Let $\mathbb{E}$ be the HNN-extension of a group $B$ with subgroups $H$ and $K$ associated according to an isomorphism $\varphi\colon H \to K$. Suppose that $H$ and $K$ are normal in $B$ and $(H \cap K)\varphi = H \cap K$. Under these…
One of the consequences of the Compactness Principle in structural Ramsey theory is that the small Ramsey degrees cannot exceed the corresponding big Ramsey degrees, thereby justifying the choice of adjectives. However, it is unclear what…
Program semantics can often be expressed as a (many-sorted) first-order theory S, and program properties as sentences $\varphi$ which are intended to hold in the canonical model of such a theory, which is often incomputable. Recently, we…
An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring of the edges of a complete graph there exist large highly…
We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…