论文标题
小时生长群
Groups of small period growth
论文作者
论文摘要
我们构建了有限生成的小时生长的组，即单词长度$ n $的最大顺序在$ n $中的最大顺序。这回答了布拉德福德与群体的无法无天增长有关的问题，并与限制性伯恩赛德问题的近似版本有关。
We construct finitely generated groups of small period growth, i.e. groups where the maximum order of an element of word length $n$ grows very slowly in $n$. This answers a question of Bradford related to the lawlessness growth of groups and is connected to an approximative version of the restricted Burnside problem.
