✦ LIBER ✦

Existence of Balanced Simplices on Polytopes

✍ Scribed by Gerard van der Laan; Dolf Talman; Zaifu Yang

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 143 KB
Volume: 96
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3178

No coin nor oath required. For personal study only.

✦ Synopsis

The classic Sperner lemma states that in a simplicial subdivision of a simplex in R n and a labelling rule satisfying some boundary condition there is a completely labeled simplex. In this paper we first generalize the concept of completely labeled simplex to the concept of a balanced simplex. Using this latter concept we then present a general combinatorial theorem, saying that under rather mild boundary conditions on a given labelling function there exists a balanced simplex for any given simplicial subdivision of a polytope. This theorem implies the well-known lemmas of Sperner, Scarf, Shapley, and Garcia as well as some other results as special cases. An even more general result is obtained when the boundary conditions on the labelling function are not required to hold. This latter result includes several results of Freund and Yamamoto as special cases.

📜 SIMILAR VOLUMES

Derivation of the mechanical-energy bala

Derivation of the mechanical-energy balance: A plea for simplicity

📂 Article 📅 1956 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 95 KB 👁 2 views

On Subdivision Posets of Cyclic Polytope

On Subdivision Posets of Cyclic Polytopes

✍ Paul H. Edelman; Jörg Rambau; Victor Reiner 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 231 KB

There are two related poset structures, the higher Stasheff-Tamari orders, on the set of all triangulations of the cyclic d polytope with n vertices. In this paper it is shown that both of them have the homotopy type of a sphere of dimension nd -3. Moreover, we resolve positively a new special case

On the Maximal Width of Empty Lattice Si

On the Maximal Width of Empty Lattice Simplices

✍ Christian Haase; Günter M. Ziegler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 116 KB

We construct d-dimensional empty lattice simplices of arbitrarily high volume from (d -1)dimensional ones, while preserving the lattice width. In particular, we give an example of infinitely many empty 4-simplices of width 2.

On the Number of Lattice Free Polytopes

✍ Imre Bárány; Jean-Michel Kantor 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 110 KB

asked for estimates for the number of equivalence classes of lattice polytopes, under the group of unimodular affine transformations. What we investigate here is the analogous question for lattice free polytopes. Some of the results: the number of equivalence classes of lattice free simplices of vol

On Simplicity of the Maximal Eigenvalue

✍ Bojan Kuzma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 81 KB

It is shown that a maximal eigenvalue of a rank-one perturbed, compact, self-adjoint operator is automatically simple, if the norm of perturbation is large enough.

On the Number of Faces of Certain Transp

On the Number of Faces of Certain Transportation Polytopes

✍ Igor Pak 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Define the transportation polytope T n,m to be a polytope of non-negative n × m matrices with row sums equal to m and column sums equal to n. We present a new recurrence relation for the numbers f k of the k-dimensional faces for the transportation polytope T n,n+1 . This gives an efficient algorith