相关论文: Hyperbolic Coxeter n-polytopes with n+3 facets

Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are…

Beside simplices, $n$-cubes form an important class of simple polyhedra. Unlike hyperbolic Coxeter simplices, hyperbolic Coxeter $n$-cubes are not classified. We show that there is no hyperbolic Coxeter $n$-cube for $n\geq~6$, and provide a…

We compute the set of facets of the polytope which is the convex hull of the Coxeter groups $\mathsf{F}_4$ or $\mathsf{H}_4$: For the group $\mathsf{F}_4$ we found $2$ orbits of facets which contradicts previous results published in…

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

In this paper, we compute the covolume of the group of units of the quadratic form f_d^n(x) = x_1^2 + x_2^2 + . . . + x_n^2 - d x_{n+1}^2 with d an odd, positive, square-free integer. Mcleod has determined the hyperbolic Coxeter fundamental…

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

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

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…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…

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…

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…

This paper focuses on the investigation of volumes of large Coxeter hyperbolic polyhedron. First, the paper investigates the smallest possible volume for a large Coxeter hyperbolic polyhedron and then looks at the volume of pyramids with…

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

We determine the maximal hyperbolic reflection groups associated to the quadratic forms $-3x_0^2 + x_1^2 + ... + x_n^2$, $n \ge 2$, and present the Coxeter schemes of their fundamental polyhedra. These groups exist in dimensions up to 13,…

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…

Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…

We classify Coxeter decompositions of hyperbolic tetrahedra, i.e. simplices in the hyperbolic space H^3. The paper completes the classification of Coxeter decompositions of hyperbolic simplices.

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 classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…