Existence and efficient construction of fast Fourier transforms on supersolvable groups
From MaRDI portal
Recommendations
Cites work
- A generalization of spectral analysis with application to ranked data
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures
- Constant depth circuits, Fourier transform, and learnability
- Fast Fourier analysis for abelian group extensions
- Fast Fourier Transforms for Metabelian Groups
- Fast generalized Fourier transforms
- Fast multiplication of large numbers
- Harmonic Analysis of Polynomial Threshold Functions
- scientific article; zbMATH DE number 4014644 (Why is no real title available?)
- scientific article; zbMATH DE number 3884354 (Why is no real title available?)
- scientific article; zbMATH DE number 3889792 (Why is no real title available?)
- scientific article; zbMATH DE number 3850987 (Why is no real title available?)
- scientific article; zbMATH DE number 3852384 (Why is no real title available?)
- scientific article; zbMATH DE number 3823081 (Why is no real title available?)
- scientific article; zbMATH DE number 4023201 (Why is no real title available?)
- scientific article; zbMATH DE number 3712179 (Why is no real title available?)
- scientific article; zbMATH DE number 3732172 (Why is no real title available?)
- scientific article; zbMATH DE number 3749242 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- Improved upper complexity bounds for the discrete Fourier transform
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- On the computational complexity of the general discrete Fourier transform
- Primitive Idempotents in Group Algebras
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
- Towards a soluble quotient algorithm
Cited in
(16)- On the computational complexity of the general discrete Fourier transform
- Efficient computation of Fourier transforms on compact groups
- Double coset decompositions and computational harmonic analysis on groups
- The efficient computation of Fourier transforms on semisimple algebras
- Decomposing monomial representations of solvable groups.
- Inverse semigroup spectral analysis for partially ranked data
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- An algorithm for constructing representations of finite groups.
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- Computing Irreducible Representations of Supersolvable Groups
- scientific article; zbMATH DE number 1504649 (Why is no real title available?)
- Fast Fourier transforms for the rook monoid.
- Fourier inversion for finite inverse semigroups
- Generating fast Fourier transforms of solvable groups
- Fast generalized DFTs for all finite groups
- Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\)
This page was built for publication: Existence and efficient construction of fast Fourier transforms on supersolvable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685713)
