Fast Fourier Transforms for the Rook Monoid
Representation Theory
2011-08-02 v1 Numerical Analysis
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.
Cite
@article{arxiv.0709.4175,
title = {Fast Fourier Transforms for the Rook Monoid},
author = {Martin Malandro and Daniel N. Rockmore},
journal= {arXiv preprint arXiv:0709.4175},
year = {2011}
}