中文
相关论文

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

200 篇论文

In 2010, Kerckhoff and Storm discovered a path of hyperbolic 4-polytopes eventually collapsing to an ideal right-angled cuboctahedron. This is expressed by a deformation of the inclusion of a discrete reflection group (a right-angled…

几何拓扑 · 数学 2023-04-18 Stefano Riolo , Andrea Seppi

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…

几何拓扑 · 数学 2021-11-18 Naomi Bredon

The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…

数学物理 · 物理学 2021-01-28 Mariia Myronova , Jiri Patera , Marzena Szajewska

In this paper we show how to obtain representations of Coxeter groups acting on H^n to certain classical groups. We determine when the kernel of such a representation is torsion-free and thus the quotient a hyperbolic n-manifold.

几何拓扑 · 数学 2007-06-13 Brent Everitt , Colin Maclachlan

Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…

组合数学 · 数学 2011-09-13 Tomaz Pisanski , Egon Schulte , Asia Ivic Weiss

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

组合数学 · 数学 2018-12-07 Latife Genc-Kaya , J. N. Hooker

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…

组合数学 · 数学 2011-08-24 David Bremner , Lars Schewe

In this paper we obtain new upper bounds on volumes of right-angled polyhedra in hyperbolic space $\mathbb{H}^3$ in three different cases: for ideal polyhedra with all vertices on the ideal hyperbolic boundary, for compact polytopes with…

几何拓扑 · 数学 2022-01-06 Stepan Alexandrov , Nikolay Bogachev , Andrei Egorov , Andrei Vesnin

A Delaunay polytope $P$ is said to be {\em extreme} if the only (up to isometries) affine bijective transformations $f$ of $\R^n$, for which $f(P)$ is again a Delaunay polytope, are the homotheties. This notion was introduced in…

度量几何 · 数学 2007-05-23 M. Dutour

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

组合数学 · 数学 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…

组合数学 · 数学 2025-05-01 Aki Mori , Kenta Mori , Hidefumi Ohsugi

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…

度量几何 · 数学 2009-09-29 Julian Pfeifle

The face poset of the permutohedron realizes the combinatorics of linearly ordered partitions of the set $[n]=\{1,...,n\}$. Similarly, the cyclopermutohedron is a virtual polytope that realizes the combinatorics of cyclically ordered…

度量几何 · 数学 2016-02-02 Ilia Nekrasov , Gaiane Panina , Alena Zhukova

Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…

度量几何 · 数学 2015-06-26 Carsten Schütt

A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…

量子物理 · 物理学 2007-05-23 Ingemar Bengtsson , Asa Ericsson

The lists of facets -- $298,592$ in $86$ orbits -- and of extreme rays -- $242,695,427$ in $9,003$ orbits -- of the hypermetric cone $HYP_8$ are computed. The first generalization considered is the hypermetric polytope $HYPP_n$ for which we…

度量几何 · 数学 2015-03-17 Michel Deza , Mathieu Dutour Sikirić

We study arithmetic properties of the growth rates of cofinite 3-dimensional hyperbolic Coxeter groups whose dihedral angles are of the form $\frac{\pi}{m}$ for $m=2,3,4,5,6$ and show that the growth rates are always Perron numbers.

几何拓扑 · 数学 2017-05-02 Tomoshige Yukita

An abstract polytope is \emph{flat} if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat…

组合数学 · 数学 2017-06-06 Gabe Cunningham

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…

几何拓扑 · 数学 2020-10-12 Alexander Kolpakov , Leone Slavich

We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.

组合数学 · 数学 2012-09-07 B. Monson , Egon Schulte