Nilpotent groups are round.

DOI10.1007/S11856-008-1040-ZMaRDI QIDQ1001400zbMATH OpenOpenAlexFDO

Authors Daniel Berend, Michael Boshernitzan

Publication date 17 February 2009

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0911.2048

zbMATH Keywords

cyclesfinite groupsnilpotent groupsround groups

Mathematics Subject Classification ID

Finite nilpotent groups, (p)-groups (20D15) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

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.

Review text

A (combinatorial) notion of ``roundness -- which is too technical to be reproduced here -- is defined for finite groups and it is shown that the nilpotency of the group is equivalent to several ``roundness conditions.

Recommendations

• scientific article; zbMATH DE number 3880922
• On circle groups of nilpotent rings of characteristic \(2\)
• Roundness properties of groups.
• Orders of elements and characterization of finite nilpotent groups.
• Random nilpotent groups. I

Cites work

• 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
• scientific article; zbMATH DE number 854560 (Why is no real title available?)
• scientific article; zbMATH DE number 2202736 (Why is no real title available?)
• On a linear diophantine problem of Frobenius
• On Recursions Connected With Symmetric Groups I
• 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

Cited in

(2)

• On random permutations of finite groups
• Nilpotent schemes and group-like schemes

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)