相关论文: On compact hyperbolic Coxeter d-polytopes with d+4…

We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new…

We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…

In this paper, we obtain the complete classification for compact hyperbolic Coxeter four-dimensional polytopes with eight facets.

In this paper, we obtain a complete classification of 331 finite-volume hyperbolic Coxeter 4-dimensional polytopes with 7 facets.

We use methods of combinatorics of polytopes together with geometrical and computational ones to obtain the complete list of compact hyperbolic Coxeter n-polytopes with n+3 facets, 3<n<8. Combined with results of Esselmann (1994), Andreev…

A polytope is called a Coxeter polytope if its dihedral angles are integer parts of $\pi$. In this paper we prove that if a non-compact Coxeter polytope of finite volume in $H^n$ has exactly $n+3$ facets then $n\le 16$. We also find an…

We prove that, apart from some well-known low-dimensional examples, any compact hyperbolic Coxeter polytope has a pair of disjoint facets. This is one of very few known general results concerning combinatorics of compact hyperbolic Coxeter…

In this paper, we classify all the hyperbolic non-compact Coxeter polytopes of finite volume combinatorial type of which is either a pyramid over a product of two simplices or a product of two simplices of dimension greater than one.…

In this paper, we obtain a complete classification of compact hyperbolic Coxeter five-dimensional polytopes with nine facets.

We introduce a notion of essential hyperbolic Coxeter polytope as a polytope which fits some minimality conditions. The problem of classification of hyperbolic reflection groups can be easily reduced to classification of essential Coxeter…

A polytope in the hyperbolic space $\H^n$ is called an {\it ideal polytope} if all its vertices belong to the boundary of $\H^n$. We prove that no simple ideal Coxeter polytope exist in $\H^n$ for $n>8$.

It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…

The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…

We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…

In this paper we state a full classification for Coxeter polytopes in $\mathbb{H}^{n}$ with $n+3$ facets which are non-compact and have precisely one non-simple vertex.

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+\alpha$ vertices and $d+1+\beta$ facets is bounded by a constant independent of $d$.

We give a complete enumeration of all 2-neighborly $d$-polytopes with $d+9$ and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope $P_{6,10,15}$ with 10 vertices and 15 facets, and pyramids over $P_{6,10,15}$. In…

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

We prove the following: there are infinitely many finite-covolume (resp. cocompact) Coxeter groups acting on hyperbolic space H^n for every n < 20 (resp. n < 7). When n=7 or 8, they may be taken to be nonarithmetic. Furthermore, for 1 < n <…