Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
From MaRDI portal
Publication:4274400
DOI10.2307/2153256zbMath0804.20007OpenAlexW4256035145MaRDI QIDQ4274400
Publication date: 12 January 1995
Full work available at URL: https://doi.org/10.2307/2153256
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
A unified FFT-based approach to maximum assignment problems related to transitive finite group actions ⋮ Uncovering the riffled independence structure of ranked data ⋮ Inverse semigroup spectral analysis for partially ranked data ⋮ The efficient computation of Fourier transforms on the symmetric group ⋮ Fast Fourier transforms for the rook monoid ⋮ Fast Fourier transforms for finite inverse semigroups ⋮ Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\) ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis ⋮ Harmonic analysis on \(SL(2,\mathbb{C})\) and projectively adapted pattern representation ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Fourier Inversion for Finite Inverse Semigroups ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- An explicit model for the complex representations of \(S_ n\)
- Fast generalized Fourier transforms
- A generalization of spectral analysis with application to ranked data
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
- Efficient Computation of the Fourier Transform on Finite Groups
- On Computing the Discrete Fourier Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures
This page was built for publication: Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
