arXiv subjects
Publications and source records attributed to Zoltán Vidnyánszky.
We investigate the behavior of countable Borel equivalence relations (CBERs) on topological Ramsey spaces. First, we give a simple proof of the fact that every CBER on $[\mathbb{N}]^{\mathbb{N}}$ is hyperfinite on some set of the form $[A]^{\mathbb{N}}$. Using the idea behind the proof, we show the analogous result for every topological Ramsey space.
We investigate the connections between the fields of distributed computing and measurable combinatorics by considering complexity classes of locally checkable labeling problems on regular forests. We show that the most important deterministic complexity classes from the LOCAL model of distributed computing exactly coincide with well-studied classes in measurable combinatorics. Namely, first we show that a locally checkable labeling problem admits a continuous solution if and only if it can be solved by a deterministic local algorithm with complexity $O(\log^* n)$. Second, our main result states that, surprisingly, a locally checkable labeling problem admits a Baire measurable solution if and only if it can be solved by a local algorithm with complexity $O(\log n)$. These theorems suggest the existence of deeper connections between the two frameworks. Furthermore, the latter result relies on a complete combinatorial characterization of the classes in question, and as a by-product, it shows that membership in these classes is decidable.
We show that for any $Δ\geq 3$, there is no bound computable from $(\varepsilon, r)$ on the size of a graph required to approximate a graph of maximum degree at most $Δ$ up to $\varepsilon$ error in $r$-neighborhood statistics. This provides a negative answer to a question posed by Lovász. Our result is a direct consequence of the recent celebrated work of Bowen, Chapman, Lubotzky, and Vidick, which refutes the Aldous-Lyons conjecture.
We study topological realizations of countable Borel equivalence relations, including realizations by continuous actions of countable groups, with additional desirable properties. Some examples include minimal realizations on any perfect Polish space, realizations as $K_σ$ relations, and realizations by continuous actions on the Baire space. We also consider questions related to realizations of specific important equivalence relations, like Turing and arithmetical equivalence. We focus in particular on the problem of realization by continuous actions on compact spaces and more specifically subshifts. This leads to the study of properties of subshifts, including universality of minimal subshifts, and a characterization of amenability of a countable group in terms of subshifts. Moreover we consider a natural universal space for actions and equivalence relations and study the descriptive and topological properties in this universal space of various properties, like, e.g., compressibility, amenability or hyperfiniteness.
In the past couple of years a rich connection has been found between the fields of descriptive set theory and distributed computing. Frequently, and less surprisingly, finitary algorithms can be adopted to the infinite setting, resulting in theorems about infinite, definable graphs. In this survey, we take a different perspective and illustrate how results and ideas from descriptive set theory provide new insights and techniques to the theory of distributed computing. We focus on the two classical topics from graph theory, vertex and edge colorings. After summarizing the up-to-date results from both areas, we discuss the adaptation of Marks' games method to the LOCAL model of distributed computing and the development of the multi-step Vizing's chain technique, which led to the construction of the first non-trivial distributed algorithms for Vizing colorings. We provide a list of related open problems to complement our discussion. Finally, we describe an efficient deterministic distributed algorithm for Brooks coloring on graphs of subexponential growth.
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $Σ^1_2$-complete. This implies that the split between easy and hard problems is at a different place in the Borel setting than in the case of the CSP Dichotomy.
We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De Bruijin-Erdős-type compactness theorem over ZF. More precisely, if $\mathcal{D}$ is a structure, let $K_\mathcal{D}$ stand for the following statement: for every structure $\mathcal{X}$ if every finite substructure of $\mathcal{X}$ admits a solution to $\mathcal{D}$, then so does $\mathcal{X}$. We prove that if $\mathcal{D}$ admits no cyclic polymorphism, and thus it is NP-complete by the CSP Dichotomy Theorem, then $K_\mathcal{D}$ is equivalent to the Boolean Prime Ideal Theorem (BPI) over ZF. Conversely, we also show that if $\mathcal{D}$ admits a cyclic polymorphism, and thus it is in P, then $K_\mathcal{D}$ is strictly weaker than BPI.
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for the construction comes from the adaptation of this method to the LOCAL model of distributed computing. Our approach unifies the previous results in the area, as well as produces new ones. In particular, we show that for $Δ>2$ it is impossible to give a simple characterization of acyclic $Δ$-regular Borel graphs with Borel chromatic number at most $Δ$: such graphs form a $\mathbfΣ^1_2$-complete set. This implies a strong failure of Brooks'-like theorems in the Borel context.
All spaces are assumed to be separable and metrizable. Ostrovsky showed that every zero-dimensional Borel space is $σ$-homogeneous. Inspired by this theorem, we obtain the following results: assuming $\mathsf{AD}$, every zero-dimensional space is $σ$-homogeneous; assuming $\mathsf{AC}$, there exists a zero-dimensional space that is not $σ$-homogeneous; assuming $\mathsf{V=L}$, there exists a coanalytic zero-dimensional space that is not $σ$-homogeneous. Along the way, we introduce two notions of hereditary rigidity, and give alternative proofs of results of van Engelen, Miller and Steel. It is an open problem whether every analytic zero-dimensional space is $σ$-homogeneous.
We construct bounded degree acyclic Borel graphs with large Borel chromatic number using a graph arising from Ramsey theory and limits of expander sequences.
Combining canonization results of Prömel-Voigt, Mathias, and Soare, we provide a new, natural example of an $F_σ$ equivalence relation that is not hypersmooth.
We study connections between distributed local algorithms, finitary factors of iid processes, and descriptive combinatorics in the context of regular trees. We extend the Borel determinacy technique of Marks coming from descriptive combinatorics and adapt it to the area of distributed computing. Using this technique, we prove deterministic distributed $Ω(\log n)$-round lower bounds for problems from a natural class of homomorphism problems. Interestingly, these lower bounds seem beyond the current reach of the powerful round elimination technique responsible for all substantial locality lower bounds of the last years. Our key technical ingredient is a novel ID graph technique that we expect to be of independent interest. We prove that a local problem admits a Baire measurable coloring if and only if it admits a local algorithm with local complexity $O(\log n)$, extending the classification of Baire measurable colorings of Bernshteyn. A key ingredient of the proof is a new and simple characterization of local problems that can be solved in $O(\log n)$ rounds. We complement this result by showing separations between complexity classes from distributed computing, finitary factors, and descriptive combinatorics. Most notably, the class of problems that allow a distributed algorithm with sublogarithmic randomized local complexity is incomparable with the class of problems with a Borel solution. We hope that our treatment will help to view all three perspectives as part of a common theory of locality, in which we follow the insightful paper of [Bernshteyn -- arXiv 2004.04905].
We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on $[\mathbb{N}]^{<\mathbb{N}}$ with finite (or, equivalently, $\leq 3$) Borel chromatic number form a $\mathbfΣ^1_2$-complete set. This answers a question of Kechris and Marks and strengthens several earlier results.
Answering a question of Hrušák, we show that every analytic tall ideal on $ω$ contains an $F_σ$ tall ideal. We also give an example of an $F_σ$ tall ideal without a Borel selector.
We show that every non-Haar-null analytic subset of $\mathbb{Z}^ω$ contains a non-Haar-null closed subset. Moreover, we also prove that the codes of Haar-null analytic subsets, and, consequently, closed Haar-null sets in the Effros Borel space of $\mathbb{Z}^ω$ form a $\mathbfΔ^1_2$ set.
We generalize Kada's definable strengthening of Dilworth's characterization of the class of quasi-orders admitting an antichain of a given finite cardinality.
Following Darji, we say that a Borel subset $B$ of an abelian Polish group $G$ is Haar meager if there is a compact metric space $K$ and a continuous function $f : K \to G$ such that the preimage of the translate, $f^{-1}(B+g)$ is meager in $K$ for every $g \in G$. The set $B$ is called strongly Haar meager if there is a compact set $C \subseteq G$ such that $(B+g) \cap C$ is meager in $C$ for every $g \in G$. The main open problem in this area is Darji's question asking whether these two notions are the same. Even though there have been several partial results suggesting a positive answer, in this paper we construct a counterexample. More specifically, we construct a $G_δ$ set in $\mathbb{Z}^ω$ that is Haar meager but not strongly Haar meager. We also show that no $F_σ$ counterexample exists, hence our result is optimal.
N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of $\mathbb R$ so that no infinite sumset $X+X=\{x+y:x,y\in X\}$ is monochromatic. Our aim in this paper is to prove a consistency result in the opposite direction: we show that, under certain set-theoretic assumptions, for any $c:\mathbb R\to r$ with $r$ finite there is an infinite $X\subseteq \mathbb R$ so that $c$ is constant on $X+X$.