English
Related papers

Related papers: Regular polytopes of rank $n/2$ for transitive gro…

200 papers

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

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

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

The maximal rank of an abstract regular polytope for M24, the Mathieu group of degree 24, is 5. There are four such polytopes of rank 5 and in this note we describe them using Curtis's MOG. This description is then used to give an upper…

Group Theory · Mathematics 2022-01-07 Veronica Kelsey , Robert Nicolaides , Peter Rowley

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…

Combinatorics · Mathematics 2012-01-27 B. Monson , Egon Schulte

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

For each $d\geq 3$, $n \geq 10$, and $k_1, k_2, \ldots, k_{d-1}\geq 2$ with $k_1+k_2+\ldots+k_{d-1}\leq n-1$, we construct a regular $d$-polytope whose automorphism group is of order $2^n$ and whose Schl\"afli type is $\{2^{k_1},2^{k_2},…

Group Theory · Mathematics 2019-01-23 Dong-Dong Hou , Yanquan Feng , Dimitri Leemans

In this paper, we classify regular polytopes with automorphism groups of order $2^n$ and Schl\"afli types $\{4, 2^{n-3}\}, \{4, 2^{n-4}\}$ and $\{4, 2^{n-5}\}$ for $n \geq 10$, therefore giving a partial answer to a problem proposed by…

Combinatorics · Mathematics 2019-01-23 Dong-Dong Hou , Yan-Quan Feng , Dimitri Leemans

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

Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…

Combinatorics · Mathematics 2026-04-02 Isabel Hubard , Egon Schulte

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

A maniplex of rank $n$ is a combinatorial object that generalises the notion of a rank $n$ abstract polytope. A maniplex with the highest possible degree of symmetry is called reflexible. In this paper we prove that there is a rank $4$…

Combinatorics · Mathematics 2022-08-23 Dimitri Leemans , Micael Toledo

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

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

For each integer \( n \geq 3 \), we construct a self-dual regular 3-polytope \( \mathcal{P} \) of type \( \{n, n\} \) with \( 2^n n \) flags, resolving two foundamental open questions on the existence of regular polytopes with certain…

Combinatorics · Mathematics 2025-05-15 Mingchao Li , Wei-Juan Zhang

Here we study the typical rank for real bivariate homogeneous polynomials of degree $d\ge 6$ (the case $d\le 5$ being settled by P. Comon and G. Ottaviani). We prove that $d-1$ is a typical rank and that if $d$ is odd, then $(d+3)/2$ is a…

Algebraic Geometry · Mathematics 2012-04-17 Edoardo Ballico

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

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

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos

A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…

Combinatorics · Mathematics 2026-02-04 Isabel Hubard , Micael Toledo
‹ Prev 1 2 3 10 Next ›