52 citations · 235 across the 24 of their papers we have counts for
5 papers · 1 filter
On the Spectrum of Finite, Rooted Homogeneous Trees
Daryl R. DeFord, Daniel N. Rockmore
In this paper we study the adjacency spectrum of families of finite rooted trees with regular branching properties. In particular, we show that in the case of constant branching, t…
The Computation of Fourier transforms on $SL_2(\mathbb{Z}/p^n\mathbb{Z}) and related numerical experiments
Benjamin K. Breen, Daryl R. Deford, Jason D. Linehan +1
We detail an explicit construction of ordinary irreducible representations for the family of finite groups for odd primes and . Fo…
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…
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…
Fast Fourier Transforms for the Rook Monoid
Martin Malandro, Daniel N. Rockmore
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 Fourie…