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·b is to be computed. As an alternative to classical collection strategies we present a new DFT-based strategy, which uses fragments of certain irreducible representations of the underlying group. This strategy allows an explicit running time analysis. For example, in the special case of a pc presented p-group G of order pn one needs at most 5·p·n2 additions in ℤe:=ℤ/eℤ for the computation of the normal form, where e denotes the exponent of G. Interpreting pc presentations as polynomials in multivariate non-commutative polynomial rings we derive an algorithm for fast polynomial division.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
