Search arXivSearch

arXiv · 2506.04406

Semiregular abstract polyhedra with trivial facet stabilizer

Abstract

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 polyhedra with trivial facet stabilizer, showing that semiregular abstract polyhedra can have an unbounded number of flag orbits, while having as little as one facet orbit. We interpret this construction in terms of operations applied to high rank regular and chiral polytopes, and we see how this same operations help us construct alternating semiregular polyhedra (that is, with two facet orbits and adjacent facets in different orbits). Finally, we give an idea to generalize this construction giving examples in higher ranks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elías Mochán. 2025-12-16. Semiregular abstract polyhedra with trivial facet stabilizer. https://arxiv.org/abs/2506.04406

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO