English
Related papers

Related papers: Semiregular Polytopes and Amalgamated C-groups

200 papers

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…

Combinatorics · Mathematics 2011-09-13 Tomaz Pisanski , Egon Schulte , Asia Ivic Weiss

Abstract polytopes generalize the face lattice of convex polytopes. A polytope is semiregular if its facets are regular and its automorphism group acts transitively on its vertices. In this paper we construct semiregular, facet-transitive…

Combinatorics · Mathematics 2025-12-17 Elías Mochán

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

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

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

Combinatorics · Mathematics 2015-05-26 Egon Schulte , Gordon Ian Williams

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…

Combinatorics · Mathematics 2023-04-06 Isabel Hubard , Elías Mochán

This paper introduces the notion of an unravelled abstract regular polytope, and proves that $\SL_3(q) \rtimes <t>$, where $t$ is the transpose inverse automorphism of $\SL_3(q)$, possesses such polytopes for various congruences of $q$. A…

Group Theory · Mathematics 2021-05-06 Robert Nicolaides , Peter Rowley

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

Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…

Combinatorics · Mathematics 2024-05-16 Antonio Montero , Micael Toledo

Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of…

Combinatorics · Mathematics 2017-11-08 Egon Schulte

We consider the problem of constructing an abstract $(n+1)$-polytope $Q$ with $k$ facets isomorphic to a given $n$-polytope $P$, where $k \geq 3$. In particular, we consider the case where we want $Q$ to be $(n-2,n)$-flat, meaning that…

Combinatorics · Mathematics 2020-01-22 Gabe Cunningham

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Metric Geometry · Mathematics 2009-06-08 Daniel Pellicer , Egon Schulte

The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular…

Combinatorics · Mathematics 2013-06-11 Michael Giudici , Primoz Potocnik , Gabriel Verret

An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. Examples of chiral polytopes have been difficult to find. A "mixing" construction…

Combinatorics · Mathematics 2012-01-17 Gabe Cunningham

The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope,…

Combinatorics · Mathematics 2012-01-17 Gabe Cunningham

For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the…

Combinatorics · Mathematics 2017-09-18 Jean-Paul Doignon

Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…

Combinatorics · Mathematics 2016-03-14 Ian Gleason , Isabel Hubard

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

Metric Geometry · Mathematics 2015-11-30 Erik Friese , Frieder Ladisch

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

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
‹ Prev 1 2 3 10 Next ›