Fast Fourier Transforms for the Rook Monoid

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1090/S0002-9947-09-04838-7

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Fast Fourier Transforms for the Rook Monoid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Fourier Transforms for the Rook Monoid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Fourier Transforms for the Rook Monoid will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-694899

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.