The efficient computation of Fourier transforms on the symmetric group
From MaRDI portal
Publication:4396453
DOI10.1090/S0025-5718-98-00964-8zbMATH Open0902.20005MaRDI QIDQ4396453FDOQ4396453
Authors: David K. Maslen 
Publication date: 14 June 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Recommendations
homogeneous spacesfast Fourier transformYoung tableauxrepresentations of symmetric groupsClausen's algorithm
Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of spectral analysis with application to ranked data
- Differential Posets
- Title not available (Why is that?)
- Efficient Computation of the Fourier Transform on Finite Groups
- Efficient computation of Fourier transforms on compact groups
- Fast generalized Fourier transforms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Separation of variables and the computation of Fourier transforms on finite groups, I
- Fourier transforms with respect to monomial representations
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- Title not available (Why is that?)
Cited In (31)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- Computational bounds for doing harmonic analysis on permutation modules of finite groups
- Fast summation of functions on the rotation group
- Title not available (Why is that?)
- Applications of the generalized Fourier transform in numerical linear algebra
- Fourier transforms with respect to monomial representations
- Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence
- Title not available (Why is that?)
- Uncovering the riffled independence structure of ranked data
- Efficient Computation of the Fourier Transform on Finite Groups
- Fast Fourier transforms for the rook monoid.
- Interpreting the phase spectrum in Fourier analysis of partial ranking data
- Efficient computation of Fourier inversion for finite groups
- Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\)
- Fast zeta transforms for lattices with few irreducibles
- A fast Fourier transform for the Johnson graph
- Separation of variables and the computation of Fourier transforms on finite groups. II
- The efficient computation of Fourier transforms on semisimple algebras
- Fourier inversion for finite inverse semigroups
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- Fast Fourier transforms for finite inverse semigroups
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Title not available (Why is that?)
- Inverse semigroup spectral analysis for partially ranked data
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Double coset decompositions and computational harmonic analysis on groups
- Fourier analysis of subgroup conjugacy invariant functions on finite groups
This page was built for publication: The efficient computation of Fourier transforms on the symmetric group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4396453)
