English
Related papers

Related papers: Borel structurability on the 2-shift of a countabl…

200 papers

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

Logic · Mathematics 2021-09-20 Andreas Hallbäck , Maciej Malicki , Todor Tsankov

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

Logic · Mathematics 2025-05-13 Michael Wolman

In [9] we proved that the space of countable torsion-free abelian groups is Borel complete. In this paper we show that our construction from [9] satisfies several additional properties of interest. We deduce from this that countable…

Logic · Mathematics 2026-01-27 Gianluca Paolini , Saharon Shelah

Let $G$ be a connected semi-simple group defined over and algebraically closed field, $T$ a fixed Cartan, $B$ a fixed Borel containing $T$, $S$ a set of simple reflections associated to the simple positive roots corresponding to $(T,B)$,…

Algebraic Geometry · Mathematics 2007-05-23 David Joyner , Pablo Lejarraga

We compute the $\rm{SO}(n+1)$-equivariant mod $2$ Borel cohomology of the free iterated loop space $Z^{S^n}$ when $Z$ is a mod $2$ generalized Eilenberg Mac Lane space. When $n=1$, this recovers B\"okstedt and Ottosen's computation for the…

Algebraic Topology · Mathematics 2026-01-21 Ishan Levy , Justin Wu

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

Probability · Mathematics 2013-12-31 Peter Orbanz , Balazs Szegedy

We construct pairs of marked groups with isomorphic Cayley graphs but different Borel chromatic numbers for the free parts of their shift graphs. This answers a question of Kechris and Marks. We also show that these graphs have different…

Logic · Mathematics 2019-06-03 Felix Weilacher

We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that…

Logic · Mathematics 2019-08-16 Samuel Coskey , Paul Ellis

We construct, for each countable ordinal $\xi$, a closed graph with Borel chromatic number two and Baire class $\xi$ chromatic number $\aleph\_0$.

Logic · Mathematics 2014-12-16 Dominique Lecomte , Miroslav Zeleny

Let $G$ be a finite group and $H$ a core-free subgroup of $G$. We will show that if there exists a solvable, generating transversal of $H$ in $G$, then $G$ is a solvable group. Further, if $S$ is a generating transversal of $H$ in $G$ and…

Group Theory · Mathematics 2019-05-21 Vivek Kumar Jain

We show that if an automorphism of a standard Borel space does not admit finite invariant measures, then it has a two-set generator modulo the sigma-ideal generated by wandering sets. This implies that if the entropies of invariant…

Dynamical Systems · Mathematics 2017-06-07 Michael Hochman

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

Group Theory · Mathematics 2015-02-10 Tomasz Downarowicz , Dawid Huczek , Guohua Zhang

Let $\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\ell:E(G)\rightarrow \Gamma$, there exists a vertex coloring $c$ by the…

Combinatorics · Mathematics 2023-12-05 Bartłomiej Bosek , Jarosław Grytczuk , Grzegorz Gutowski , Oriol Serra , Mariusz Zając

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

Logic · Mathematics 2025-04-02 Ruiyuan Chen , Antoine Poulin , Ran Tao , Anush Tserunyan

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

Combinatorics · Mathematics 2007-05-23 Gus Wiseman

We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…

Group Theory · Mathematics 2018-06-22 Anush Tserunyan

A framework to handle tree decompositions of the components of a Borel graph in a Borel fashion is introduced, along the lines of Tserunyan's Stallings Theorem for equivalence relations arXiv:1805.09506. This setting leads to a notion of…

Logic · Mathematics 2023-08-28 Héctor Jardón-Sánchez

We prove a full measurable version of Vizing's theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal{G}$ of degree uniformly bounded by $\Delta\in \mathbb{N}$ defined on a standard probability space…

Logic · Mathematics 2024-07-30 Jan Grebík

We study Borel equivalence relations induced by Borel actions of tsi Polish groups on standard Borel spaces. We characterize when such an equivalence relation admits classification by countable structures using a variant of the $\mathbb…

Logic · Mathematics 2021-08-02 Jan Grebík

Given an action of a group $G$ by automorphisms on an infinite relational structure $\mathcal{M}$, we say that the action is structurally sharply $k$-transitive if, for any two $k$-tuples $\bar{a}, \bar{b} \in M^k$ of distinct elements such…

Group Theory · Mathematics 2025-02-18 J. de la Nuez González , Rob Sullivan