Fast Fourier Transforms for the Rook Monoid
classification
🧮 math.RT
cs.NAmath.NA
keywords
fourierfastfftsmonoidrooktransformsalgorithmscalled
read the original abstract
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks the first extension of group FFTs to non-group semigroups.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.