Fourier Inversion for Finite Inverse Semigroups

DOI10.1137/130932028zbMath1311.65175arXiv1212.6462OpenAlexW2071781354MaRDI QIDQ5251539

Martin E. Malandro

Publication date: 20 May 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

fast Fourier transformwreath productrook monoidMöbius transformfinite inverse semigroup

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups, etc. (43A30) Inverse semigroups (20M18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence and efficient construction of fast Fourier transforms on supersolvable groups
• Fast Fourier transforms for finite inverse semigroups
• A generalization of spectral analysis with application to ranked data
• Representations of the rook monoid.
• Fast Fourier transforms for wreath products
• Inverse semigroup spectral analysis for partially ranked data
• The planar rook algebra and Pascal's triangle.
• Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
• On the structure of semigroups
• Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
• Fourier meets M\"{o}bius: fast subset convolution
• Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
• The efficient computation of Fourier transforms on the symmetric group
• Fast Fourier transforms for the rook monoid
• An Algorithm for the Machine Calculation of Complex Fourier Series