Related papers: Combinatorial Properties of Finite Models

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…

The modern theory of homogeneous structures begins with the work of Roland Fra\"iss\'e. The theory developed in the last seventy years is placed in the border area between combinatorics, model theory, algebra, and analysis. We turn our…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

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…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…

Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…

This paper considers the cohomology and bounded interpolation of nonstandard finite element complexes, e.g. Stokes, Hessian, Elasticity, divdiv. Compared to the standard finite element exterior calculus, the main challenge is the existence…

Each hereditary property can be characterized by its set of minimal obstructions; these sets are often unknown, or known but infinite. By allowing extra structure it is sometimes possible to describe such properties by a finite set of…

In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…