Efficient computation of Fourier inversion for finite groups
From MaRDI portal
Recommendations
- Efficient Computation of the Fourier Transform on Finite Groups
- Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\)
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- scientific article; zbMATH DE number 475354
- The efficient computation of Fourier transforms on the symmetric group
Cited in
(14)- Fourier analysis of subgroup conjugacy invariant functions on finite groups
- Towards a theory of group convolution
- Fast Fourier analysis for abelian group extensions
- S_nFFT: a Julia toolkit for Fourier analysis of functions over permutations
- Fourier transforms with respect to monomial representations
- Fourier method for solving two-sided convolution equations on finite noncommutative groups
- Efficient Computation of the Fourier Transform on Finite Groups
- Fast Fourier transforms for the rook monoid.
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Fourier inversion for finite inverse semigroups
- Fast Fourier transforms for finite inverse semigroups
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
- Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
- Separation of variables and the computation of Fourier transforms on finite groups. II
This page was built for publication: Efficient computation of Fourier inversion for finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4299295)