About the length of laws for finite groups
We prove new upper bounds of the form O(n/log(n)2−ε ) for the length of laws that hold for all groups of size at most n — improving on previous results of Bou-Rabee and Kassabov–Matucci. The methods make use of the classification of finite simple groups. Stronger bounds are proved in case the groups are assumed to be nilpotent or solvable.
Unable to display preview. Download preview PDF.
- H. Fitting, Beiträge zur theorie der Gruppen von endlicher ordnung, Jahresbericht DMV.Google Scholar
- R. A. Gimadeev and M. N. Vyalyi, Identical relations in symmetric groups and separating words with reversible automata, in Computer science—theory and applications, Lecture Notes in Comput. Sci., Vol. 6072, Springer, Berlin, 2010, pp. 144–155.Google Scholar
- D. Gorenstein, Finite groups, Harper & Row, New York–London, 1968.Google Scholar
- J. Hall, Marshall, The theory of groups, (1959), xiii+434.Google Scholar