<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05768599</id>
  <dt>j</dt>
  <an>05768599</an>
  <augroup>
    <au>Malandro, Martin E.</au>
  </augroup>
  <ti>Fast Fourier transforms for finite inverse semigroups.</ti>
  <so>J. Algebra 324, No. 2, 282-312 (2010).</so>
  <py>2010</py>
  <pu>Elsevier Science (Academic Press), San Diego, CA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>fast Fourier transform</ut>
    <ut>finite inverse semigroup</ut>
    <ut>rook monoid</ut>
    <ut>representation theory</ut>
    <ut>maximal subgroups</ut>
    <ut>zeta transform</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.jalgebra.2009.11.031</li>
  </ligroup>
  <abgroup>
    <ab>The fast Fourier transform (FFT) on a finite group is extended to the FFT on a finite inverse semigroup. The most important finite inverse semigroup is the rook monoid. The author creates a general framework for constructing FFTs on finite inverse semigroups. The problem of computing the Fourier transform on a finite inverse semigroup is reduced to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. Further the author constructs FFTs for specific finite inverse semigroups $S$ (such as the rook monoid and the wreath product of the rook monoid with a finite group) which require ${\cal O}(|S|\, (\log |S|)^c)$ operations.</ab>
    <rv>Manfred Tasche (Rostock)</rv>
  </abgroup>
</item>