Separation of variables and the computation of Fourier transforms on finite groups, I

DOI10.1090/S0894-0347-97-00219-1zbMATH Open0860.20016OpenAlexW3159676034MaRDI QIDQ5690903FDOQ5690903

Authors: David K. Maslen, Daniel N. Rockmore 

Publication date: 9 January 1997

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0894-0347-97-00219-1

Recommendations

• Separation of variables and the computation of Fourier transforms on finite groups. II
• Separation of variables and the computation of Fourier transforms on finite groups. II
• Efficient Computation of the Fourier Transform on Finite Groups
• Efficient computation of Fourier inversion for finite groups

zbMATH Keywords

complexityfinite groupssymmetric groupsfast Fourier transformsChevalley groupsWeyl groupsmatrix productsefficient computationsfactorizations of group elementsseparation of variables algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Ordinary representations and characters (20C15) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (35)

• Computational bounds for doing harmonic analysis on permutation modules of finite groups
• On the singular value decomposition over finite fields and orbits of \(\mathrm{GU} \times \mathrm{GU} \)
• Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture
• Title not available (Why is that?)
• Galois groups of random additive polynomials
• A fast Hermite transform
• Conjugacy class properties of the extension of \(\text{GL}(n,q)\) generated by the inverse transpose involution.
• Fast Fourier analysis for abelian group extensions
• Applications of the generalized Fourier transform in numerical linear algebra
• Fourier transforms with respect to monomial representations
• The efficient computation of Fourier transforms on the symmetric group
• Title not available (Why is that?)
• A Spectral Analysis Approach for Experimental Designs
• Efficient computation of Fourier transforms on compact groups
• Fast Fourier Transforms for Metabelian Groups
• Symmetry-based matrix factorization
• Fast Fourier transforms for the rook monoid.
• FFTs on the rotation group
• A new algorithm for fast generalized DFTs
• Separation of variables and the computation of Fourier transforms on finite groups. II
• Bounds on the largest Kronecker and induced multiplicities of finite groups
• The efficient computation of Fourier transforms on semisimple algebras
• A fast generalized DFT for finite groups of Lie type
• Random walks on the BMW monoid: an algebraic approach
• On discrete groups of Euclidean isometries: representation theory, harmonic analysis and splitting properties
• Fast Fourier transforms for finite inverse semigroups
• Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
• Inverse semigroup spectral analysis for partially ranked data
• Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements.
• Fast Fourier Analysis for SL₂over a Finite Field and Related Numerical Experiments
• Separation of variables and the computation of Fourier transforms on finite groups. II
• Decomposing monomial representations of solvable groups.
• Fast spin \(\pm \)2 spherical harmonics transforms and application in cosmology
• On the number of distinct functional graphs of affine-linear transformations over finite fields
• Double coset decompositions and computational harmonic analysis on groups

This page was built for publication: Separation of variables and the computation of Fourier transforms on finite groups, I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690903)