2005
DOI: 10.7151/dmgt.1264
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial Lemmas for Polyhedrons

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 12 publications
1
1
0
Order By: Relevance
“…For the same point x, our avoiding cones condition requires much less: only if all the other N − M components of f (x) are null, then at least one of those M inequalities must be satisfied. This shows that our Corollary 5 also generalizes [16,Theorem 3.4]. Similar considerations also apply to other variants of the Poincaré-Miranda theorem for sets D which are product of balls instead of intervals, as for instance in [21,Corollary 2].…”
Section: Theorem 4 Let H : R N → R N Be a Homeomorphism Such That H(supporting
confidence: 66%
See 1 more Smart Citation
“…For the same point x, our avoiding cones condition requires much less: only if all the other N − M components of f (x) are null, then at least one of those M inequalities must be satisfied. This shows that our Corollary 5 also generalizes [16,Theorem 3.4]. Similar considerations also apply to other variants of the Poincaré-Miranda theorem for sets D which are product of balls instead of intervals, as for instance in [21,Corollary 2].…”
Section: Theorem 4 Let H : R N → R N Be a Homeomorphism Such That H(supporting
confidence: 66%
“…After his pioneering work, many other researchers found applications of Theorem 1, and different generalizations have been proposed, see e.g. [5,16,21,23,24,28,29,[31][32][33][34].…”
Section: (1b)mentioning
confidence: 99%