RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2015 Volume 12, Pages 248–254 (Mi semr583)

This article is cited in 3 papers

Mathematical logic, algebra and number theory

The Cayley graphs of Burnside groups of exponent $3$

A. A. Kuznetsov

Siberian State Aerospace University named after academician M. F. Reshetnev, pr. «Krasnoyarskiy Rabochiy», 31, Krasnoyarsk, 660014, Russia

Abstract: Let $B_k=B(k,3)$ be the $k$-generator Burnside group of exponent $3$. Previously unknown Hall’s polynomials of $B_k$ for $k\leq 4$ are calculated. For $k>4$ polynomials are calculated similarly but their output takes considerably more space. Then using computer calculations for $2\leq k\leq 4$ were obtained diameters and average diameters of the Cayley graphs of $ B_k $ and their some factors generated by the symmetric generating sets. It is shown that these graphs have better characteristics than hypercubes. It can be concluded that the Cayley graphs of $ B_k $ deserve attention in the design of advanced topologies of multiprocessor computer systems.

Keywords: periodic group, collection process, Hall’s polynomials, the Cayley graph, multiprocessor computer system.

UDC: 512.5

MSC: 13A99

Received February 10, 2015, published April 10, 2015

DOI: 10.17377/semi.2015.12.020



© Steklov Math. Inst. of RAS, 2025