Searcharxiv⌕ Search

arXiv · 2610.09711

Hypertopes with prescribed diagram symmetries

Abstract

Let $\mathcal{G}$ be a finite connected simple graph with at least two vertices. We construct a finite regular hypertope $Γ$ whose diagram is the graph $\mathcal{G}$ with every edge labelled by $4$, and for which $Cor(Γ)/Aut(Γ) \cong Aut(\mathcal{G})$. This shows that any possible group of diagram symmetries can be realized by the correlations of a hypertope. The construction uses a group generated by involutions, with nilpotency class two, exponent four and commutator relations dictated by the defining graph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dimitri Leemans, Pablo Spiga, Philippe Tranchida. 2026-10-07. Hypertopes with prescribed diagram symmetries. https://arxiv.org/abs/2610.09711

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

KEEP EXPLORING

Related papers

On strongly reversible elements in the Riordan group

An element of a group is called \emph{reversible} if it is conjugate to its inverse, and \emph{strongly reversible} if it can be expressed as a product of two involutions. We study strongly reversible elements in the Riordan group and its various important subgroups. We prove that not every reversible element in the Riordan group is strongly reversible, and we investigate products of reversible elements in the Riordan group.

math.GR↗

Finite groups whose proper subgroups of order divisible by $p$ are supersolvable

Let $p$ be an odd prime, and let $G$ be a finite group whose order is divisible by $p$. Suppose that every proper subgroup of $G$ whose order is divisible by $p$ is supersolvable, while $G$ itself is not. In this paper, we investigate the arithmetic and structural properties of such groups, addressing both the solvable and nonsolvable cases.

math.GR↗

Small growth rates of free groups

We introduce the notion of a Magnus marking for a finite generating set of a group and prove a certain expansion property. Using this property, we determine the second and third smallest growth rates of the rank-$d$ free group for $d\ge 2$. We also give a new lower bound for the smallest growth rate of the genus-$g$ surface group for $g\ge 2$, as well as a lower bound for the growth rate associated with a one-relator presentation.

math.GR↗