Classifying unavoidable Tverberg partitions

DOI10.20382/JOCG.V8I1A9MaRDI QIDQ5745392zbMATH OpenOpenAlexFDO

Authors Boris Bukh, Po-Shen Loh, Gabriel Nivasch

Publication date 5 June 2018

Full work available at URL https://arxiv.org/abs/1611.01078

zbMATH Keywords

Tverberg partitionunavoidable

Mathematics Subject Classification ID

Discrete geometry (52C99)

Abstract: Let $T(d,r)=(r-1)(d+1)+1$ be the parameter in Tverberg's theorem, and call a partition $mathcalI$ of $1,2,ldots,T(d,r)$ into $r$ parts a "Tverberg type". We say that $mathcalI$ "occurs" in an ordered point sequence $P$ if $P$ contains a subsequence $P^{\prime }$ of $T(d,r)$ points such that the partition of $P^{\prime }$ that is order-isomorphic to $mathcalI$ is a Tverberg partition. We say that $mathcalI$ is "unavoidable" if it occurs in every sufficiently long point sequence. In this paper we study the problem of determining which Tverberg types are unavoidable. We conjecture a complete characterization of the unavoidable Tverberg types, and we prove some cases of our conjecture for $dle4$. Along the way, we study the avoidability of many other geometric predicates. Our techniques also yield a large family of $T(d,r)$-point sets for which the number of Tverberg partitions is exactly $(r-1){!}^d$. This lends further support for Sierksma's conjecture on the number of Tverberg partitions.

Recommendations

• On Tverberg partitions
• \({\mathcal T}\)-partitions
• A Generalization of the Classical Partition Theorems
• Partitions, their classes, and multicolour evenness
• On a general class of non-squashing partitions
• Unsplittable classes of separable permutations
• scientific article; zbMATH DE number 1415720
• Enumeration of unigraphical partitions
• Tverberg partitions and Borsuk-Ulam theorems.
• Classifications of the self-conjugate partitions

Cited in

(6)

• On the generalized Erdős-Kneser conjecture: proofs and reductions
• Fair splittings by independent sets in sparse graphs
• Tverberg’s theorem is 50 years old: A survey
• Avoidable algebraic subsets of Euclidean space
• Helly-type problems
• Colorful words and \(d\)-Tverberg complexes

This page was built for publication: Classifying unavoidable Tverberg partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745392)