Related papers: On the Yao-Yao partition theorem
A new notion of thickness for subsets of $B[0,1]\subset \mathbb{R}^n$ called affine thickness is defined; this notion of thickness is a generalisation of Falconer-Yavicoli thickness and is adapted to be used in the study of certain sets…
A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…
A topological space $Y$ is said to have (AEEP) if the following condition is fulfilled. Whenever $(X,\mathfrak{M})$ is a measurable space and $f, g: X \to Y$ are two measurable functions, then the set $\Delta(f,g) = \{x \in X:\ f(x) =…
We establish the existence of an optimal partition for the Yamabe equation in the whole space made up of mutually linearly isometric sets, each of them invariant under the action of a group of linear isometries. To do this, we establish the…
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…
Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…
We construct one Yang-Mills measure on a compact surface for each isomorphism class of principal bundles over this surface. For this, we define a new discrete gauge theory which is essentially a covering of the usual one. We prove that the…
A celebrated theorem of Baranyai states that when $k$ divides $n$, the family $K_n^k$ of all $k$-subsets of an $n$-element set can be partitioned into perfect matchings. In other words, $K_n^k$ is $1$-factorable. In this paper, we determine…
Let A be finite set equipped with a probability distribution P, and let M be a "mass" function on A. A characterization is given for the most efficient way in which A^n can be covered using spheres of a fixed radius. A covering is a subset…
Given a homogenous Poisson point process in the plane, we prove that it is possible to partition the plane into bounded connected cells of equal volume, in a translation-invariant way, with each point of the process contained in exactly one…
A union of an arrangement of affine hyperplanes $H$ in $R^d$ is the real algebraic variety associated to the principal ideal generated by the polynomial $p_{H}$ given as the product of the degree one polynomials which define the hyperplanes…
We partly extend the localisation technique from convex geometry to the multiple constraints setting. For a given $1$-Lipschitz map $u\colon\mathbb{R}^n\to\mathbb{R}^m$, $m\leq n$, we define and prove the existence of a partition of…
It is shown that the $f$-divergence between two probability measures $P$ and $R$ equals the supremum of the same $f$-divergence computed over all finite measurable partitions of the original space, thus generalizing results previously…
In this paper we prove that any Riemannian surface, with no restriction of curvature at all, can be decomposed into blocks belonging just to some of these types: generalized Y-pieces, generalized funnels and halfplanes.
The purpose of this note is twofold. First, we give a quick proof of Ballico-Chiantini's theorem stating that a Fano or Calabi-Yau variety of dimension at least 4 in codimension two is a complete intersection. Second, we improve Barth-Van…
For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…
The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…
We present improved upper bounds on the spanning ratio of constrained $\theta$-graphs with at least 6 cones and constrained Yao-graphs with 5 or at least 7 cones. Given a set of points in the plane, a Yao-graph partitions the plane around…
This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements originating from the division of land estates: (1) each…
Given a collection $\mathcal L$ of $n$ points on a sphere $\mathbf{S}^2_n$ of surface area $n$, a fair allocation is a partition of the sphere into $n$ parts each of area $1$, and each associated with a distinct point of $\mathcal L$. We…