Fast Fourier transforms for wreath products
DOI10.1006/ACHA.1995.1020zbMATH Open0841.65141OpenAlexW2078992516MaRDI QIDQ1908143FDOQ1908143
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
Recommendations
data analysiswreath productslinear complexityfast Fourier transform algorithms(subgroup)-adapted bases
Complexity and performance of numerical algorithms (65Y20) Extensions, wreath products, and other compositions of groups (20E22) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (12)
- Applications of the generalized Fourier transform in numerical linear algebra
- Fourier Inversion for Finite Inverse Semigroups
- Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence
- The Maschke property for the Sylow $p$-sub-groups of the symmetric group $S_{p^n}$
- Fast Fourier transforms for finite inverse semigroups
- Inverse semigroup spectral analysis for partially ranked data
- Twisted Gelfand pairs of complex reflection groups and \(r\)-congruence properties of Schur functions
- Zonal polynomials for wreath products
- A wreath product group approach to signal and image processing. I: Multiresolution analysis
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- Rooted trees and iterated wreath products of cyclic groups
- Double coset decompositions and computational harmonic analysis on groups
This page was built for publication: Fast Fourier transforms for wreath products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908143)
