Groups of arbitrary lawlessness growth
arXiv:2503.23582
Abstract
For a finitely generated lawless group and , let be the minimal positive integer such that for all nontrivial reduced words of length at most in the free group of fixed rank , there exists of word-length at most with . For any unbounded nondecreasing function satisfying some mild assumptions, we construct such that the function is equivalent to . Our result generalizes both a Theorem of the first named author, who constructed groups for which is unbounded but grows more slowly than any prescribed function , and a result of Petschick, who constructed lawless groups for which grows faster than any tower of exponential functions.
13 pages; improved formatting