Construct · 1 fields · 1 citations

Sperner's lemma: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Sperner'slemma1 CONSTRUCTSperner's lemmaSPERNER · ALGORITHMIC GAME

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithmic game theory

the combinatorial result that a suitably labeled triangulation of a simplex always contains a fully labeled cell, a discrete counterpart of fixed-point theorems.

In algorithmic game theory, Sperner's lemma refers to the combinatorial result that a suitably labeled triangulation of a simplex always contains a fully labeled cell, a discrete counterpart of fixed-point theorems. This meaning comes from Sperner (1928) in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Sperner's lemma sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

cell2 fields · 3 citationsjingle · one word, two constructsgame2 fields · 3 citationsjingle · one word, two constructslemma1 fields · 3 citationsanchor · a standalone construct

References

  1. Sperner, E. (1928). Neuer beweis für die invarianz der dimensionszahl und des gebietes. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 6(1), 265-272. https://doi.org/10.1007/bf02940617

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct