Strongly generating elements in finite and profinite groups
Eloisa Detomi, Andrea Lucchini

TL;DR
This paper investigates the maximum possible difference between the expected number of elements needed to generate a finite group and the expected number needed when including a specific element, exploring the generative properties of finite and profinite groups.
Contribution
It provides bounds and insights into how much adding a fixed element can reduce the expected number of generators in finite groups.
Findings
The difference $e(G)-e(G,g)$ can be arbitrarily large for certain groups.
Bounds are established for the maximum difference in various classes of groups.
The results deepen understanding of generative properties in finite and profinite groups.
Abstract
Given a finite group and an element , we may compare the expected number of elements needed to generate and the expected number of elements of needed to generate together with We address the following question: how large can the difference be?
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
