Colored Tverberg Theorems for non-prime powers
Abstract
We prove a relative of the Optimal (Type B) Colored Tverberg theorem of Zivaljevi\'c and Vre\'cica which modifies this results in two different ways. (1) Our result is valid if the number of rainbow faces is q= pn-1, where p is a prime. (2) The size of rainbow simplices satisfies the condition Ci ∈ \2q-2, 2q+1\ while in the original theorem Ci = 2q-1 for all i.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.