Der kombinatorische Kern des Spernerschen Lemmas; eine Beweisanalyse

MaRDI QIDQ796535zbMATH OpenFDO

Authors Guenter Pickert

Publication date 1984

Published in Mathematische Semesterberichte (Search for Journal in Brave)

zbMATH Keywords

simplicial designSperner's lemma

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Other problems of combinatorial convexity (52A37)

Review text

By analysing the operative proof of \textit{R. Struve} and \textit{E. Wittmann} [ibid. 31, 134-141 (1984; reviewed above)] the author develops the concept of the n-dimensional simplicial design (\(n\in {\mathbb{N}})\) in analogy to the t-design. With the help of the n-dimensional simplicial plan be succeeds in proving Sperner's lemma in a very transparent way. Applying to this an n-dimensional simplicial design is meant to be an ordered pair (P,B) with P being a finite set and B being a nonempty set of subsets of P with \(n+1\) elements fulfilling special properties.

Recommendations

• Ein operativer Beweis des Spernerschen Lemmas
• A proof of the Sperner lemma from the Brouwer fixed point theorem
• The additivity of the volume and Sperner's lemma
• Combinatorial lemmas for oriented complexes
• scientific article; zbMATH DE number 998414

Cited in

(3)

• Reziprozitätsgesetze in der kombinatorischen Zähltheorie
• scientific article; zbMATH DE number 3841921 (Why is no real title available?)
• Ein operativer Beweis des Spernerschen Lemmas

This page was built for publication: Der kombinatorische Kern des Spernerschen Lemmas; eine Beweisanalyse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796535)