No Arabic abstract
We study the analytic digraphs of uncountable Borel chromatic number on Polish spaces, and compare them with the notion of injective Borel homomorphism. We provide some minimal digraphs incomparable with G 0. We also prove the existence of antichains of size continuum, and that there is no finite basis. 2010 Mathematics Subject Classification. 03E15, 54H05
We study the extension of the Kechris-Solecki-Todorcevic dichotomy on analytic graphs to dimensions higher than 2. We prove that the extension is possible in any dimension, finite or infinite. The original proof works in the case of the finite dimension. We first prove that the natural extension does not work in the case of the infinite dimension, for the notion of continuous homomorphism used in the original theorem. Then we solve the problem in the case of the infinite dimension. Finally, we prove that the natural extension works in the case of the infinite dimension, but for the notion of Baire-measurable homomorphism.
For a group $G$ definable in a first order structure $M$ we develop basic topological dynamics in the category of definable $G$-flows. In particular, we give a description of the universal definable $G$-ambit and of the semigroup operation on it. We find a natural epimorphism from the Ellis group of this flow to the definable Bohr compactification of $G$, that is to the quotient $G^*/{G^*}^{00}_M$ (where $G^*$ is the interpretation of $G$ in a monster model). More generally, we obtain these results locally, i.e. in the category of $Delta$-definable $G$-flows for any fixed set $Delta$ of formulas of an appropriate form. In particular, we define local connected components ${G^*}^{00}_{Delta,M}$ and ${G^*}^{000}_{Delta,M}$, and show that $G^*/{G^*}^{00}_{Delta,M}$ is the $Delta$-definable Bohr compactification of $G$. We also note that some deeper arguments from the topological dynamics in the category of externally definable $G$-flows can be adapted to the definable context, showing for example that our epimorphism from the Ellis group to the $Delta$-definable Bohr compactification factors naturally yielding a continuous epimorphism from the $Delta$-definable generalized Bohr compactification to the $Delta$-definable Bohr compactification of $G$. Finally, we propose to view certain topological-dynamic and model-theoretic invariants as Polish structures which leads to some observations and questions.
We give a completely constructive solution to Tarskis circle squaring problem. More generally, we prove a Borel version of an equidecomposition theorem due to Laczkovich. If $k geq 1$ and $A, B subseteq mathbb{R}^k$ are bounded Borel sets with the same positive Lebesgue measure whose boundaries have upper Minkowski dimension less than $k$, then $A$ and $B$ are equidecomposable by translations using Borel pieces. This answers a question of Wagon. Our proof uses ideas from the study of flows in graphs, and a recent result of Gao, Jackson, Krohne, and Seward on special types of witnesses to the hyperfiniteness of free Borel actions of $mathbb{Z}^d$.
In this paper we are interested in finding and evaluating cardinal characteristics of the continuum that appear in large-scale topology, usually as the smallest weights of coarse structures that belong to certain classes (indiscrete, inseparated, large) of finitary or locally finite coarse structures on $omega$. Besides well-known cardinals $mathfrak b,mathfrak d,mathfrak c$ we shall encounter two new cardinals $mathsf Delta$ and $mathsf Sigma$, defined as the smallest weight of a finitary coarse structure on $omega$ which contains no discrete subspaces and no asymptotically separated sets, respectively. We prove that $max{mathfrak b,mathfrak s,mathrm{cov}(mathcal N)}lemathsf Deltalemathsf Sigmalemathrm{non}(mathcal M)$, but we do not know if the cardinals $mathsf Delta,mathsf Sigma,mathrm{non}(mathcal M)$ can be distinguished in suitable models of ZFC.
We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is countable. 2. If in a partially ordered set, all chains are finite and all antichains have size $aleph_{alpha}$, then the set has size $aleph_{alpha}$ for any regular $aleph_{alpha}$. 3. CS (Every partially ordered set without a maximal element has two disjoint cofinal subsets). 4. CWF (Every partially ordered set has a cofinal well-founded subset). 5. DT (Dilworths decomposition theorem for infinite p.o.sets of finite width). 6. If the chromatic number of a graph $G_{1}$ is finite (say $k<omega$), and the chromatic number of another graph $G_{2}$ is infinite, then the chromatic number of $G_{1}times G_{2}$ is $k$. 7. For an infinite graph $G=(V_{G}, E_{G})$ and a finite graph $H=(V_{H}, E_{H})$, if every finite subgraph of $G$ has a homomorphism into $H$, then so has $G$. Further we study a few statements restricted to linearly-ordered structures without the axiom of choice.