SearcharxivSearch

arXiv · 2406.13318

IBIS primitive groups of almost simple type

Abstract

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence $(\omega_1\ldots,\omega_\ell)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of its predecessors. The minimal cardinality of a base is said to be the base size of $G$. If all irredundant bases of $G$ have the same cardinality, $G$ is said to be an IBIS group. In this paper, we classify the finite almost simple primitive IBIS groups whose base size is at least $6$.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabio Mastrogiacomo, Pablo Spiga. 2024-06-19. IBIS primitive groups of almost simple type. https://arxiv.org/abs/2406.13318

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