SearcharxivSearch

arXiv · 2311.04489

On the cardinality of irredundant and minimal bases of finite permutation groups

Abstract

Given a finite permutation group $G$ with domain $\Omega$, we associate two subsets of natural numbers to $G$, namely $\mathcal{I}(G,\Omega)$ and $\mathcal{M}(G,\Omega)$, which are the sets of cardinalities of all the irredundant and minimal bases of $G$, respectively. We prove that $\mathcal{I}(G)$ is an interval of natural numbers, whereas $\mathcal{M}(G,\Omega)$ may not necessarily form an interval. Moreover, for a given subset of natural numbers $X \subseteq \mathbb{N}$, we provide some conditions on $X$ that ensure the existence of both intransitive and transitive groups $G$ such that $\mathcal{I}(G,\Omega) = X$ and $\mathcal{M}(G,\Omega) = X$.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesca Dalla Volta, Fabio Mastrogiacomo, Pablo Spiga. 2023-11-08. On the cardinality of irredundant and minimal bases of finite permutation groups. https://arxiv.org/abs/2311.04489

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