RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive

Prikl. Diskr. Mat. Suppl., 2021 Issue 14, Pages 184–186 (Mi pdma562)

Computational methods in discrete mathematics

Some subgroups of the Burnside group $B_0(2,5)$

A. A. Kuznetsova, A. S. Kuznetsovab

a M. F. Reshetnev Siberian State University of Science and Technologies
b Krasnoyarsk State Agricultural University

Abstract: Let $ B_0(2,5) = \langle x, y \rangle $ be the largest finite two generator Burnside group of exponent five and order $ 5 ^ {34} $. We study a series of subgroups $ H_i = \langle a_i, b_i \rangle $ of the group $ B_0 (2,5) $, where $ a_0 = x $, $ b_0 = y $, $ a_i = a_ { i-1} b_ {i-1} $ and $ b_i = b_ {i-1} a_ {i-1} $ for $ i \in \mathbb {N} $. It has been found that $H_4$ is a commutative group. Therefore, $H_5$ is a cyclyc group and the series of subgroups is broken. The elements $ a_4 = xy ^ 2xyx ^ 2y ^ 2x ^ 2yxy ^ 2x $ and $ b_4 = yx ^ 2yxy ^ 2x ^ 2y ^ 2xyx ^ 2y $ of length $16$ generate an abelian subgroup of order $25$ in $ B_0 (2,5) $. Using computer calculations, we have found that there is no other pair of group words of length less than $16$ that generate a noncyclic abelian subgroup in $ B_0 (2,5) $.

Keywords: non-commutative cryptography, Burnside group.

UDC: 519.688

DOI: 10.17223/2226308X/14/43



© Steklov Math. Inst. of RAS, 2024