DFT-based word normalization in finite supersolvable groups.

DOI10.1007/S00200-004-0157-5MaRDI QIDQ1762552zbMATH OpenOpenAlexFDO

Authors Meinard Müller, Michael Clausen

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

algorithmsdiscrete Fourier transformfast polynomial divisionsfinite supersolvable groupsirreducible representationsnormal formspower-commutator presentationsword normalization

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05) Numerical methods for discrete and fast Fourier transforms (65T50) Symbolic computation and algebraic computation (68W30)

Recommendations

• Collection from the left
• Collection from the left and other strategies
• Generating fast Fourier transforms of solvable groups
• scientific article; zbMATH DE number 1263405
• scientific article; zbMATH DE number 1256646

Cites work

• Collection from the left
• Collection from the left and other strategies
• Computing Irreducible Representations of Supersolvable Groups
• scientific article; zbMATH DE number 3526920 (Why is no real title available?)
• scientific article; zbMATH DE number 1254287 (Why is no real title available?)
• scientific article; zbMATH DE number 1262444 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 610966 (Why is no real title available?)
• scientific article; zbMATH DE number 1504649 (Why is no real title available?)

Describes a project that uses

Uses Software

• GAP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762552)