An eigenspace approach to isotypic projections for data on binary trees
Representation Theory
2014-06-26 v1 Group Theory
Abstract
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant under automorphisms of a binary tree. We present a technique by which a slightly relaxed form of the generalized Fourier transform in this case can eventually be computed using only simple tools from linear algebra, which has possible advantages in computational efficiency.
Cite
@article{arxiv.1406.6403,
title = {An eigenspace approach to isotypic projections for data on binary trees},
author = {Nathaniel Eldredge},
journal= {arXiv preprint arXiv:1406.6403},
year = {2014}
}
Comments
Undergraduate thesis, Harvey Mudd College, 2003. 75 pages