Computing Fourier transforms and convolutions of S_n - 1-invariant signals on S_n in time linear in n

DOI10.1016/J.AML.2009.09.009MaRDI QIDQ710991zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

FFTdiscrete Fourier transformsymmetric grouphomogeneous spacefast convolution

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

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

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 3552764 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• A generalization of spectral analysis with application to ranked data
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Existence and efficient construction of fast Fourier transforms on supersolvable groups
• Fast generalized Fourier transforms
• Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
• The efficient computation of Fourier transforms on the symmetric group

Cited in

(7)

• Efficient computation of Fourier inversion for finite groups
• scientific article; zbMATH DE number 475357 (Why is no real title available?)
• 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
• Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
• Interpreting the phase spectrum in Fourier analysis of partial ranking data

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)