Combinatorial formulae for multiple set-valued labellings
From MaRDI portal
(Redirected from Publication:1318097)
We develope the geometric notions of general position maps, \(\pi\)- balanced and \(\pi\)-subbalanced sets and then apply them to prove two general combinatorial formulae for multiple set-valued labellings on simplices related to the celebrated Sperner combinatorial lemma [Abh. Math. Semin. Univ. Hamb. 6, 265-272 (1928; JFM 54.0614.01)]. We apply one of the combinatorial formulae to covering theory of simplices and obtain a new covering theorem which is a common generalization of the Shapley theorem and the Gale theorem.
Recommendations
Cites work
- A combinatorial Lefschetz fixed-point formula
- A constructive proof of a permutation-based generalization of Sperner's lemma
- A generalization of Tychonoff's fixed point theorem
- Equilibrium in a discrete exchange economy with money
- scientific article; zbMATH DE number 3683519 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3422228 (Why is no real title available?)
- On Representatives of Subsets
- On the Sperner lemma
- Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
- STRENGTHENING OF SPERNER'S LEMMA APPLIED TO HOMOLOGY THEORY
- The Core of an N Person Game
Cited in
(4)
This page was built for publication: Combinatorial formulae for multiple set-valued labellings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318097)