Double coset decompositions and computational harmonic analysis on groups

DOI10.1007/BF02510144zbMath0960.43006MaRDI QIDQ1581065

David K. Maslen, Daniel N. Rockmore

Publication date: 14 September 2000

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/59648

zbMATH Keywords

Fourier transformirreducible representationsfinite groupspecial linear groupGel'fand-Tsetlin basesCooley-Tukey FFT

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Homomorphisms and multipliers of function spaces on groups, semigroups, etc. (43A22) Homology and cohomology of Lie groups (57T10) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

Separation of variables and the computation of Fourier transforms on finite groups. II ⋮ Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice ⋮ The efficient computation of Fourier transforms on semisimple algebras ⋮ Unnamed Item ⋮ Decomposing monomial representations of solvable groups.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence and efficient construction of fast Fourier transforms on supersolvable groups
• Improved upper complexity bounds for the discrete Fourier transform
• Fast Fourier analysis for abelian group extensions
• Fast generalized Fourier transforms
• A generalization of spectral analysis with application to ranked data
• Efficient computation of Fourier transforms on compact groups
• Algebraic complexity theory. I: An introduction
• Fast Fourier transforms for wreath products
• Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
• Efficient Computation of the Fourier Transform on Finite Groups
• Complex Representations of 𝐺𝐿(2,𝐾) for Finite Fields 𝐾
• Fast Fourier Transforms for Metabelian Groups
• Average running time of the fast Fourier transform
• Is computing with the finite Fourier transform pure or applied mathematics?
• On the algebraic structure of certain partially observable finite-state Markov processes
• Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
• Computing Irreducible Representations of Supersolvable Groups
• Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
• The efficient computation of Fourier transforms on the symmetric group
• Computing Irreducible Representations of Finite Groups
• Fast Fourier Analysis for SL₂over a Finite Field and Related Numerical Experiments
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Inductive Limits of Finite Dimensional C ∗ -Algebras
• Separation of variables and the computation of Fourier transforms on finite groups, I