English
Related papers

Related papers: A Note on the Rank 5 Polytopes of M24

200 papers

Previous research established that the maximal rank of the abstract regular polytopes whose automorphism group is a transitive proper subgroup of $\mbox{S}_n$ is $n/2 + 1$. Up to isomorphism and duality, when $n\geq 12$, there are only two…

Combinatorics · Mathematics 2025-10-07 Maria Elisa Fernandes , Claudio Alexandre Piedade

Here, for $W$ the Coxeter group $\mathrm{D}_n$ where $n > 4$, it is proved that the maximal rank of an abstract regular polytope for $W$ is $n - 1$ if $n$ is even and $n$ if $n$ is odd. Further it is shown that $W$ has abstract regular…

Group Theory · Mathematics 2026-02-27 Malcolm Hoong Wai Chen , Peter Rowley

There exists just one regular polytope of rank larger than 3 whose full automorphism group is a projective general linear group PGL_2(q), for some prime-power q. This polytope is the 4-simplex and the corresponding group is PGL_2(5), which…

Combinatorics · Mathematics 2009-09-11 Dimitri Leemans , Egon Schulte

The paper establishes that the rank of a regular polygonal complex in 3-space E^3 cannot exceed 4, and that the only regular polygonal complexes of rank 4 in 3-space are the eight regular 4-apeirotopes.

Metric Geometry · Mathematics 2014-03-04 Egon Schulte

A computer search through the oriented matroid programs with dimension 5 and 10 facets shows that the maximum strictly monotone diameter is 5. Thus $\Delta_{sm}(5,10)=5$. This enumeration is analogous to that of Bremner and Schewe for the…

Combinatorics · Mathematics 2018-07-02 J. Mackenzie Gallagher , Walter D. Morris,

This article announces the completion of the classification of rank 4 locally projective polytopes and their quotients. There are seventeen universal locally projective polytopes (nine nondegenerate). Amongst their 441 quotients are a…

Combinatorics · Mathematics 2007-05-23 Michael I Hartley

Up to isomorphism and duality, there are exactly two non-degenerate abstract regular polytopes of rank greater than $n-3$, one of rank $n-1$ and one of rank $n-2$, with automorphism groups that are transitive permutation groups of degree…

Combinatorics · Mathematics 2015-09-04 Maria Elisa Fernandes , Dimitri Leemans , Mark Mixer

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

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…

Combinatorics · Mathematics 2007-07-30 Barry Monson , Egon Schulte

The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…

Combinatorics · Mathematics 2016-07-26 João Gouveia , Kanstanstin Pashkovich , Richard Z. Robinson , Rekha R. Thomas

The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…

Optimization and Control · Mathematics 2013-08-01 João Gouveia , Richard Z. Robinson , Rekha R. Thomas

We prove that the highest rank of a string C-group constructed from an alternating group $Alt_n$ is 0 if $n=3, 4, 6, 7, 8$; 3 if $n=5$; 4 if $n=9$; 5 if $n=10$; 6 if $n=11$; and $\lfloor\frac{n-1}{2}\rfloor$ if $n\geq 12$. This solves a…

Group Theory · Mathematics 2019-05-31 Peter J. Cameron , Maria Elisa Fernandes , Dimitri Leemans , Mark Mixer

Abstract polytopes are a combinatorial generalization of convex and skeletal polytopes. Counting how many flag orbits a polytope has under its automorphism group is a way of measuring how symmetric it is. Polytopes with one flag orbit are…

Combinatorics · Mathematics 2024-02-20 Elías Mochán

A complete classification of the $\delta$-vectors of lattice polytopes whose normalized volumes are at most $4$ is known. In the present paper, we will classify all the $\delta$-vectors of lattice polytopes with normalized volumes $5$.

Combinatorics · Mathematics 2020-09-08 Akiyoshi Tsuchiya

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity…

Combinatorics · Mathematics 2026-05-13 Narayan Collins , Victoria Schleis

The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…

Group Theory · Mathematics 2025-12-18 Gabriel Cunningham , Yan-Quan Feng , Dong-Dong Hou , Egon Schulte

In this paper we study the rank of polytopes contained in the 0-1 cube with respect to $t$-branch split cuts and $t$-dimensional lattice cuts for a fixed positive integer $t$. These inequalities are the same as split cuts when $t=1$ and…

Optimization and Control · Mathematics 2021-10-18 Sanjeeb Dash , Yatharth Dubey

We show that if the monodromy of a 3-manifold M that fibers over the circle has large translation distance in the curve complex, then the rank of the fundamental group of M is 2g+1, where g is the genus of the fiber.

Geometric Topology · Mathematics 2017-07-25 Ian Biringer , Juan Souto

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava

An abstract polytope of rank n is said to be chiral if its automorphism group has precisely two orbits on the flags, such that adjacent flags belong to distinct orbits. The present paper describes a general method for deriving new finite…

Combinatorics · Mathematics 2010-08-09 Antonio Breda D'Azevedo , Gareth A. Jones , Egon Schulte
‹ Prev 1 2 3 10 Next ›