DFT-based word normalization in finite supersolvable groups. (Q1762552)

From MaRDI portal
Revision as of 18:08, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
DFT-based word normalization in finite supersolvable groups.
scientific article

    Statements

    DFT-based word normalization in finite supersolvable groups. (English)
    0 references
    0 references
    0 references
    9 February 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete Fourier transform
    0 references
    word normalization
    0 references
    power-commutator presentations
    0 references
    finite supersolvable groups
    0 references
    normal forms
    0 references
    irreducible representations
    0 references
    algorithms
    0 references
    fast polynomial divisions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references