On the number of colored Birch and Tverberg partitions (Q405313): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / review text | |||
Summary: \textit{P. V. M. Blagojević} et al. [``Optimal bounds for the colorful Tverberg problem'', Preprint, \url{arXiv:0910.4987}] established the first tight colored Tverberg~theorem. We develop a colored version of our previous results [the author, Discrete Comput. Geom. 40, No. 4, 586--594 (2008; Zbl 1169.05008)]: Evenness and non-trivial lower bounds for the number of colored Tverberg partitions. Both properties follow from similar results on the number of colored Birch partitions. | |||
| Property / review text: Summary: \textit{P. V. M. Blagojević} et al. [``Optimal bounds for the colorful Tverberg problem'', Preprint, \url{arXiv:0910.4987}] established the first tight colored Tverberg~theorem. We develop a colored version of our previous results [the author, Discrete Comput. Geom. 40, No. 4, 586--594 (2008; Zbl 1169.05008)]: Evenness and non-trivial lower bounds for the number of colored Tverberg partitions. Both properties follow from similar results on the number of colored Birch partitions. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05A18 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 11P83 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 52A20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6340247 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
discrete geometry | |||
| Property / zbMATH Keywords: discrete geometry / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Tverberg partitions | |||
| Property / zbMATH Keywords: Tverberg partitions / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1208.0509 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Colored Version of Tverberg's Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal bounds for a colorful Tverberg-Vrećica type problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Colourful simplicial depth / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of Tverberg partitions in the prime power case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of Birch partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 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 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A geometric proof of the colored Tverberg theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Generalization of Radon's Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chessboard complexes indomitable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on a conjecture of Sierksma / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3001813 / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreibacxqrawhstxfcbu42suiehtdox7jfvwonmrmma3tuxr5ulaf37y / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:21, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of colored Birch and Tverberg partitions |
scientific article |
Statements
On the number of colored Birch and Tverberg partitions (English)
0 references
4 September 2014
0 references
Summary: \textit{P. V. M. Blagojević} et al. [``Optimal bounds for the colorful Tverberg problem'', Preprint, \url{arXiv:0910.4987}] established the first tight colored Tverberg~theorem. We develop a colored version of our previous results [the author, Discrete Comput. Geom. 40, No. 4, 586--594 (2008; Zbl 1169.05008)]: Evenness and non-trivial lower bounds for the number of colored Tverberg partitions. Both properties follow from similar results on the number of colored Birch partitions.
0 references
discrete geometry
0 references
Tverberg partitions
0 references
