Fast Fourier Transforms for Finite Inverse Semigroups

Details Fast Fourier Transforms for Finite Inverse Semigroups Fast Fourier Transforms for Finite Inverse Semigroups

2009-05-08

arxiv.org/abs/0905.1340v3

J. Algebra 324(2) (2010), 282-312

Mathematics

Group Theory

ver 3: Added improved upper and lower bounds for the memory required by the fast zeta transform on the rook monoid. ver 2: Cor

Scientific paper

10.1016/j.jalgebra.2009.11.031

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. We then exhibit explicit fast algorithms for particular inverse semigroups of interest--specifically, for the rook monoid and its wreath products by arbitrary finite groups.

Affiliated with

Also associated with

No associations

Rating

Fast Fourier Transforms for Finite Inverse Semigroups 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 Finite Inverse Semigroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Fourier Transforms for Finite Inverse Semigroups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688746