The efficient computation of Fourier transforms on the symmetric group
From MaRDI portal
Publication:4396453
DOI10.1090/S0025-5718-98-00964-8zbMath0902.20005MaRDI QIDQ4396453
Publication date: 14 June 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
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)
Related Items (18)
A unified FFT-based approach to maximum assignment problems related to transitive finite group actions ⋮ A fast Fourier transform for the Johnson graph ⋮ Separation of variables and the computation of Fourier transforms on finite groups. II ⋮ Uncovering the riffled independence structure of ranked data ⋮ Interpreting the phase spectrum in Fourier analysis of partial ranking data ⋮ Computational bounds for doing harmonic analysis on permutation modules of finite groups ⋮ Inverse semigroup spectral analysis for partially ranked data ⋮ Applications of the generalized Fourier transform in numerical linear algebra ⋮ 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 ⋮ Fast Fourier transforms for finite inverse semigroups ⋮ 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\) ⋮ Unnamed Item ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Fourier Inversion for Finite Inverse Semigroups ⋮ Unnamed Item
Cites Work
- Fast generalized Fourier transforms
- A generalization of spectral analysis with application to ranked data
- Efficient computation of Fourier transforms on compact groups
- Fourier transforms with respect to monomial representations
- Efficient Computation of the Fourier Transform on Finite Groups
- Differential Posets
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Separation of variables and the computation of Fourier transforms on finite groups, I
- 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: The efficient computation of Fourier transforms on the symmetric group
