Related Experiment Video
Updated: Aug 30, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation
Luis Ángel Calvo Pascual1,2, Susana Merchán Rubira3, Dulcinea Raboso Paniagua4
1Comillas Pontifical University, Madrid, Spain.
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.
Related Concept Videos
Vector Forms of Green’s Theorem
Quadric Surfaces
Green’s Theorem
Second Uniqueness Theorem
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
Extended Versions of Green’s Theorem
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
