arXiv · 0709.4175
Fast Fourier Transforms for the Rook Monoid
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.
Explore related subjects
Keep this discovery
Martin Malandro, Daniel N. Rockmore. 2007-09-26. Fast Fourier Transforms for the Rook Monoid. https://doi.org/10.1090/s0002-9947-09-04838-7
Cite the original work for its findings. Save a collection to share your selection of sources.