Related papers: Coxeter polytopes with a unique pair of non-inters…
We show that the Coxeter polytopes that have finite volume in their Vinberg domains are exactly the quasiperfect Coxeter polytopes of negative type, i.e. the Coxeter polytopes that are contained in their properly convex Vinberg domain, at…
We prove that among four-dimensional ideal right-angled hyperbolic polytopes the 24-cell is of minimal volume and of minimal facet number. As a corollary, a dimension bound for ideal right-angled hyperbolic polytopes is obtained.
In this paper, we show that any Coxeter graph which defines a higher rank Coxeter group must have disjoint induced subgraphs each of which defines a hyperbolic or higher rank Coxeter group. We then use this result to demonstrate several…
We show that if a compact Kahler manifold X admits a cohomologically hyperbolic surjective endomorphism then its Kodaira dimension is non-positive. This gives an affirmative answer to a conjecture of Guedj in the holomorphic case. The main…
We construct infinite series of non-simple ideal hyperbolic Coxeter 4-polytopes whose growth rates are Perron numbers. This infinite series is the first example of such a non-compact infinite polytopal series.
Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice…
A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…
We develop a way of seeing a complete orientable hyperbolic $4$-manifold $\mathcal{M}$ as an orbifold cover of a Coxeter polytope $\mathcal{P} \subset \mathbb{H}^4$ that has a facet colouring. We also develop a way of finding totally…
In all dimensions $n \ge 4$ not of the form $4m+3$, we show that there exists a closed hyperbolic $n$-manifold which is not the boundary of a compact $(n+1)$-manifold. The proof relies on the relationship between the cobordism class and the…
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2\pi.$ The combinatorial information of these surfaces is shown to be identified with…
In this article we study adjoint hypersurfaces of geometric objects obtained by intersecting simple polytopes with few facets in $\mathbb{P}^5$ with the Grassmannian $\mathrm{Gr}(2,4)$. These generalize the positive Grassmannian, which is…
Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…
We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a…
The cusped hyperbolic n-orbifolds of minimal volume are well known for $n \leq 9$. Their fundamental groups are related to the Coxeter n-simplex groups $\Gamma_n$ listed in Table 1. In this work, we prove that $\Gamma_n$ has minimal growth…
Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…
It is well known that a compact two dimensional surface is homeomorphic to a polygon with the edges identified in pairs. This paper not only presents a new proof of this statement but also generalizes it to any connected $n$-dimensional…
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial subsets of 0/1-vectors. These polytopes are special knapsack-polytopes. It turns out that they have remarkable extremal properties. In…