On the number of colored Birch and Tverberg partitions (Q405313): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 17:19, 29 June 2023

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references