On the number of Tverberg partitions in the prime power case

We give an extension of the lower bound of [9] for the number of Tverberg partitions from the prime to the prime power case. Our proof is inspired by the Zp-index version of the proof in [3] and uses Volovikov’s Lemma. Analogously, one obtains an extension of the lower bound for the number of different splittings of a generic necklace to the prime power case.

• Type: Journal
• Year: 2007
• Where: EJC
• Authors: Stephan Hell
• Keywords: EJC 2007, Information Technology, Lower Bound, Prime Power Case, Tverberg Partitions