We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the union of two PL collapsible subpolyhedra in terms of their simple homotopy type and certain local properties
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimiza...
AbstractLet P be a compact connected polyhedron. A categorical (contractible) cover {X1,…,Xk} of P i...
We present a short proof of S. Parsa's theorem that there exists a compact $n$-polyhedron $P$, $n\ge...
This volume is an introduction and a monograph about tight polyhedra. The treatment of the 2-dimensi...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
1 Topological and Geometrical Combinatorics Martin Tancer Abstract The task of the thesis is to pres...
Simple polyhedra are $2$-dimensional polyhedra and important objects in low-dimensional geometry and...
AbstractSuppose M is a connected PL 2-manifold and X is a compact connected subpolyhedron of M (X≠1 ...
AbstractLet M be a PL 2-manifold and X be a compact subpolyhedron of M and let E(X,M) denote the spa...
We show that there exists a correspondence between the equivalence classes of coverings of a polyhed...
We introduce PSN polytopes whose k-skeleton is combinatorially equivalent to that of a product of r ...
A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if...
AbstractThis paper contains a classification of the regular minimal abstract polytopes that act as c...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimiza...
AbstractLet P be a compact connected polyhedron. A categorical (contractible) cover {X1,…,Xk} of P i...
We present a short proof of S. Parsa's theorem that there exists a compact $n$-polyhedron $P$, $n\ge...
This volume is an introduction and a monograph about tight polyhedra. The treatment of the 2-dimensi...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
1 Topological and Geometrical Combinatorics Martin Tancer Abstract The task of the thesis is to pres...
Simple polyhedra are $2$-dimensional polyhedra and important objects in low-dimensional geometry and...
AbstractSuppose M is a connected PL 2-manifold and X is a compact connected subpolyhedron of M (X≠1 ...
AbstractLet M be a PL 2-manifold and X be a compact subpolyhedron of M and let E(X,M) denote the spa...
We show that there exists a correspondence between the equivalence classes of coverings of a polyhed...
We introduce PSN polytopes whose k-skeleton is combinatorially equivalent to that of a product of r ...
A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if...
AbstractThis paper contains a classification of the regular minimal abstract polytopes that act as c...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimiza...
DOI
Add to ORKG