A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5

DOI10.17223/20710410/42/7OpenAlexW2921272778WikidataQ128231203 ScholiaQ128231203MaRDI QIDQ5151247

A. S. Kuznetsova, A. A. Kuznetsov

Publication date: 17 February 2021

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

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

zbMATH Keywords

Cayley graphgrowth functionBurnside group

Mathematics Subject Classification ID

Computer science (68-XX) Group theory and generalizations (20-XX)

Uses Software

• Stony Brook

Cites Work

• The minimum-length generator sequence problem is NP-hard
• The two generator restricted Burnside group of exponent five
• AN ALGORITHM FOR COMPUTATION OF THE GROWTH FUNCTIONS IN FINITE TWO-GENERATED GROUPS OF EXPONENT 5
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5