DFT-based word normalization in finite supersolvable groups.

DOI10.1007/s00200-004-0157-5zbMath1067.20021OpenAlexW2166951980MaRDI QIDQ1762552

Michael Clausen, Meinard Müller

Publication date: 9 February 2005

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-004-0157-5

zbMATH Keywords

algorithmsnormal formsdiscrete Fourier transformirreducible representationsfinite supersolvable groupspower-commutator presentationsfast polynomial divisionsword normalization

Mathematics Subject Classification ID

Uses Software

• GAP

Cites Work

• Collection from the left and other strategies
• Collection from the left
• Computing Irreducible Representations of Supersolvable Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DFT-based word normalization in finite supersolvable groups.