On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation.
other
Where this comes from
- Record sourced from PubMed, PMID 42664290.
- Also identified by DOI 10.1371/journal.pone.0356507.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
Motivated by an open problem in the literature stated by Mirzakhani and Vondrák, we give a lower bound of the number of non-monochromatic simplices for Sperner labelings of the vertices of a triangulation of a given k-simplex with vertices of integer coordinates. This triangulation maximizes the number of simplices over all the triangulations of the k-simplex with vertices of integer coordinates.
Medical subject headings
- Algorithms
- Models, Theoretical