Fast Fourier transforms for the rook monoid.

From MaRDI portal



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.



Cites work









This page was built for publication: Fast Fourier transforms for the rook monoid.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189159)