SearcharxivSearch

arXiv · 1801.08456

Determining sets and determining numbers of finite groups

Abstract

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest determining set. A generating set of $G$ is a subset such that every element of $G$ can be expressed as the combination, under the group operation, of finitely many elements of the subset and their inverses. The cardinality of a smallest generating set of $G$, denoted by $\gamma(G)$, is called the generating number of $G$. A group $G$ is called a DEG-group if $\alpha(G)=\gamma(G)$. The main results of this article are as follows. Finite groups with determining number $0$ or $1$ are classified; Finite simple groups and finite nilpotent groups are proved to be DEG-groups; A finite group is a normal subgroup of a DEG-group and there is an injective mapping from the set all finite groups to the set of finite DEG-groups; Nilpotent groups of order $n$ which have the maximum determining number are classified; For any integer $k\geq 2$, there exists a group $G$ such that $\alpha(G)=2$ and $\gamma(G)\geq k$.

Explore related subjects

Keep this discovery

BibTeXRIS

Dengyin Wang, Shikun Ou, Haipeng Qu. 2018-01-23. Determining sets and determining numbers of finite groups. https://arxiv.org/abs/1801.08456

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