Sums, products, and exponents in two-colorings of the naturals
We prove that for any coloring of the naturals using two colors there are monochromatic sets of the form $\{x,y,xy,x+iy:i\leq k\}$ and $\{x,y,x^y,xy^i:i\leq k\}$ for any $k$.
math.CO↗
arXiv subjects
Marcin Sabok
Publications and source records attributed to Marcin Sabok.
Bowen's Problem 32 and the conjugacy problem for systems with specification
We show that Rufus Bowen's Problem 32 on the classification of symbolic systems with the specification property does not admit a solution that would use concrete invariants. To this end, we construct a class of symbolic systems with the specification property and show that the conjugacy relation on this class is too complicated to admit such a classification. More generally, we gauge the complexity of the classification problem for symbolic systems with the specification property. Along the way, we also provide answers to two questions related to the classification of pointed systems with the specification property: to a question of Ding and Gu related to the complexity of the classification of pointed Cantor systems with the specification property and to a question of Bruin and Vejnar related to the complexity of the classification of pointed Hilbert cube systems with the specification property.
math.LO↗
Extension property for partial automorphisms of the $n$-partite and semigeneric tournaments
We present a proof of the extension property for partial automorphisms (EPPA) for classes of finite $n$-partite tournaments for $n \in \{2,3,\ldots,\omega\}$, and for the class of finite semigeneric tournaments. We also prove that the generic $\omega$-partite tournament and the generic semigeneric tournament have ample generics.
math.CO↗
Open questions in descriptive set theory and dynamical systems
This file is composed of questions that emerged or were of interest during the workshop "Interactions between Descriptive Set Theory and Smooth Dynamics" that took place in Banff, Canada on 2022.
math.DS↗
The uniform Gardner conjecture and rounding Borel flows
We study groups which satisfy Gardner's equidecomposition conjecture for uniformly distributed sets. We prove that an amenable group has this property if and only if it does not admit $(\mathbb{Z}/2\mathbb{Z}) *(\mathbb{Z}/2\mathbb{Z})$ as a quotient by a finite subgroup. Our technical contribution is an algorithm for rounding Borel flows for actions of amenable groups.
math.LO↗
Monochromatic products and sums in the rationals
We show that for every coloring of the rationals into finitely many colors, one of the colors contains a set of the form $\{x,y,xy,x+y\}$ for some nonzero $x$ and $y$.
math.CO↗
Perfect matchings in hyperfinite graphings
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd. We give several applications of this result, answering various open questions in the field. For instance, we extend the Lyons--Nazarov theorem by characterizing bipartite Cayley graphs which admit a factor of iid perfect matching, answering the bipartite case of a well-known question of Lyons and Nazarov, popularized by Kechris and Marks. Moreover, we show how our results apply to measurable equidecompositions and, in particular, generalize the recent result of Grabowski, Máthé and Pikhurko on the measurable circle squaring. Our approach applies more generally to rounding measurable perfect fractional matchings.
math.CO↗
Measurable Hall's theorem for actions of abelian groups
We prove a measurable version of the Hall marriage theorem for actions of finitely generated abelian groups. In particular, it implies that for free measure-preserving actions of such groups, if two equidistributed measurable sets are equidecomposable, then they are equidecomposable using measurable pieces. The latter generalizes a recent result of Grabowski, Máthé and Pikhurko on the measurable circle squaring and confirms a special case of a conjecture of Gardner.
math.LO↗
Unicorn paths and hyperfiniteness for the mapping class group
Let S be an orientable surface of finite type. Using Pho-On's infinite unicorn paths, we prove the hyperfiniteness of orbit equivalence relations induced by the actions of the mapping class group of S on the Gromov boundaries of the arc graph and the curve graph of S. In the curve graph case, this strengthens the results of Hamenstädt and Kida that this action is universally amenable and that the mapping class group of S is exact.
math.GT↗
Probabilistic Programming Semantics for Name Generation
We make a formal analogy between random sampling and fresh name generation. We show that quasi-Borel spaces, a model for probabilistic programming, can soundly interpret Stark's $ν$-calculus, a calculus for name generation. Moreover, we prove that this semantics is fully abstract up to first-order types. This is surprising for an 'off-the-shelf' model, and requires a novel analysis of probability distributions on function spaces. Our tools are diverse and include descriptive set theory and normal forms for the $ν$-calculus.
cs.PL↗
Hyperfiniteness of boundary actions of hyperbolic groups
We prove that for every finitely generated hyperbolic group $G$, the action of $G$ on its Gromov boundary induces a hyperfinite equivalence relation.
math.GR↗
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↗
The Hrushovski property for hypertournaments and profinite topologies
We study the problem of extending partial isomorphisms for hypertournaments, which are relational structures generalizing tournaments. This is a generalized version of an old question of Herwig and Lascar. We show that the generalized problem has a negative answer, and we provide a positive answer in a special case. As a corollary, we show that the extension property holds for tournaments in case the partial isomorphisms have pairwise disjoint ranges and pairwise disjoint domains.
math.LO↗
Hyperfiniteness of boundary actions of cubulated hyperbolic groups
We show that if a hyperbolic group acts geometrically on a CAT(0) cube complex, then the induced boundary action is hyperfinite. This means that for a cubulated hyperbolic group the natural action on its Gromov boundary is hyperfinite, which generalizes an old result of Dougherty, Jackson and Kechris for the free group case.
math.GR↗
On the complexity of topological conjugacy of Toeplitz subshifts
In this paper, we study the descriptive set theoretic complexity of the equivalence relation of conjugacy of Toeplitz subshifts of a residually finite group $G$. On the one hand, we show that if $G = \mathbb{Z}$, then topological conjugacy on Toeplitz subshifts with separated holes is amenable. In contrast, if $G$ is non-amenable, then conjugacy of Toeplitz $G$-subshifts is a non-amenable equivalence relation. The results were motivated by a general question, asked by Gao, Jackson and Seward, about the complexity of conjugacy for minimal, free subshifts of countable groups.
math.LO↗
The classification problem for finitely generated operator systems and spaces
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for arbitrary separable operator systems and spaces are intractable. On the other hand we show that the finitely generated operator systems and spaces are completely classifiable (or smooth); in fact a finitely generated operator system is classified by its complete theory when regarded as a structure in continuous logic. In the particular case of operator systems generated by a single unitary, a complete invariant is given by the spectrum of the unitary up to a rigid motion of the circle, provided that the spectrum contains at least 5 points. As a consequence of these results we show that the relation on compact subsets of $\mathbb{C}^{n}$, given by homeomorphism via a degree 1 polynomial, is smooth.
math.OA↗
Automatic continuity for isometry groups
We present a general framework for automatic continuity results for groups of isometries of metric spaces. In particular, we prove automatic continuity property for the group of isometries of the Urysohn space and the Urysohn sphere, i.e. that any homomorphism from either of these groups into a separable group is continuous. As a consequence, we get that the group of isometries of the Urysohn space has unique Polish group topology and the group of isometries of the Urysohn sphere has unique separable group topology. Moreover, as an application of our framework we obtain new proofs of the automatic continuity property for the group $\mathrm{Aut}([0,1],λ)$, due to Ben Yaacov, Berenstein and Melleray and for the unitary group of the infinite-dimensional separable Hilbert space, due to Tsankov. The results and proofs are stated in the language of model theory for metric structures.
math.LO↗
Completeness of the isomorphism problem for separable C*-algebras
We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation. This means that any isomorphism problem arsing from a continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple, separable AI C*-algebras. As a consequence, we get that the isomorphism problems for separable nuclear C*-algebras and for separable C*-algebras have the same complexity. This answers questions posed by Elliott, Farah, Paulsen, Rosendal, Toms and Törnquist.
math.OA↗