HomeIssuesFast multiplication in finite two-generated groups of exponent five

Fast multiplication in finite two-generated groups of exponent five | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 1(19).

An algorithm for fast multiplication of elements in finite two-generated groups of exponent five based on Hall's polynomials is described.
Download file
Counter downloads: 70
  • Title Fast multiplication in finite two-generated groups of exponent five
  • Headline Fast multiplication in finite two-generated groups of exponent five
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 1(19)
  • Date:
  • DOI
Keywords
периодическая группа, собирательный процесс, полиномы Холла, periodical groups, gathering process, Hall's polynomials
Authors
References
Havas G., Wall G., and Wamsley J. The two generator restricted Burnside group of exponent five // Bull. Austral. Math. Soc. 1974. No. 10. P. 459-470.
Sims C. Computation with Finitely Presented Groups. Cambridge: Cambridge University Press, 1994. 628 p.
Holt D., Eick B., and O'Brien E. Handbook of computational group theory. Boca Raton: Chapman & Hall/CRC Press, 2005. 514 p.
Hall P. Nilpotent groups: Notes of lectures given at the Canadian Mathematical Congress summer seminar, University of Alberta, 12-30 August, 1957. London: Queen Mary College, 1969.
Sims C. Fast multiplication and growth in groups // Proc. Intern. Symp. Symbolic and Algebraic Computation. New York, NY, USA, 1998. P. 165-170.
Fast multiplication in finite two-generated groups of exponent five | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 1(19).
Fast multiplication in finite two-generated groups of exponent five | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 1(19).
Download full-text version
Counter downloads: 231
Download file