Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 475354
- Efficient Computation of the Fourier Transform on Finite Groups
- The efficient computation of Fourier transforms on the symmetric group
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- scientific article; zbMATH DE number 4112856
Cites work
- A generalization of spectral analysis with application to ranked data
- An Algorithm for the Machine Calculation of Complex Fourier Series
- An explicit model for the complex representations of \(S_ n\)
- Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures
- Efficient Computation of the Fourier Transform on Finite Groups
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Fast generalized Fourier transforms
- scientific article; zbMATH DE number 3771876 (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 4112856 (Why is no real title available?)
- On Computing the Discrete Fourier Transform
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
Cited in
(25)- Harmonic analysis on \(SL(2,\mathbb{C})\) and projectively adapted pattern representation
- Double coset decompositions and computational harmonic analysis on groups
- Fast Fourier transforms for wreath products
- Uncovering the riffled independence structure of ranked data
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- A fast Fourier transform for the Johnson graph
- Inverse semigroup spectral analysis for partially ranked data
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- S_nFFT: a Julia toolkit for Fourier analysis of functions over permutations
- Efficient Computation of the Fourier Transform on Finite Groups
- scientific article; zbMATH DE number 475354 (Why is no real title available?)
- scientific article; zbMATH DE number 475357 (Why is no real title available?)
- Efficient computation of Fourier inversion for finite groups
- The efficient computation of Fourier transforms on the symmetric group
- scientific article; zbMATH DE number 1504649 (Why is no real title available?)
- scientific article; zbMATH DE number 4112856 (Why is no real title available?)
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Fast Fourier transforms for the rook monoid.
- Fourier inversion for finite inverse semigroups
- Generating symmetric DFTs and equivariant FFT algorithms
- Fast zeta transforms for lattices with few irreducibles
- Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- Fast group-theoretical transform
- Fast Fourier transforms for finite inverse semigroups
This page was built for publication: Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274400)
