-groups, diagonalizable automorphisms and loops
In his proof of Szemerédi’s Theorem, Gowers introduced certain norms that are defined on a parallelepiped structure. A natural question is on which sets a parallelepiped structure (and thus a Gowers norm) can be defined. We focus on dimensions and and show when this possible, and describe a correspondence between the parallelepiped structures and nilpotent groups.
Let be a group and be an integer greater than or equal to . is said to be -permutable if every product of elements can be reordered at least in one way. We prove that, if has a centre of finite index , then is -permutable. More bounds are given on the least such that is -permutable.
All finite simple groups of Lie type of rank over a field of size , with the possible exception of the Ree groups , have presentations with at most 49 relations and bit-length . Moreover, and have presentations with 3 generators; 7 relations and bit-length , while has a presentation with 6 generators, 25 relations and bit-length .
We show that in a finite group which is -nilpotent for at most one prime dividing its order, there exists an element whose conjugacy class length is divisible by more than half of the primes dividing .