Variations of Helly's theorem for convex splinters

Iris Ye; Pablo Sober\'on

arxiv: 2606.23437 · v1 · pith:QX7JMYXSnew · submitted 2026-06-22 · 🧮 math.CO

Variations of Helly's theorem for convex splinters

Pablo Sober\'on , Iris Ye This is my paper

Pith reviewed 2026-06-26 07:39 UTC · model grok-4.3

classification 🧮 math.CO

keywords convex splintersHelly's theoremTverberg's theoremfractional Hellycolorful Hellyaffine dependenceconvex geometry

0 comments

The pith

Convex splinters satisfy fractional Helly, colorful Helly, and Tverberg theorems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that several intersection theorems originally proved for convex sets continue to hold when the objects are convex splinters instead. A convex splinter is a union of convex pieces in which every minimal affine dependent set stays inside a single piece. A sympathetic reader would care because the splinter condition is weaker than full convexity yet still lets the classical results apply, enlarging the sets to which Helly-type conclusions can be drawn. The work is motivated by questions about flat transversals to families of convex sets.

Core claim

A convex splinter K is a union of convex sets in R^d such that every minimal affine dependent set contained in K lies inside one of the convex pieces. Under this condition the fractional Helly theorem, the colorful Helly theorem, and Tverberg's theorem all hold for K with the same quantitative parameters that they have for convex sets.

What carries the argument

The convex splinter condition, which forces every minimal affine dependent set inside the union to lie entirely within one convex piece.

If this is right

If every d+1 members of a family of convex splinters have nonempty intersection, then the whole family has nonempty intersection.
The fractional Helly theorem supplies a lower bound on the size of the largest intersecting subfamily in terms of the fraction of intersecting d+1-tuples.
In the colorful setting, one convex splinter from each of d+1 color classes can be chosen so that their intersection is nonempty whenever every transversal meets the Helly condition.
Tverberg's theorem partitions any sufficiently large point set inside a convex splinter into r subsets whose convex hulls share a common point.
The same quantitative constants that work for convex sets work for convex splinters.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The extensions may produce new Helly-type statements about flat transversals, the original motivation for studying splinters.
Similar transfer arguments could be tested on other classical theorems in combinatorial convexity that rely on affine dependence.
The splinter condition itself might be used as a design principle when constructing non-convex sets that still obey strong intersection properties.

Load-bearing premise

The splinter condition on minimal affine dependent sets is enough to transfer the intersection theorems from the individual convex pieces to their union.

What would settle it

A concrete union of convex sets that meets the splinter definition yet contains a family of sets in which every d+1 intersect but the whole family has empty intersection.

read the original abstract

A convex splinter $K$ is a union of convex sets in $\mathbb{R}^d$ such that every minimal affine dependent set of $\mathbb{R}^d$ contained in $K$ is contained in one of the sets. The study of convex splinters was motivated by the study of flat transversals to convex sets. We extend several variations of Helly's theorem from convex geometry to convex splinters. These include fractional and colorful variations of Helly's theorem. We also extend Tverberg's theorem to convex splinters.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Convex splinters get fractional Helly, colorful Helly, and Tverberg extensions via a new definition that localizes affine dependence, but the transfer needs explicit checks beyond the abstract.

read the letter

Colleague,

The paper defines a convex splinter as a union of convex sets where every minimal affine dependent set inside the union sits inside one piece. It then claims that fractional Helly, colorful Helly, and Tverberg all carry over to these objects.

The definition is genuinely new and motivated by flat transversals, which gives the work a clear starting point. Stating the three extensions in one place is useful for anyone tracking Helly-type results in combinatorial convex geometry.

The soft spot is whether the splinter condition is enough on its own. The definition controls affine dependence, but fractional and colorful statements also rely on convex combinations, Radon partitions, or selection arguments that may not localize even when dependence does. The stress-test note flags this correctly. If the full paper only invokes the standard proofs without showing how the extra structure survives the union, the claims rest on an unverified assumption. Minor gaps in the write-up of those steps would be fixable; a counterexample where the condition holds but one of the numbers fails would be more serious.

No sign of circularity or free parameters in the abstract. The work stays within the usual citation pattern for this corner of discrete geometry.

This is for people already following Helly and Tverberg variations. A reader in that subfield will get direct value from the new object and the stated extensions. It has enough substance and formal grounding to deserve a serious referee rather than a desk reject.

Referee Report

3 major / 2 minor

Summary. The manuscript defines a convex splinter as a union of convex sets in R^d such that every minimal affine dependent set contained in the union lies inside one of the convex pieces. It claims to extend the fractional Helly theorem, the colorful Helly theorem, and Tverberg's theorem from convex sets to convex splinters, motivated by the study of flat transversals.

Significance. If the claimed extensions are valid, the work enlarges the class of sets to which classical Helly-type and Tverberg-type results apply, without introducing free parameters or ad-hoc adjustments. This could be useful for applications involving unions of convex sets that satisfy the splinter condition, such as certain transversals in combinatorial convexity.

major comments (3)

[Definition 2.1 and §3–4] Definition 2.1 (convex splinter): the condition is stated solely in terms of minimal affine dependent sets localizing to one piece. The extensions to fractional Helly and colorful Helly (Theorems 3.1 and 4.2) additionally require localization of convex combinations, Radon partitions, or measure selections; the manuscript does not exhibit an explicit argument showing why the affine-dependence condition suffices for these stronger properties to transfer to the union.
[Theorem 5.1] Proof of Tverberg extension (Theorem 5.1): the argument invokes the standard Tverberg theorem on the pieces but does not verify that a Tverberg partition of the union can be chosen so that each part remains inside a single convex piece when the splinter condition holds. A configuration satisfying the definition yet admitting no such localized partition would falsify the claim.
[§3] §3, fractional Helly statement: the claimed Helly number remains d+1, but the proof sketch does not address whether the fractional intersection condition can be satisfied by selections that cross multiple pieces even when all minimal dependent sets are localized.

minor comments (2)

[§2] Notation for the convex pieces and the union K is introduced without a consistent global symbol; a single notation table or fixed symbols would improve readability.
[Introduction] The abstract states the results but the introduction does not compare the splinter condition with existing notions such as convex unions with bounded piercing number or (p,q)-theorems.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and the recommendation for major revision. Below we respond point by point to the major comments, clarifying the role of the splinter condition and indicating the expansions we will make to the proofs.

read point-by-point responses

Referee: [Definition 2.1 and §3–4] Definition 2.1 (convex splinter): the condition is stated solely in terms of minimal affine dependent sets localizing to one piece. The extensions to fractional Helly and colorful Helly (Theorems 3.1 and 4.2) additionally require localization of convex combinations, Radon partitions, or measure selections; the manuscript does not exhibit an explicit argument showing why the affine-dependence condition suffices for these stronger properties to transfer to the union.

Authors: Any convex combination or Radon partition is itself an affine dependence. Consequently, the splinter condition already forces such combinations and partitions to lie inside a single piece. We will insert a short auxiliary lemma immediately after Definition 2.1 that derives the localization of convex combinations and Radon partitions directly from the given condition; this lemma will be invoked explicitly in the proofs of Theorems 3.1 and 4.2. revision: yes
Referee: [Theorem 5.1] Proof of Tverberg extension (Theorem 5.1): the argument invokes the standard Tverberg theorem on the pieces but does not verify that a Tverberg partition of the union can be chosen so that each part remains inside a single convex piece when the splinter condition holds. A configuration satisfying the definition yet admitting no such localized partition would falsify the claim.

Authors: The proof first obtains a Tverberg partition for each convex piece separately. Suppose, for a contradiction, that some part of the combined partition contains points from two distinct pieces. The barycentric coordinates of those points would then produce a minimal affine dependence that crosses pieces, contradicting Definition 2.1. We will add this short contradiction argument to the proof of Theorem 5.1. revision: yes
Referee: [§3] §3, fractional Helly statement: the claimed Helly number remains d+1, but the proof sketch does not address whether the fractional intersection condition can be satisfied by selections that cross multiple pieces even when all minimal dependent sets are localized.

Authors: A fractional selection whose support crosses pieces would, by the definition of fractional Helly, admit a convex combination that realizes a positive-measure intersection point; the minimal affine dependence implicit in that combination would again cross pieces, which is forbidden by the splinter condition. Hence the fractional Helly number stays d+1. We will expand the proof sketch in Section 3 to include this observation. revision: yes

Circularity Check

0 steps flagged

No circularity: new definition with independent extension of Helly/Tverberg theorems

full rationale

The paper explicitly defines the convex splinter object via an affine-dependence localization condition on a union of convex sets, then states that standard proofs of fractional Helly, colorful Helly, and Tverberg carry over to this class. No equation or claim reduces a derived quantity to a fitted parameter or to a prior result by the same authors; the splinter condition is introduced as a primitive assumption rather than derived from the target theorems. The provided text contains no self-citations that bear the load of the central claims, nor any renaming of known results or smuggling of ansatzes. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Only the abstract is available, so the ledger records the introduction of the new object 'convex splinter' as the main addition. No free parameters or standard mathematical axioms are mentioned.

invented entities (1)

convex splinter no independent evidence
purpose: A union of convex sets satisfying the minimal affine dependent set condition, to which Helly-type theorems are extended
Explicitly introduced in the abstract as the central new concept motivated by flat transversals

pith-pipeline@v0.9.1-grok · 5603 in / 1143 out tokens · 34630 ms · 2026-06-26T07:39:42.391656+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

2 extracted references · 1 linked inside Pith

[1]

Arocha and Javier Bracho,A Helly type theorem for abstract projective geometries, Discrete Comput

[AB11] Jorge L. Arocha and Javier Bracho,A Helly type theorem for abstract projective geometries, Discrete Comput. Geom.45(2011), no. 2, 223–229. [ABM07] Jorge L. Arocha, Javier Bracho, and Luis Montejano,Flat transversals to flats and convex sets of a fixed dimension, Adv. Math.213(2007), no. 2, 902–918. [ADLS17] Nina Amenta, Jes´ us A. De Loera, and Pab...

arXiv 2011
[2]

[PPV24] Olimjoni Pirahmad, Alexandr Polyanskii, and Alexey Vasilevskii,Intersecting diametral balls induced by a geometric graph, Discrete Comput

[Pol16] Alexandr Polyanskii,Helly-type theorem for eigenvectors, arXiv preprint arXiv:1611.03251 (2016). [PPV24] Olimjoni Pirahmad, Alexandr Polyanskii, and Alexey Vasilevskii,Intersecting diametral balls induced by a geometric graph, Discrete Comput. Geom.71(2024), no. 2, 480–497. [PYZ25] Cosmin Pohoata, Kevin Yang, and Shengtong Zhang,Colorful Helly via...

Pith/arXiv arXiv 2016

[1] [1]

Arocha and Javier Bracho,A Helly type theorem for abstract projective geometries, Discrete Comput

[AB11] Jorge L. Arocha and Javier Bracho,A Helly type theorem for abstract projective geometries, Discrete Comput. Geom.45(2011), no. 2, 223–229. [ABM07] Jorge L. Arocha, Javier Bracho, and Luis Montejano,Flat transversals to flats and convex sets of a fixed dimension, Adv. Math.213(2007), no. 2, 902–918. [ADLS17] Nina Amenta, Jes´ us A. De Loera, and Pab...

arXiv 2011

[2] [2]

[PPV24] Olimjoni Pirahmad, Alexandr Polyanskii, and Alexey Vasilevskii,Intersecting diametral balls induced by a geometric graph, Discrete Comput

[Pol16] Alexandr Polyanskii,Helly-type theorem for eigenvectors, arXiv preprint arXiv:1611.03251 (2016). [PPV24] Olimjoni Pirahmad, Alexandr Polyanskii, and Alexey Vasilevskii,Intersecting diametral balls induced by a geometric graph, Discrete Comput. Geom.71(2024), no. 2, 480–497. [PYZ25] Cosmin Pohoata, Kevin Yang, and Shengtong Zhang,Colorful Helly via...

Pith/arXiv arXiv 2016