Combinatorial Lemmas for Polyhedrons
Copyright policy )Combinatorial Lemmas for Polyhedrons
Summary: 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 Ichushi and Idzik. We also formulate a necessary condition for a continuous function defined on a polyhedron to be an onto function.
- Warsaw University of Technology Poland
- Jan Kochanowski University Poland
pseudomanifold, Fixed-point theorems, Sperner lemma, Fixed-point and coincidence theorems (topological aspects), labelling, primoid, simplicial complex, Convex sets in \(n\) dimensions (including convex hypersurfaces), KKM covering, Other designs, configurations
pseudomanifold, Fixed-point theorems, Sperner lemma, Fixed-point and coincidence theorems (topological aspects), labelling, primoid, simplicial complex, Convex sets in \(n\) dimensions (including convex hypersurfaces), KKM covering, Other designs, configurations
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!