The efficient computation of Fourier transforms on semisimple algebras

DOI10.1007/s00041-017-9555-5OpenAlexW2962726951MaRDI QIDQ1783700

Daniel N. Rockmore, Sarah Wolff, David K. Maslen

Publication date: 21 September 2018

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

Full work available at URL: https://arxiv.org/abs/1609.02634

zbMATH Keywords

fast Fourier transformpath algebraquiverBratteli diagram

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Numerical methods for discrete and fast Fourier transforms (65T50) Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups, etc. (43A30) Combinatorial aspects of commutative algebra (05E40)

Related Items (6)

A fast Fourier transform for the Johnson graph ⋮ On discrete groups of Euclidean isometries: representation theory, harmonic analysis and splitting properties ⋮ Alternating submodules for partition algebras, rook algebras, and rook-Brauer algebras ⋮ Random walks on the BMW monoid: an algebraic approach ⋮ Subquadratic-time algorithms for normal bases ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A ribbon Hopf algebra approach to the irreducible representations of centralizer algebras: The Brauer, Birman-Wenzl, and type A Iwahori-Hecke algebras
• Existence and efficient construction of fast Fourier transforms on supersolvable groups
• Improved upper complexity bounds for the discrete Fourier transform
• The rook partition algebra
• Fast Fourier analysis for abelian group extensions
• Fast Fourier transforms for finite inverse semigroups
• On the computational complexity of the general discrete Fourier transform
• On the structure of Brauer's centralizer algebras
• The Kauffman polynomial of links and representation theory
• Fast generalized Fourier transforms
• A generalization of spectral analysis with application to ranked data
• Tensor product representations for orthosymplectic Lie superalgebras
• The Temperley-Lieb algebra at roots of unity
• Double coset decompositions and computational harmonic analysis on groups
• Separation of variables and the computation of Fourier transforms on finite groups. II
• Characters of algebras containing a Jones basic construction: The Temperley-Lieb, Okada, Brauer, and Birman-Wenzl algebras
• Random walks on the BMW monoid: an algebraic approach
• Inverse semigroup spectral analysis for partially ranked data
• Standard modules, induction and the structure of the Temperley-Lieb algebra
• The planar rook algebra and Pascal's triangle.
• A criterion on the semisimple Brauer algebras.
• Some Applications of the Fourier Transform in Algebraic Coding Theory
• Efficient Computation of the Fourier Transform on Finite Groups
• Average running time of the fast Fourier transform
• Seminormal Representations of Weyl Groups and Iwahori-Hecke Algebras
• The efficient computation of Fourier transforms on the symmetric group
• Braids, Link Polynomials and a New Algebra
• Fast Fourier transforms for the rook monoid
• Fast Fourier Analysis for SL₂over a Finite Field and Related Numerical Experiments
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Representations of the Rook-Brauer Algebra
• Braid Groups
• On group Fourier analysis and symmetry preserving discretizations of PDEs
• Affine Birman–Wenzl–Murakami algebras and tangles in the solid torus
• Separation of variables and the computation of Fourier transforms on finite groups, I
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

This page was built for publication: The efficient computation of Fourier transforms on semisimple algebras