Related papers: On disjoint Borel uniformizations

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

For which infinite cardinals $\kappa$ is there a partition of the real line $\mathbb R$ into precisely $\kappa$ Borel sets? Hausdorff famously proved that there is a partition of $\mathbb R$ into $\aleph_1$ Borel sets. But other than this,…

We show that, consistently, there is a Borel set which has uncountably many pairwise very non-disjoint translations, but does not allow a perfect set of such translations.

We prove that every finite Borel measure $\mu$ in $\mathbb{R}^N$ that is bounded from above by the Hausdorff measure $\mathcal{H}^s$ can be split in countable many parts $\mu\lfloor_{E_k}$ that are bounded from above by the Hausdorff…

We prove several improved versions of the Borel-Ritt theorem about the surjectivity of the asymptotic Borel mapping in classes of functions with $\boldsymbol{M}$-uniform asymptotic expansion on an unbounded sector of the Riemann surface of…

A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in the same class. The generalization to n-tuples for n >= 3 is…

It is proved that if there is an $\aleph_2$-Aronszajn line, then there is one that does not contain an $\aleph_2$-Countryman line. This solves a problem of Moore and stands in a sharp contrast with his Basis Theorem for linear orders of…

Following Davies, Elekes and Keleti, we study measured sets, i.e. Borel sets $B$ in $\mathbb{R}$ (or in a Polish group) for which there is a translation invariant Borel measure assigning positive and \sigma-finite measure to $B$. We…

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

Standard results in descriptive set theory provide sufficient conditions for a Borel set $P \subseteq \mathbb{N}^\mathbb{N} \times \mathbb{N}^\mathbb{N}$ to admit a Borel uniformization, namely, when $P$ has "small" sections or "large"…

We give, for each countable ordinal $\xi \geq 1$, an example of a ${\bf\Delta}^0_2$ countable union of Borel rectangles that cannot be decomposed into countably many ${\bf\Pi}^0_\xi$ rectangles. In fact, we provide a graph of a partial…

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

Diestel and Leader have characterised connected graphs that admit a normal spanning tree via two classes of forbidden minors. One class are Halin's $(\aleph_0,\aleph_1)$-graphs: bipartite graphs with bipartition $(\mathbb{N},B)$ such that…

We consider an old question of Slaman and Steel: whether Turing equivalence is an increasing union of Borel equivalence relations none of which contain a uniformly computable infinite sequence. We show this question is deeply connected to…

We show, under some natural conditions, that the set of abelian points on the non-anomalous subset of a closed irreducible subvariety $X$ intersected with the union of connected algebraic subgroups of codimension at least $\dim X$ in a…

In this article we prove the topological minimality of unions of several almost orthogonal planes of arbitrary dimensions. A particular case was proved in arXiv:1103.1468, where we proved the Almgren minimality (which is a weaker property…

A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering…

In a paper from 2001 (Journal of the LMS), Diestel and Leader offered a proof that a connected graph has a normal spanning tree if and only if it does not contain a minor from two specific forbidden classes of graphs, all of cardinality…

We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…