The well known Sperner lemma states that in a simplicial subdivision of a simplex with a properly labeled boundary there is a completely labeled simplex. We present two combinatorial theorems on polytopes which generalize Sperner's lemma.Using balanced simplices, a generalized concept of completely labeled simplices, a uni ed existence result of balanced simplices in any simplicial subdivision of a polytope is given.This theorem implies the well-known lemmas of Sperner, Scarf, Shapley, and Garcia as well as some other results as special cases.A second theorem which imposes no restrictions on the integer labeling rule is established; this theorem implies several results of Freund
AbstractIn this journal, Daniel I. A. Cohen [2] gave a proof of the strong Sperner lemma based on “s...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner colo...
AbstractThe classic Sperner lemma states that in a simplicial subdivision of a simplex in Rn and a l...
The classic Sperner lemma states that in a simplicial subdivision of a simplex in
We formulate general boundary conditions for a labelling of vertices of a triangulation of a polyhed...
AbstractWe prove the following conjecture of Atanassov (Studia Sci. Math. Hungar.32 (1996), 71–74). ...
We prove the following conjecture of Atanassov (Studia Sci. Math. Hungar.32 (1996), 71–74). Let T be...
International audienceIn 1989, Robert W. Freund published an article about generalizations of the Sp...
AbstractIn 1989, Robert W. Freund published an article about generalizations of the Sperner lemma fo...
We formulate general boundary conditions for a labelling to assure the existence of a balanced n-sim...
Abstract. The octahedral projection can be used to obtain the octahedral sub-division for a given si...
AbstractIn 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
In this paper, we present a combinatorial theorem on a bounded polyhedron for an unrestricted intege...
AbstractIn this journal, Daniel I. A. Cohen [2] gave a proof of the strong Sperner lemma based on “s...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner colo...
AbstractThe classic Sperner lemma states that in a simplicial subdivision of a simplex in Rn and a l...
The classic Sperner lemma states that in a simplicial subdivision of a simplex in
We formulate general boundary conditions for a labelling of vertices of a triangulation of a polyhed...
AbstractWe prove the following conjecture of Atanassov (Studia Sci. Math. Hungar.32 (1996), 71–74). ...
We prove the following conjecture of Atanassov (Studia Sci. Math. Hungar.32 (1996), 71–74). Let T be...
International audienceIn 1989, Robert W. Freund published an article about generalizations of the Sp...
AbstractIn 1989, Robert W. Freund published an article about generalizations of the Sperner lemma fo...
We formulate general boundary conditions for a labelling to assure the existence of a balanced n-sim...
Abstract. The octahedral projection can be used to obtain the octahedral sub-division for a given si...
AbstractIn 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
In this paper, we present a combinatorial theorem on a bounded polyhedron for an unrestricted intege...
AbstractIn this journal, Daniel I. A. Cohen [2] gave a proof of the strong Sperner lemma based on “s...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner colo...