Answers are grounded in this paper and cite their sources.
It is proved that for every odd n ≥ 1039 there are two words $u(x, y), v(x,y)$ of length ≤ 658n² over the group alphabet ,y\ of the free Burnside group $B(2 ,n),$ which generate a free Burnside subgroup of the group $B(2,n)$. This implies that for any finite subset S of the group $B(m,n)$ the inequality |Sᵗ|>4· 2.9[t/658s²] holds, where s is the smallest odd divisor of n that satisfies the inequality s≥1039.
No takes yet. Share an insight, caveat, or question.
Atabekyan et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: