On the number of colored Birch and Tverberg partitions

zbMath1300.05037arXiv1208.0509MaRDI QIDQ405313

Stephan Hell

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

discrete geometryTverberg partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Partitions; congruences and congruential restrictions (11P83) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (2)

Permanents of multidimensional matrices: Properties and applications ⋮ Tverberg’s theorem is 50 years old: A survey

Cites Work

• Unnamed Item
• Chessboard complexes indomitable
• Optimal bounds for a colorful Tverberg-Vrećica type problem
• A geometric proof of the colored Tverberg theorem
• On the number of Tverberg partitions in the prime power case
• On the number of Birch partitions
• Note on a conjecture of Sierksma
• Colourful simplicial depth
• A Colored Version of Tverberg's Theorem
• A Generalization of Radon's Theorem
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: On the number of colored Birch and Tverberg partitions