Combinatorial formulae for multiple set-valued labellings (Q1318097)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 537285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial formulae for multiple set-valued labellings |
scientific article; zbMATH DE number 537285 |
Statements
Combinatorial formulae for multiple set-valued labellings (English)
0 references
26 April 1994
0 references
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.
0 references
position maps
0 references
multiple set-valued labellings
0 references
Sperner combinatorial lemma
0 references
covering theorem
0 references
Shapley theorem
0 references
Gale theorem
0 references
0 references
0.7951312065124512
0 references
0.7895412445068359
0 references
0.7835900783538818
0 references
0.7729416489601135
0 references
