Fast Fourier transforms for wreath products

DOI10.1006/acha.1995.1020zbMath0841.65141OpenAlexW2078992516MaRDI QIDQ1908143

Daniel N. Rockmore

Publication date: 1 July 1996

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c0d5c4d7175016a7ad5321b42bbec5a7e195f713

zbMATH Keywords

wreath productsdata analysislinear complexityfast Fourier transform algorithms(subgroup)-adapted bases

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Extensions, wreath products, and other compositions of groups (20E22) Complexity and performance of numerical algorithms (65Y20)

Related Items (9)

Zonal polynomials for wreath products ⋮ Twisted Gelfand pairs of complex reflection groups and \(r\)-congruence properties of Schur functions ⋮ Inverse semigroup spectral analysis for partially ranked data ⋮ Applications of the generalized Fourier transform in numerical linear algebra ⋮ Rooted trees and iterated wreath products of cyclic groups ⋮ Fast Fourier transforms for finite inverse semigroups ⋮ The Maschke property for the Sylow $p$-sub-groups of the symmetric group $S_{p^n}$ ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Fourier Inversion for Finite Inverse Semigroups

This page was built for publication: Fast Fourier transforms for wreath products