SearcharxivSearch

arXiv · 2311.16690

On pyramidal groups whose number of involutions is a prime power

Abstract

A Kirkman Triple System $\Gamma$ is called $m$-pyramidal if there exists a subgroup $G$ of the automorphism group of $\Gamma$ that fixes $m$ points and acts regularly on the other points. Such group $G$ admits a unique conjugacy class $C$ of involutions (elements of order $2$) and $|C|=m$. We call groups with this property $m$-pyramidal. We prove that, if $m$ is an odd prime power $p^k$, with $p \neq 7$, then every $m$-pyramidal group is solvable if and only if either $m=9$ or $k$ is odd. The primitive permutation groups play an important role in the proof. We also determine the orders of the $m$-pyramidal groups when $m$ is a prime number.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaofang Gao, Martino Garonzi. 2023-11-28. On pyramidal groups whose number of involutions is a prime power. https://arxiv.org/abs/2311.16690

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR