Related papers: Combinatorially rigid simple polytopes with d+3 fa…
We construct compact polyhedra with $m$-gonal faces whose links are generalized 3-gons. It gives examples of cocompact hyperbolic bildings of type $P(m,3)$. For $m=3$ we get compact spaces covered by Euclidean buildings of type $A_2$.
The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
We classify finite groups $G$ in $\mathrm{PGL}_{4}(\mathbb{C})$ such that $\mathbb{P}^3$ is $G$-birationally rigid.
An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. Examples of chiral polytopes have been difficult to find. A "mixing" construction…
Ordinary polytopes are known as a non-simplicial generalization of the cyclic polytopes. The face vectors of ordinary polytopes are shown to be log-concave.
The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
We classify the convex polytopes whose symmetry groups have two orbits on the flags. These exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
We give a simple construction for the hyperelliptic threefolds with group $D_4$, thus completing the classification of hyperelliptic threefolds.
We classify all real hypersurfaces with three distinct constant principal curvatures in complex hyperbolic spaces of dimension greater than two.
One can always decompose Dirichlet-Voronoi polytopes of lattices non-trivially into a Minkowski sum of Dirichlet-Voronoi polytopes of rigid lattices. In this report we show how one can enumerate all rigid positive semidefinite quadratic…
We define vertex cover algebras for weighted simplicial multicomplexes and prove basics properties of them. Also, we describe these algebras for multicomplexes which have only one maximal facet and we prove that they are finitely generated.
The paper deals with quasigroups having a trivial group of automorphisms and a trivial group of autotopisms. Examples of such quasigroups and methods of their verification are given.
We construct a hyperbolic three-manifold with trivial finite type invariants up to a given degree.
In this paper we will consider the 2-fold symmetric complex hyperbolic triangle groups generated by three complex reflections through angle 2pi/p with p no smaller than 2. We will mainly concentrate on the groups where some elements are…
We completely characterize the faces of the root polytope $\tilde Q_G = \text{conv}\{\mathbf 0, \mathbf e_i - \mathbf e_j\: (i,j) \in E(G)\}$ combinatorially. Our results specialize to state of the art results in a straightforward way.