Related papers: On disjoint Borel uniformizations

We prove that for any set $F$ of $n\ge 2$ pairwise disjoint open convex sets in $\mathbb{R}^3$, the connected components of the set of lines intersecting every member of $F$ are contractible. The same result holds for directed lines.

We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by…

The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…

There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…

Motivated by the effective bounds of ordinary differential equations, we prove an effective version of uniform bounding for partial differential fields with commuting derivations. More precisely, we provide an upper bound for the size of…

The notion of a shift-compact set in an abelian topological group $X$ plays a significant role in functional equations and inequalities, especially so since each Borel set that is not Haar-meagre, alternatively not Haar-null, is necessarily…

We prove that any disjoint union of finitely many simple curves in the upper half-plane can be generated in a unique way by the chordal multiple-slit Loewner equation with constant weights.

We give a short proof that a uniform noncrossing partition of the regular $n$-gon weakly converges toward Aldous's Brownian triangulation of the disk, in the sense of the Hausdorff topology. This result was first obtained by Curien &…

In this paper we introduce a simple and natural bipartite Bell scenario, by considering the correlations between two parties defined by general measurements in one party and dichotomic ones in the other. We show that unbounded Bell…

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

A generalization of the Borsuk-Ulam theorem to Stiefel manifolds is considered. This theorem is applied to derive bounds on $d$ that guarantee-for a given set of $m$ measures in $\mathbb{R}^d$-the existence of $k$ mutually orthogonal…

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…

Given a truncated perturbation expansion of a physical quantity, one can, under certain circumstances, obtain lower or upper bounds (or both) to the sum of the full perturbation series by using the Borel transform and a variational…

Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and…

Suppose $X$ is a torsor under an abelian variety $A$ over a number field. We show that any adelic point of $X$ that is orthogonal to the algebraic Brauer group of $X$ is orthogonal to the whole Brauer group of $X$. We also show that if…

We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

We prove the following uniform version of a theorem by Lindstr\"om: Let $\mbox{$\cal F$}:=\{F_i:~ i\in I\}$ be a $k$-uniform set family of $[n]$, where $k\geq 1$. If $|\mbox{$\cal F$}|\geq n+1$, then there exist two disjoint subsets $I_1$…

The aim of this paper is to prove a general version of Pl\"unnecke's inequality. Namely, assume that for finite sets $A$, $B_1, ... B_k$ we have information on the size of the sumsets $A+B_{i_1}+... +B_{i_l}$ for all choices of indices…