Anna Felikson, Pavel Tumarkin
We show that there is no compact hyperbolic Coxeter d-polytope with d+4 facets for d>7. This bound is sharp: examples of such polytopes up to dimension 7 were found by Bugaenko (1984). We also show that in dimension d=7 the polytope with 11 facets is unique.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 (1970) and Poincare (1882) this gives the classification of all compact hyperbolic Coxeter n-polytopes with n+3 facets.
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$.
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 polytopes. We determine a potentially large combinatorial class of polytopes containing, in particular, all the compact hyperbolic Coxeter polytopes of dimension at least 6 which are known to be essential, and prove that this class contains finitely many polytopes only. We also construct an effective algorithm of classifying polytopes from this class, realize…
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ér, Kaplinskaja, Esselmann, and the second author, this implies that compact hyperbolic Coxeter polytopes with a unique pair of non-intersecting facets are completely classified. They do exist only up to dimension 6 and in dimension 8.
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 polytopes. We also obtain a similar result for simple non-compact polytopes.
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.
We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a sufficient condition for a codimension $1$ face to be actually arithmetic, as well as a few computed examples.
We establish some geometric constraints on compact Coxeter polytopes in hyperbolic spaces and show that these constraints can be a very useful tool for the classification problem of reflective anisotropic Lorentzian lattices and cocompact arithmetic hyperbolic reflection groups.
A polytope is called a Coxeter polytope if its dihedral angles are integer parts of $π$. 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 example in $H^{16}$ and show that it is unique.
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. Combined with results of Kaplinskaja (1974) and Esselmann (1996) this completes the classification of hyperbolic Coxeter n-polytopes of finite volume with n+2 facets.
In this paper we study $\times_0$-products of Lannér diagrams. We prove that every $\times_0$-product of at least four Lannér diagrams with at least one diagram of order $\ge 3$ is superhyperbolic. As a corollary, we obtain that known classifications exhaust all compact hyperbolic Coxeter polytopes that are combinatorially equivalent to products of simplices. We also consider compact hyperbolic Coxeter polytopes whose every Lannér subdiagram has order $2$. The second result of this paper slightly improves recent Burcroff's upper bound on the dimension of such polytopes to $12$.
Compact Hyperbolic Coxeter Six-dimensional Polytopes With Ten Facets
该研究完成了所有维度下具有$d+4$个面的紧双曲考克斯特$d$维多面体的分类，证明了具有10个面的紧双曲考克斯特6维多面体唯一，并通过精确方法完成了候选类型的穷举验证。
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 symmetric with respect to this facet. In this paper we classify Coxeter decompositions of simplices in hyperbolic space of dimension greater than 3. The problem is close to the classification of the finite index subgroups in the discrete hyperbolic reflection groups.
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 method for generating the combinatorial type of these polytopes via the classification of point set order types. In dimensions $4$ and $5$, there are $348$ and $51$ polytopes, respectively, yielding many new examples for further study. We furthermore provide new upper bounds on the dimension $d$ of compact hyperbolic Coxeter polytopes with $d+k$ facets for $…
In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+α$ vertices and $d+1+β$ facets is bounded by a constant independent of $d$.
We show that there exist 0/1 polytopes in R^n with as many as (cn / (log n)^2)^(n/2) facets (or more), where c>0 is an absolute constant.
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 well studied, there is not much known about the facets of the secondary polytope. The splits of a polytope, subdivisions with exactly two maximal faces, are the simplest examples of such facets and the first that were systematically investigated. The present paper can be seen as a continuation of these studies and as a starting point of an examination of th…
This paper presents a technique for constructing new chiral or regular polyhedra (or maps) from self-dual abstract chiral polytopes of rank 4. From improperly self-dual chiral polytopes we derive "Petrie-Coxeter-type" polyhedra (abstract chiral analogues of the classical Petrie-Coxeter polyhedra) and investigate their groups of automorphisms.
We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6. This implies that for all pairs (d,n) with n-d \leq 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n-d \leq 6. We show this result by showing this bound for a more general structure -- so-called matroid polytopes -- by reduction to a small number of satisfiability problems.
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 super-exponentially many $d$-polytopes with $d+4$ vertices, all have extension complexity $d+4$ except for some families of size $θ(d^2)$. On the other hand, we show that generic realizations of simplicial/simple $d$-polytopes with $d+1+α$ vertices/facets have extension complexity at least $2 \sqrt{d(d+α)} -d + 1$, which shows that for all $d>(\frac{α-1}{2})^2$ there are…
We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7, APrism_6$, Möbius ladder $M_{14}$, Dodecahedron, Heawood and Petersen graphs. For $K_8$, it shows that the huge lists of facets of the cut polytope $CUTP_8$ and cut cone $CUT_8$, given in [CR] is complete. We also confirm the conjecture that any facet of $CUTP_8$ is adjacent to a triangle facet. The lists of facets for $K_{1,l,m}$ with $(l,m)=(4,4),(3,5),(3,…
Expected extremal area of facets of random polytopes
该研究聚焦$\n\mathbb{R}^n$中单位球面随机点凸包构成的球面随机多面体，确定了其各面最大、最小表面积期望值在各固定维度下的渐近增长（精确到绝对常数）。
Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as the dimension increases. Regimes for $n$ and $d$ with different asymptotic behavior of these quantities are identified and asymptotic formulas in each case are established. Extensions of some known results in fixed dimension to the case where dimension tends to infinity are described.
We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m}*a*f), where n is the number of vertices, m is the number of facets, a is the number of vertex-facet incidences, and f is the total number of faces of P. This improves results of Fukuda and Rosta (1994), who described an algorithm for enumerating all faces of a d-polytope in O(min{n,m}*d*f^2) steps. For simple or simplicial d-polytopes our algorithm can be specialized to run in time O(d*a*f). Furthermore, applications of the algorithm to other ato…
By the results of Cannon, Wagreich and Parry, it is known that the growth rate of a cocompact Coxeter group in 2-dimensional hyperbolic space $H^2$ and 3-dimensional hyperbolic space $H^3$ is a Salem number. Kerada defined a j-Salem number, which is a generalization of a Salem number. In this paper, we realize infinitely many 2-Salem numbers as the growth rates of cocompact Coxeter groups in 4-dimensional hyperbolic space $H ^4$. Our Coxeter polytopes are constructed by successive gluing of Coxeter polytopes which we call Coxeter dominoes.
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating more information to a Coxeter diagram, one can furthermore determine the types and number of faces of such a polytope. This article provides a proof of this result, and uses it to provide a classification of the regular polytopes.
This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic polytopes are considered in parallel. The underlying finite Coxeter groups are those of simple Lie algebras of types An, Bn, Cn, F4 and of non-crystallographic Coxeter groups H3, H4. Our method consists in recursively decorating the appropriate Coxeter-Dynkin diagram. Each recursion step provides the essential information about faces of a specific dimension. If, at…
We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We also consider the cases of spherical and hyperbolic $n$-spaces. There we give some necessary conditions for the existence of a convex polytope with given facet areas, and some partial results about sufficient conditions for the existence of (convex) tetrahedra.
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 efficient method is recalled for the geometric description of G- polytopes, their faces of all dimensions and their adjacencies. Products and symmetrized powers of G-polytopes are introduced and their decomposition into the sums of G-polytopes is described. Several invariants of G-polytopes are found, namely the analogs of Dynkin indices of degrees 2 and 4, an…
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 number of vertices that a d-polytope with n facets can have according to the Upper Bound Theorem? We show that in dimension d=4, the answer is ``yes'', despite the fact that it is ``no'' if we restrict ourselves to the dual-to-cyclic polytopes. For each n>=5, we exhibit a realization of a polar-to-neighborly 4-dimensional polytope with n facets and a Hamilton pa…
We provide an affirmative answer to a problem posed by Barvinok and Veomett, showing that in general an n-dimensional convex body cannot be approximated by a projection of a section of a simplex of a sub-exponential dimension. Moreover, we establish a lower bound of the Banach-Mazur distance between n-dimensional projections of sections of an N-dimensional simplex and a certain convex symmetric body, which is sharp up to a logarithmic factor for all N>n.
In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still with combinatorial automorphism group transitive on vertices. We analyze the structure of the automorphism group, focusing in particular on polytopes with two kinds of regular facets occurring in an "alternating" fashion. In particular we use group amalgamations to prove that given two compatible n-polytopes P and Q, there exists a universal abstract semiregu…
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and algorithmic proof of that result. However, his algorithm has always exponential running time. We show that the problem to reconstruct the vertex-facet incidences of a simple polytope P from its graph can be formulated as a combinatorial optimization problem that is strongly dual to the problem of finding an abstract objective function on P (i.e., a shelling or…
We consider the task of reconstructing polytopes with fixed facet directions from finitely many support function evaluations. We show that for a fixed simplicial normal fan the least-squares estimate is given by a convex quadratic program. We study the geometry of the solution set and give a combinatorial characterization for the uniqueness of the reconstruction in this case. We provide an algorithm that, under mild assumptions, converges to the unknown input shape as the number of noisy support function evaluations increases. We also discuss limitations of our results if the restriction on th…
Brick polytopes of spherical subword complexes and generalized associahedra
将砖多胞形推广至有限Coxeter群的球面子词复形，为簇复形提供多胞形实现，并给出广义associahedra的顶点描述、Minkowski分解及交换矩阵组合描述。
When the standard representation of a crystallographic Coxeter group is reduced modulo an odd prime p, one obtains a finite group G^p acting on some orthogonal space over Z_p . If the Coxeter group has a string diagram, then G^p will often be the automorphism group of a finite abstract regular polytope. In parts I and II we established the basics of this construction and enumerated the polytopes associated to groups of rank at most 4, as well as all groups of spherical or Euclidean type. Here we extend the range of our earlier criteria for the polytopality of G^p . Building on this we investig…
Estranged facets and $k$-facets of Gaussian random point sets
本文研究维数趋于无穷且点数与维数成正比时的高斯随机多胞体，证明了面与 $k$-面期望数量的渐近公式，并确定了 $n=2d$ 时疏离面对期望数量的常数 $C$。
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1,197,362,269,604,214,277,200 many facets in 232 orbits.
For the Traveling Salesman Polytope on n cities T_n, we construct its approximation Q_k, k=1, 2, . . ., n^(1/3) using a projection of a polytope whose number of facets is polynomial in n (of degree linear in k). We show that T_n is contained in Q_k for each k, and that the scaling of Q_k by k/n+O(1/n) is contained in T_n for each k. We show that certain facets of T_n lie on the boundary of Q_k.
Let $X_1,\ldots,X_n$ be i.i.d.\ random points in the $d$-dimensional Euclidean space sampled according to one of the following probability densities: $$ f_{d,β} (x) = \text{const} \cdot (1-\|x\|^2)^β, \quad \|x\|\leq 1, \quad \text{(the beta case)} $$ and $$ \tilde f_{d,β} (x) = \text{const} \cdot (1+\|x\|^2)^{-β}, \quad x\in\mathbb{R}^d, \quad \text{(the beta' case).} $$ We compute exactly the expected intrinsic volumes and the expected number of facets of the convex hull of $X_1,\ldots,X_n$. Asymptotic formulae where obtained previously by Affentranger [The convex hull of random points with …
For a convex body B in a vector space V, we construct its approximation P_k, k=1, 2, . . . using an intersection of a cone of positive semidefinite quadratic forms with an affine subspace. We show that P_k is contained in B for each k. When B is the Symmetric Traveling Salesman Polytope on n cities T_n, we show that the scaling of P_k by n/k+ O(1/n) contains T_n for k no more than n/2. Membership for P_k is computable in time polynomial in n (of degree linear in k). We discuss facets of T_n that lie on the boundary of P_k. We introduce a new measure on each facet defining inequality for T_n in…
In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many more edges and 2-faces than there are vertices and facets, while complexity C(P) := (f_{03}-20)/(f_0+f_3-10) is large if every facet has many vertices, and every vertex is in many facets. Recent results suggest that these parameters might allow one to differentiate between the cones of f- or flag-vectors of -- connected Eulerian lattices of length 5 (combinato…
Voronoi and Delaunay (Delone) cells of the root and weight lattices of the Coxeter-Weyl groups W(an) and W(dn) are constructed. The face centered cubic (fcc) and body centered cubic (bcc)lattices are obtained in this context. Basic definitions are introduced such as parallelotope, fundamental simplex, contact polytope, root polytope, Voronoi cell, Delone cell, n-simplex, n-octahedron (cross polytope), n-cube and n-hemicube and their volumes are calculated. Voronoi cell of the root lattice is constructed as the dual of the root polytope which turns out to be the union of Delone cells. It is sho…
Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several methods which allow us to use symmetries for the computation of extreme rays and facets of cones. I give an algorithm for computing adjacencies using a linear programming approach. I give a complete description of the method of incidence, adjacency decomposition method and of the subcone method used for computing with symmetric cones.
Centro-affine spectral geometry of polytopes
本文为原点对称多面体建立中心仿射谱框架，用面加权图拉普拉斯类比光滑算子，证明局部极小多面体的首个非恒定偶特征值下界为$n-1+1/(n-1)$。
Many Facets in Random Polytopes from Product and Log-Concave Measures
该研究针对高维随机多面体的期望面数问题，推导了乘积测度下的下界、对数凹测度下的普适标度界，并构造非对数凹反例，揭示了测度性质对随机多面体面数的影响。
For an arbitrary cocompact hyperbolic Coxeter group G with finite generator set S and complete growth function P(x)/Q(x), we provide a recursion formula for the coefficients of the denominator polynomial Q(x) which allows to determine recursively the Taylor coefficients and the pole behavior of the growth function of G in terms of its Coxeter subgroup structure. We illustrate this in the easy case of compact right-angled hyperbolic n-polytopes. Finally, we provide detailed insight into the case of Coxeter groups with at most 6 generators, acting cocompactly on hyperbolic 4-space, by considerin…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。