Colored Tverberg theorem with new constraints on the faces
Abstract
In this paper, we prove a version of the Colored Tverberg Theorem with new constraints on the faces, in which we limit the number of faces with each one of the colors.
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.