Pages that link to "Item:Q4396453"

The following pages link to The efficient computation of Fourier transforms on the symmetric group (Q4396453):

Displaying 19 items.

• Interpreting the phase spectrum in Fourier analysis of partial ranking data (Q447548) (← links)
• Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\) (Q710991) (← links)
• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
• Fast Fourier transforms for finite inverse semigroups (Q986071) (← links)
• Double coset decompositions and computational harmonic analysis on groups (Q1581065) (← links)
• Separation of variables and the computation of Fourier transforms on finite groups. II (Q1704873) (← links)
• The efficient computation of Fourier transforms on semisimple algebras (Q1783700) (← links)
• Uncovering the riffled independence structure of ranked data (Q1950813) (← links)
• Computational bounds for doing harmonic analysis on permutation modules of finite groups (Q1982599) (← links)
• Signal processing on the permutahedron: tight spectral frames for ranked data analysis (Q2048691) (← links)
• A fast Fourier transform for the Johnson graph (Q2154368) (← links)
• Inverse semigroup spectral analysis for partially ranked data (Q2252126) (← links)
• Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\) (Q2284962) (← links)
• Applications of the generalized Fourier transform in numerical linear algebra (Q2490360) (← links)
• (Q5111012) (← links)
• Fast Fourier transforms for the rook monoid (Q5189159) (← links)
• Fourier Inversion for Finite Inverse Semigroups (Q5251539) (← links)
• (Q5743488) (← links)
• Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence (Q6599593) (← links)