On the number of Tverberg partitions in the prime power case
Stephan Hell
Abstract
We give an extension of the lower bound of Vucic and Zivaljevic 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 Matousek's book "Using the Borsuk-Ulam Theorem" 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.
Create a lesson
Related papers
2-large sets are sets of nil-Bohr recurrence
Ryan Alweiss, Sohail Farhangi
New tools for sparse graph embeddings: Hybrid expanders and application to nested cycles
Nemanja Draganić
Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections
Lihua You, Xiaoxue Zhang, Xinghui Zhao
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar et al.
The (km,kn)-square paths theorem
Dun Qiu, Minhao Zhang
Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph
Joseph Natal, Oleksiy Al-saadi