Related papers: A footnote to the KPT theorem in structural Ramsey…
The perturbative expansion of Chern-Simons gauge theory leads to invariants of knots and links, the finite type invariants or Vassiliev invariants. It has been proven that at any order in perturbation theory the resulting expression is an…
We formalise the self-referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set-theoretic formulations. By invoking Tarski fixed point theorem, we identify physical…
Structural convergence is a framework for convergence of graphs by Ne\v{s}et\v{r}il and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem asking whether for a given…
We introduce the notion of echeloned spaces - an order-theoretic abstraction of metric spaces. The first step is to characterize metrizable echeloned spaces. It turns out that morphisms between metrizable echeloned spaces are uniformly…
A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a…
We show that the (topological) full group of a minimal pseudogroup over the Cantor set satisfies various rigidity phenomena of topological dynamical and combinatorial nature. Our main result applies to its possible homomorphisms into other…
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…
We prove that any countable discrete and torsion free subgroup of a general linear group over an arbitrary field or a similar subgroup of an almost connected Lie group satisfies the integral algebraic K-theoretic (split) Novikov conjecture…
We prove the Andruskiewitsch-Dumas conjecture that the automorphism group of the positive part of the quantized universal enveloping algebra $U_q({\mathfrak{g}})$ of an arbitrary finite dimensional simple Lie algebra g is isomorphic to the…
We establish a structure theorem for the connected automorphism groups of smooth complete toroidal horospherical varieties, that is, toric fibrations over rational homogeneous spaces. The key ingredient is a characterization of the Demazure…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
Ratner's theorem implies topological rigidity of immersed totally geodesic subspaces of noncompact type in finite-volume locally symmetric spaces. In higher rank and infinite volume, however, counter-examples to this rigidity have remained…
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 prove additive and multiplicative partition theorems, obtaining combinatorial results for p-quasicyclic groups, where p is a prime number. We also get density results for p-quasicyclic groups via left F{\o}lner sequences of non-empty…
We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…
This article highlights historical achievements in the partition theory of countable homogeneous relational structures, and presents recent work, current trends, and open problems. Exciting recent developments include new methods involving…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
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…