• Thumbnail for Sperner's lemma
    In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent...
    30 KB (4,087 words) - 22:28, 28 August 2024
  • named after Emanuel Sperner, who published it in 1928. This result is sometimes called Sperner's lemma, but the name "Sperner's lemma" also refers to an...
    12 KB (2,010 words) - 10:08, 15 September 2022
  • Thumbnail for Emanuel Sperner
    generalizations, including the Sperner property of a partially ordered set. Sperner's lemma, from 1928, states that every Sperner coloring of a triangulation...
    4 KB (275 words) - 08:33, 12 January 2023
  • Thumbnail for Handshaking lemma
    of certain combinatorial structures. For example, in the proofs of Sperner's lemma and the mountain climbing problem the geometric properties of the formula...
    29 KB (3,598 words) - 00:10, 4 November 2024
  • local lemma Nakayama's lemma Poincaré's lemma Riesz's lemma Schur's lemma Schwarz's lemma Sperner's lemma Urysohn's lemma Vitali covering lemma Yoneda's...
    4 KB (402 words) - 00:58, 1 September 2024
  • Knaster, Kuratowski and Mazurkiewicz. The KKM lemma can be proved from Sperner's lemma and can be used to prove the Brouwer fixed-point theorem. Let Δ n −...
    15 KB (2,396 words) - 20:54, 11 September 2023
  • {\displaystyle f(P)_{j}\leq P_{j}.} By construction, this is a Sperner coloring. Hence, by Sperner's lemma, there is an n-dimensional simplex whose vertices are...
    61 KB (8,376 words) - 14:37, 17 November 2024
  • Thumbnail for Hairy ball theorem
    JSTOR 2320587 Jarvis, Tyler; Tanton, James (2004), "The Hairy Ball Theorem via Sperner's Lemma", American Mathematical Monthly, 111 (7): 599–603, doi:10.1080/00029890...
    14 KB (1,803 words) - 23:11, 4 November 2024
  • lemma Littlewood–Offord lemma Pólya–Burnside lemma Sperner's lemma Ky Fan lemma (combinatorial geometry) Berge's lemma Counting lemma Crossing lemma Expander...
    8 KB (524 words) - 11:06, 2 August 2024
  • Thumbnail for Borsuk–Ulam theorem
    Francis Edward (2013), "A Borsuk–Ulam equivalent that directly implies Sperner's lemma", The American Mathematical Monthly, 120 (4): 346–354, doi:10.4169/amer...
    14 KB (2,423 words) - 00:53, 18 November 2024
  • constrained. Hall's theorem can be proved (non-constructively) based on Sperner's lemma.: Thm.4.1, 4.2  The theorem has many applications. For example, for...
    21 KB (3,208 words) - 06:26, 15 June 2024
  • Lebesgue's number lemma Polytope Simplex Simplicial complex CW complex Manifold Triangulation Barycentric subdivision Sperner's lemma Simplicial approximation...
    5 KB (393 words) - 12:17, 30 October 2023
  • MR 0183653, S2CID 122892253. Lubell, D. (1966), "A short proof of Sperner's lemma", Journal of Combinatorial Theory, 1 (2): 299, doi:10.1016/S0021-9800(66)80035-2...
    4 KB (507 words) - 06:29, 12 October 2024
  • protocols are several protocols for envy-free division. They are based on Sperner's lemma. The merits of these protocols is that they put few restrictions on...
    14 KB (2,087 words) - 20:44, 29 January 2023
  • Thumbnail for Discrete geometry
    the study of fair division problems. Topics in this area include: Sperner's lemma Regular maps A discrete group is a group G equipped with the discrete...
    15 KB (1,575 words) - 05:36, 16 October 2024
  • point, but it doesn't describe how to find the fixed point (see also Sperner's lemma). For example, the cosine function is continuous in [−1, 1] and maps...
    11 KB (1,278 words) - 00:51, 3 February 2024
  • game with any number of players. Finding a three-colored point in Sperner's Lemma. Finding an envy-free cake-cutting when the utility functions are given...
    8 KB (1,003 words) - 06:53, 5 July 2024
  • coloring List coloring List edge-coloring Perfect graph Ramsey's theorem Sperner's lemma Strong coloring Subcoloring Tait's conjecture Total coloring Uniquely...
    7 KB (663 words) - 02:52, 24 September 2024
  • Thumbnail for Intermediate value theorem
    redirect targets Hairy ball theorem – Theorem in differential topology Sperner's lemma – Theorem on triangulation graph colorings Weisstein, Eric W. "Bolzano's...
    26 KB (4,319 words) - 09:12, 23 November 2024
  • Thumbnail for Tucker's lemma
    Francis Edward (2013), "A Borsuk–Ulam equivalent that directly implies Sperner's lemma", The American Mathematical Monthly, 120 (4): 346–354, doi:10.4169/amer...
    6 KB (869 words) - 13:05, 27 February 2024
  • Thumbnail for Equidissection
    upon extending p-adic valuations to the real numbers and extending Sperner's lemma to more general colored graphs. A dissection of a polygon P is a finite...
    29 KB (3,532 words) - 00:43, 22 August 2024
  • Thumbnail for Parity of zero
    explained by the degree sum formula. Sperner's lemma is a more advanced application of the same strategy. The lemma states that a certain kind of coloring...
    58 KB (7,493 words) - 00:09, 8 November 2024
  • Show that a straight line can contain points of only two colours. Use Sperner's lemma to show that every triangulation of the square into triangles meeting...
    5 KB (585 words) - 23:40, 5 January 2024
  • Francis Edward (2013), "A Borsuk–Ulam equivalent that directly implies Sperner's lemma", The American Mathematical Monthly, 120 (4): 346–354, doi:10.4169/amer...
    2 KB (255 words) - 21:35, 26 January 2022
  • Thumbnail for Existence theorem
     246. ISBN 978-0-521-55846-4. Schaefer, Uwe (3 December 2014). From Sperner's Lemma to Differential Equations in Banach Spaces : An Introduction to Fixed...
    6 KB (631 words) - 20:12, 16 July 2024
  • 1967 and already as an undergraduate published a research paper about Sperner's lemma, which he learned about from Hans Rademacher. He completed his doctorate...
    3 KB (282 words) - 03:06, 6 May 2022
  • topology now have a combinatorial analog in discrete Morse theory. Sperner's lemma Discrete exterior calculus Topological graph theory Combinatorial topology...
    5 KB (476 words) - 10:58, 19 August 2024
  • directions, in the case of simplices the combinatorial result known as Sperner's lemma is used to guarantee the existence of an appropriate subsimplex. Once...
    25 KB (3,237 words) - 13:30, 28 September 2024
  • and there also exists an EF2 allocation (proof using a variant of Sperner's lemma). For n {\displaystyle n} agents with additive binary valuations (every...
    25 KB (3,593 words) - 18:10, 23 August 2024
  • can be reduced to 2D-SPERNER (computing a fully-labeled triangle in a triangulation satisfying the conditions to Sperner's lemma), and therefore it is...
    25 KB (3,881 words) - 23:29, 29 July 2024