AN ALGORITHM FOR COMPUTATION OF THE GROWTH FUNCTIONS IN FINITE TWO-GENERATED GROUPS OF EXPONENT 5

DOI10.17223/20710410/33/10zbMath1490.20027OpenAlexW2738166395MaRDI QIDQ5150752

A. A. Kuznetsov

Publication date: 15 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm554

zbMATH Keywords

growth functionBurnside group

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Periodic groups; locally finite groups (20F50) Generators, relations, and presentations of groups (20F05) Asymptotic properties of groups (20F69) Computational methods for problems pertaining to group theory (20-08)

Related Items (2)

A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5 ⋮ On Applications of the Cayley Graphs of some Finite Groups of Exponent Five

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Cayley graphs of Burnside groups of exponent 3.
• The minimum-length generator sequence problem is NP-hard
• The two generator restricted Burnside group of exponent five

This page was built for publication: AN ALGORITHM FOR COMPUTATION OF THE GROWTH FUNCTIONS IN FINITE TWO-GENERATED GROUPS OF EXPONENT 5