On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation
Luis Ángel Calvo Pascual, Susana Merchán Rubira, Dulcinea Raboso Paniagua, Javier Rodrigo Hitos, José Samuel Rodríguez García · 2026
Read On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation by Luis Ángel Calvo Pascual, Susana Merchán Rubira, Dulcinea Raboso Paniagua, Javier Rodrigo Hitos, José Samuel Rodríguez García (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/plos-pone-0356507.txt.
Description
Luis Ángel Calvo Pascual and four co-authors tackle a pure combinatorics problem posed by earlier researchers about colored triangulations. A Sperner labeling paints the corners of a sliced-up triangle-like shape under strict rules. Rainbow-colored small pieces are guaranteed to appear. The open question asks how few such pieces can possibly occur. Working with the regular triangulation that packs in the most pieces overall, the authors prove a floor on the count of non-rainbow pieces.
Their lower bound answers the motivating problem in this maximal setting, showing that non-uniform pieces cannot be squeezed below a stated quantity. The paper is brief and proof-driven, with no data or experiments. Its audience is specialists in combinatorics and discrete geometry who use such labelings in fair division and fixed point arguments.
Catalog record
| CREATOR | Luis Ángel Calvo Pascual, Susana Merchán Rubira, Dulcinea Raboso Paniagua, Javier Rodrigo Hitos, José Samuel Rodríguez García |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 33293 |
| LICENSE | CC_BY |
| RIGHTS | CC BY |
| SOURCE | PLOS |