Near equipartitions of colored point sets

We show that any d-colored set of points in general position in R d can be partitioned into n subsets with disjoint convex hulls such that the set of points and all color classes are partitioned as evenly as possible. This extends results by Holmsen, Kynčl & Valculescu (2017) and establishes a special case of their general conjecture. Our proof utilizes a result obtained independently by Soberón and by Karasev in 2010, on simultaneous equipartitions of d continuous measures in R d by n convex regions. This gives a convex partition of R d with the desired properties, except that points may lie on the boundaries of the regions. In order to resolve the ambiguous assignment of these points, we set up a network flow problem. The equipartition of the continuous measures gives a fractional flow. The existence of an integer flow then yields the desired partition of the point set.

show abstract

“…

…”

supporting

confidence: 88%

“…In this paper, we consider the following conjecture of Holmsen, Kynčl and Valculescu [5,Conjecture 3].…”

Section: Introductionmentioning

confidence: 99%

Convex Equipartitions of Colored Point Sets

Blagojević

Rote

Steinmeyer

et al. 2017

Discrete Comput Geom

View full text Add to dashboard Cite

show abstract

“…In this paper, motivated by a conjecture of Holmsen, Kynčl & Valculescu [12,Con. 3], we consider many measures in a Euclidean space, and instead of searching for equiparting convex partitions we look for convex partitions that in each piece capture a positive amount from a (large) prescribed number of the given measures.…”

Section: Introduction and Statement Of The Main Resultsmentioning

confidence: 95%

“…For the point set measures in general position Holmsen, Kynčl and Valculescu proposed the following natural conjecture [12, Con. 3].Conjecture 1.2 (Holmsen, Kynčl, Valculescu, 2017). Let d ≥ 2, ≥ 2, m ≥ 2 and n ≥ 1 be integers with m ≥ d and ≥ d. Consider a set X ⊆ R d of n points in general position that is colored with at least m different colors.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Cutting a Part From Many Measures

Blagojević

Palić

Soberón

et al. 2019

Forum of Mathematics, Sigma

View full text Add to dashboard Cite

Holmsen, Kynčl and Valculescu recently conjectured that if a finite set X with n points in R d that is colored by m different colors can be partitioned into n subsets of points each, such that each subset contains points of at least d different colors, then there exists such a partition of X with the additional property that the convex hulls of the n subsets are pairwise disjoint.We prove a continuous analogue of this conjecture, generalized so that each subset contains points of at least c different colors, where we also allow c to be greater than d. Furthermore, we give lower bounds on the fraction of the points each of the subsets contains from c different colors. For example, when n ≥ 2, d ≥ 2, c ≥ d with m ≥ n(c − d) + d are integers, and µ 1 , . . . , µm are m positive finite absolutely continuous measures on R d , we prove that there exists a partition of R d into n convex pieces which equiparts the measures µ 1 , . . . , µ d−1 , and in addition every piece of the partition has positive measure with respect to at least c of the measures µ 1 , . . . , µm. 1 arXiv:1710.05118v3 [math.CO] 24 Jun 2019 2 BLAGOJEVIĆ, PALIĆ, SOBERÓN, AND ZIEGLERLet m ≥ 1, n ≥ 1 , c ≥ 1 and d ≥ 1 be integers, and let M = (µ 1 , . . . , µ m ) be a collection of m finite absolutely continuous measures in R d . Moreover, assume that µ j (R d ) > 0, for every 1 ≤ j ≤ m. For us a measure is an absolutely continuous measure if it is absolutely continuous with respect to the standard Lebesgue measure.We are interested in the existence of a convex partition (C 1 , . . . , C n ) of R d with the property that each set C i contains a positive amount of at least c of the measures, that isfor every 1 ≤ i ≤ n. In the case when the measures are given by finite point sets, we say that a point set X ⊆ R d is in general position if no d + 1 points from X lie in an affine hyperplane in R d . For the point set measures in general position Holmsen, Kynčl and Valculescu proposed the following natural conjecture [12, Con. 3].Conjecture 1.2 (Holmsen, Kynčl, Valculescu, 2017). Let d ≥ 2, ≥ 2, m ≥ 2 and n ≥ 1 be integers with m ≥ d and ≥ d. Consider a set X ⊆ R d of n points in general position that is colored with at least m different colors. If there exists a partition of the set X into n subsets of size such that each subset contains points colored by at least d colors, then there exists such a partition of X that in addition has the property that the convex hulls of the n subsets are pairwise disjoint.The conjecture was settled for d = 2 in the same paper by Holmsen, Kynčl and Valculescu [12]. On the other hand, if instead of finite collections of points one considers finite positive absolutely continuous measures in R d , Soberón [16] gave a positive answer on splitting d measures in R d into convex pieces such that each piece has positive measure with respect to each of the measures. Moreover, he proved existence of convex partitions that equipart all measures. A discretization of Soberón's result by Blagojević, Rote, Steinmeyer and Ziegler [5] gave...

show abstract