Decomposing monomial representations of solvable groups.

DOI10.1006/jsco.2002.0566zbMath1033.20012OpenAlexW2017928198MaRDI QIDQ1867001

Markus Püschel

Publication date: 2 April 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2002.0566

zbMATH Keywords

algorithmsfast Fourier transformirreducible representationssolvable groupsdecomposition matricesmonomial representations

Mathematics Subject Classification ID

Related Items (4)

Minimally disturbing Heisenberg–Weyl symmetric measurements using hard-core collisions of Schrödinger particles ⋮ Symmetry-based matrix factorization ⋮ Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice ⋮ AREP

Uses Software

• GAP
• SPIRAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating fast Fourier transforms of solvable groups
• Fast Fourier analysis for abelian group extensions
• Abelian semi-simple algebras and algorithms for the discrete Fourier transform
• Gauss and the history of the fast Fourier transform
• Fourier transforms with respect to monomial representations
• A direct proof of Minkwitz's extension theorem
• Double coset decompositions and computational harmonic analysis on groups
• Extensions of irreducible representations
• Efficient Computation of the Fourier Transform on Finite Groups
• Computing Irreducible Representations of Supersolvable Groups
• Algorithms explained by symmetries
• Automatic derivation and implementation of signal processing algorithms
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Automatic generation of fast discrete signal transforms
• Separation of variables and the computation of Fourier transforms on finite groups, I

This page was built for publication: Decomposing monomial representations of solvable groups.