Sperner's lemma
Quizzes for review
(mathematics) A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors.
Sperner's lemma
During the seminar, she invoked Sperner's lemma to demonstrate that any triangulation of an n-dimensional simplex with a proper boundary-respecting coloring must contain a simplex whose vertices are colored with all n+1 colors.
During the seminar, she invoked Sperner's lemma to demonstrate that any triangulation of an n-dimensional simplex with a proper boundary-respecting coloring must contain a simplex whose vertices are colored with all n+1 colors.
English - English
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1