Determining sets and determining numbers of finite groups
Dengyin Wang, Shikun Ou, Haipeng Qu

TL;DR
This paper investigates the properties of determining sets and numbers in finite groups, classifies groups with minimal determining numbers, and explores the relationship between determining and generating numbers, introducing DEG-groups.
Contribution
It classifies finite groups with small determining numbers, proves that finite simple and nilpotent groups are DEG-groups, and constructs groups with specific relationships between determining and generating numbers.
Findings
Finite groups with determining number 0 or 1 are classified.
Finite simple and nilpotent groups are DEG-groups.
Existence of groups with prescribed relationships between lpha(G) and gamma(G).
Abstract
Let be a group. A subset of is a determining set of , if every automorphism of is uniquely determined by its action on . The determining number of , denoted by , is the cardinality of a smallest determining set. A generating set of is a subset such that every element of 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 , denoted by , is called the generating number of . A group is called a DEG-group if . The main results of this article are as follows. Finite groups with determining number or 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Graph theory and applications
