TOPICS
Search

Geometric Join


The geometric join of nonempty finite sets X_1,...,X_m subset R^d is the union of the convex hulls of all selections containing at most one point from each X_i (Bárány et al. 2015). The sets X_i are called color classes, and such a selection is called colorful. The geometric join is therefore a union of colorful simplices and need not be convex.

Lee (2026) constructed, for each integer d>=4, [(d-1)^2/2] color classes in R^d whose geometric join is not contractible, where [x] denotes the ceiling function. This refutes the conjecture that at least d+1 color classes always suffice for contractibility. Lee (2026) also proved that more than d(d-1)/2 color classes suffice for contractibility when d>=3. For d>=3, at least [d^2/2] color classes always give a star convex set, and this threshold is sharp. Lee (2026) reports that ChatGPT discovered the initial lifting argument and that the remaining proofs were developed with OpenAI and Anthropic models and verified by the author.


See also

Contractible, Convex Hull, Star Convex

Explore with Wolfram|Alpha

References

Bárány, I.; Holmsen, A.; and Karasev, R. "Topology of Geometric Joins." Disc. Comput. Geom. 53, 402-413, 2015.Lee, D. "On Contractibility of Geometric Joins." 17 Nov 2026. https://arxiv.org/abs/2611.22182.

Cite this as:

Weisstein, Eric W. "Geometric Join." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GeometricJoin.html

Subject classifications