DFT-based Word Normalization in Finite Supersolvable Groups

Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of the product a

• Type: Journal
• Year: 2004
• Where: AAECC
• Authors: Meinard Müller, Michael Clausen
• Keywords: AAECC 2004, Algorithms, Certain Irreducible Representations, Normal Form, Word Normalization Problem