Existence and efficient construction of fast Fourier transforms on supersolvable groups

DOI10.1007/BF01200062zbMath0778.65092MaRDI QIDQ685713

Ulrich Baum

Publication date: 10 October 1993

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformslinear complexitysupersolvable groupmonomial representations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary representations and characters (20C15) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (12)

Generating fast Fourier transforms of solvable groups ⋮ An algorithm for constructing representations of finite groups. ⋮ Fast Fourier Transforms for Symmetric Groups: Theory and Implementation ⋮ Inverse semigroup spectral analysis for partially ranked data ⋮ Computing Irreducible Representations of Supersolvable Groups ⋮ Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\) ⋮ Fast Fourier transforms for the rook monoid ⋮ The efficient computation of Fourier transforms on semisimple algebras ⋮ Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\) ⋮ Efficient computation of Fourier transforms on compact groups ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Fourier Inversion for Finite Inverse Semigroups

Uses Software

• Unnamed Item

Cites Work

• Improved upper complexity bounds for the discrete Fourier transform
• Fast Fourier analysis for abelian group extensions
• On the computational complexity of the general discrete Fourier transform
• Towards a soluble quotient algorithm
• Fast generalized Fourier transforms
• A generalization of spectral analysis with application to ranked data
• Fast multiplication of large numbers
• Constant depth circuits, Fourier transform, and learnability
• Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
• Harmonic Analysis of Polynomial Threshold Functions
• Fast Fourier Transforms for Metabelian Groups
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Primitive Idempotents in Group Algebras
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Existence and efficient construction of fast Fourier transforms on supersolvable groups