Computing Fourier transforms and convolutions of S_n - 1-invariant signals on S_n in time linear in n
From MaRDI portal
Publication:710991
DOI10.1016/J.AML.2009.09.009zbMATH Open1197.65233OpenAlexW2066265552MaRDI QIDQ710991FDOQ710991
Authors: Michael Clausen, Ramakrishna Kakarala 
Publication date: 25 October 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2009.09.009
Recommendations
- 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\)
- A generalized Fourier transform and convolution on time scales
- A General Description of Linear Time-Frequency Transforms and Formulation of a Fast, Invertible Transform That Samples the Continuous S-Transform Spectrum Nonredundantly
- Fourier transform and convolution in the space \(\ell_ 1\)
- On the Fourier-Laplace convolution transforms
- Fast Fourier transforms for finite inverse semigroups
- On the convolutions of Fourier-type transforms
- Fourier transforms of multiplicative convolutions
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
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?)
- A generalization of spectral analysis with application to ranked data
- The efficient computation of Fourier transforms on the symmetric group
- Fast generalized Fourier transforms
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
Cited In (7)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- A General Description of Linear Time-Frequency Transforms and Formulation of a Fast, Invertible Transform That Samples the Continuous S-Transform Spectrum Nonredundantly
- \(\mathbb S_n\)FFT: a Julia toolkit for Fourier analysis of functions over permutations
- Interpreting the phase spectrum in Fourier analysis of partial ranking data
- Efficient computation of Fourier inversion for finite groups
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Title not available (Why is that?)
This page was built for publication: Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710991)
