Double coset decompositions and computational harmonic analysis on groups
DOI10.1007/BF02510144zbMATH Open0960.43006MaRDI QIDQ1581065FDOQ1581065
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
Recommendations
- Publication:4886055
- The efficient computation of Fourier transforms on the symmetric group
- Efficient computation of Fourier transforms on compact groups
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Separation of variables and the computation of Fourier transforms on finite groups, I
Fourier transformfinite groupirreducible representationsspecial linear groupGel'fand-Tsetlin basesCooley-Tukey FFT
Ordinary representations and characters (20C15) Homomorphisms and multipliers of function spaces on groups, semigroups, etc. (43A22) Numerical methods for discrete and fast Fourier transforms (65T50) Homology and cohomology of Lie groups (57T10)
Cites Work
- Title not available (Why is that?)
- 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?)
- Title not available (Why is that?)
- Inductive Limits of Finite Dimensional C ∗ -Algebras
- Title not available (Why is that?)
- A generalization of spectral analysis with application to ranked data
- Complex Representations of 𝐺𝐿(2,𝐾) for Finite Fields 𝐾
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- Is computing with the finite Fourier transform pure or applied mathematics?
- The efficient computation of Fourier transforms on the symmetric group
- Computing Irreducible Representations of Finite Groups
- Title not available (Why is that?)
- Fast Fourier Transforms for Metabelian Groups
- Efficient Computation of the Fourier Transform on Finite Groups
- Efficient computation of Fourier transforms on compact groups
- Title not available (Why is that?)
- Fast generalized Fourier transforms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Irreducible Representations of Supersolvable Groups
- Separation of variables and the computation of Fourier transforms on finite groups, I
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Fast Fourier transforms for wreath products
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
- Improved upper complexity bounds for the discrete Fourier transform
- Fast Fourier analysis for abelian group extensions
- Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- Average running time of the fast Fourier transform
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic complexity theory. I: An introduction
- On the algebraic structure of certain partially observable finite-state Markov processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing double cosets in soluble groups
- The efficient computation of Fourier transforms on semisimple algebras
- Group decomposition by double coset matrices
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Decomposing monomial representations of solvable groups.
This page was built for publication: Double coset decompositions and computational harmonic analysis on groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1581065)