Fast Fourier transforms for finite inverse semigroups
From MaRDI portal
Publication:986071
DOI10.1016/J.JALGEBRA.2009.11.031zbMath1197.65235arXiv0905.1340OpenAlexW2077807450MaRDI QIDQ986071
Publication date: 11 August 2010
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.1340
maximal subgroupsfast Fourier transformrepresentation theoryrook monoidfinite inverse semigroupzeta transform
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)
Related Items (13)
Quivers of monoids with basic algebras ⋮ Factoring the Dedekind-Frobenius determinant of a semigroup ⋮ Fast Möbius inversion in semimodular lattices and ER-labelable posets ⋮ Varieties of Boolean inverse semigroups ⋮ Non-commutative Stone duality ⋮ Inverse semigroup spectral analysis for partially ranked data ⋮ Fast Fourier transforms for the rook monoid ⋮ The efficient computation of Fourier transforms on semisimple algebras ⋮ Simplicity of augmentation submodules for transformation monoids ⋮ Recent developments in inverse semigroup theory ⋮ Fourier Inversion for Finite Inverse Semigroups ⋮ Unnamed Item ⋮ Character theory of monoids over an arbitrary field.
Cites Work
- A generalization of spectral analysis with application to ranked data
- Representations of the rook monoid.
- Fast Fourier transforms for wreath products
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- Some remarks on the combinatorics of \(\mathcal{IS}_n\).
- On the structure of semigroups
- Efficient Computation of the Fourier Transform on Finite Groups
- 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
- Separation of variables and the computation of Fourier transforms on finite groups, I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast Fourier transforms for finite inverse semigroups