2 citations · 2 across the 2 of their papers we have counts for
5 papers
Computational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups
Michael Hansen, Masanori Koyama, Matthew B. A. McDermott +2
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach t…
The efficient computation of Fourier transforms on semisimple algebras
David Maslen, Daniel N. Rockmore, Sarah Wolff
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein…
Random walks on the BMW monoid: an algebraic approach
Sarah Wolff
We consider Metropolis-based systematic scan algorithms for generating Birman-Murakami-Wenzl (BMW) monoid basis elements of the BMW algebra. As the BMW monoid consists of tangle di…
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II
David Maslen, Daniel N. Rockmore, Sarah Wolff
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which…
Asymptotic Growth of Associated Primes of Certain Graph Ideals
Sarah Wolff
We specify a class of graphs, , and characterize the irreducible decomposition of all powers of the cover ideals. This gives insight into the structure and stabilization of th…