All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 14 Next

Displaying 261 – 280 of 663

Showing per page

Combinatorial lemmas for polyhedrons

Adam Idzik, Konstanty Junosza-Szaniawski (2005)

Discussiones Mathematicae Graph Theory

We formulate general boundary conditions for a labelling to assure the existence of a balanced n-simplex in a triangulated polyhedron. Furthermore we prove a Knaster-Kuratowski-Mazurkiewicz type theorem for polyhedrons and generalize some theorems of Ichiishi and Idzik. We also formulate a necessary condition for a continuous function defined on a polyhedron to be an onto function.

Combinatorial lemmas for polyhedrons I

Adam Idzik, Konstanty Junosza-Szaniawski (2006)

Discussiones Mathematicae Graph Theory

We formulate general boundary conditions for a labelling of vertices of a triangulation of a polyhedron by vectors to assure the existence of a balanced simplex. The condition is not for each vertex separately, but for a set of vertices of each boundary simplex. This allows us to formulate a theorem, which is more general than the Sperner lemma and theorems of Shapley; Idzik and Junosza-Szaniawski; van der Laan, Talman and Yang. A generalization of the Poincaré-Miranda theorem is also derived.

Combinatorial Nullstellensatz approach to polynomial expansion

Fedor Petrov (2014)

Acta Arithmetica

Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of |f(A,B)| for finite subsets A, B of a field, and a polynomial f(x,y) of the form f(x,y) = g(x) + yh(x), where the degree of g is greater than that of h.

Currently displaying 261 – 280 of 663