Nilpotent groups are round.
From MaRDI portal
Abstract: We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of the group. Our main result is that this combinatorial property is equivalent to nilpotence.
Recommendations
Cites work
- scientific article; zbMATH DE number 854560 (Why is no real title available?)
- scientific article; zbMATH DE number 2202736 (Why is no real title available?)
- A conjecture of Frobenius and the simple groups of Lie type. IV
- Bounds for a Linear Diophantine Problem of Frobenius, II
- Classical groups, probabilistic methods, and the (2,3)-generation problem
- Finite Simple Groups
- On Recursions Connected With Symmetric Groups I
- On a linear diophantine problem of Frobenius
- On the linear diophantine problem of Frobenius.
- Permutations in Abelian groups and the sequence \(n!\pmod p\).
- Refined upper bounds for the linear Diophantine problem of Frobenius
- Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
- The Number of Elements of Given Period in Finite Symmetric Groups
This page was built for publication: Nilpotent groups are round.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001400)