Image processing refers to the various operations performed on pictures that are digitally stored as an aggregate of pixels. One can enhance or degrade the quality of an image, artistically transform the image, or even find or recognize objects within the image. This paper is concerned with image processing, but in a very mathematical perspective, involving representation theory. The approach traces back to Cooley and Tukey’s seminal paper on the Fast Fourier Transform (FFT) algorithm (1965). Recently, there has been a resurgence in investigating algebraic generalizations of this original algorithm with respect to different symmetry groups. My approach in the following chapters is as follows. First, I will give necessary tools from representation theory to explain how to generalize the Discrete Fourier Transform (DFT). Second, I will introduce wreath products and their application to images. Third, I will show some results from applying some elementary filters and compression methods to spectrums of images. Fourth, I will attempt to generalize my method to noncyclic wreath product transforms and apply it to images and three-dimensional geometries.

De Bruijn graphs were originally introduced for finding a superstring representation for all fixed length words of a given finite alphabet. Later they found numerous applications, for instance, in DNA sequencing. Here we study a relationship between de Bruijn graphs and the family of lamplighter groups (a particular class of wreath products). We show how de Bruijn graphs and their generalizations can be presented as Cayley and Schreier graphs of lamplighter groups.

Thesis (M.S.)--University of Akron, Dept. of Mathematics, 2008. / "May, 2008." Title from electronic thesis title page (viewed 07/12/2008) Advisor, Jeffrey M. Riedl; Faculty Readers, Ethel Wheland, Stuart Clay; Department Chair, Joseph Wilder; Dean of the College, Ronald F. Levant; Dean of the Graduate School, George R. Newkome. Includes bibliographical references.

Thesis (M.S.)--University of Akron, Dept. of Mathematics, 2008. / "May, 2008." Title from electronic thesis title page (viewed 07/12/2008) Advisor, Jeffrey M. Riedl; Faculty Readers, William S. Clary, Ethel R. Wheland; Department Chair, Joseph W. Wilder; Dean of the College, Ronald F. Levant; Dean of the Graduate School, George R. Newkome. Includes bibliographical references.

No description available.

In this thesis, we construct an algebraic framework for analyzing committee elections. In this framework, module homomorphisms are used to model positional voting procedures. Using the action of the wreath product group S2[Sn] on these modules, we obtain module decompositions which help us to gain an understanding of the module homomorphism. We use these decompositions to construct some interesting voting paradoxes.

No description available.

We define a faithful linear monoidal functor from the partition category, and hence from Deligne's category Rep(S_t), to the additive Karoubi envelope of the Heisenberg category. We show that the induced map on Grothendieck rings is injective and corresponds to the Kronecker coproduct on symmetric functions. We then generalize the above results to any group G, the case where G is the trivial group corresponding to the case mentioned above. Thus, to every group G we associate a linear monoidal category Par(G) that we call a group partition category. We give explicit bases for the morphism spaces and also an efficient presentation of the category in terms of generators and relations. We then define an embedding of Par(G) into the group Heisenberg category associated to G. This embedding intertwines the natural actions of both categories on modules for wreath products of G. Finally, we prove that the additive Karoubi envelope of Par(G) is equivalent to a wreath product interpolating category introduced by Knop, thereby giving a simple concrete description of that category.

No description available.

It is known that a Cayley digraph of an abelian group A is isomorphic to a nontrivial wreath product if and only if there is a proper nontrivial subgroup B of A such that the connection set without B is a union of cosets of B in A. We generalize this result to Cayley digraphs of nonabelian groups G by showing that such a digraph is isomorphic to a nontrivial wreath product if and only if there is a proper nontrivial subgroup H of G such that S without H is a union of double cosets of H in G. This result is proven in the more general situation of a double coset digraph (also known as a Sabidussi coset digraph.) We then give applications of this result which include obtaining a graph theoretic definition of double coset digraphs, and determining the relationship between a double coset digraph and its corresponding Cayley digraph. We further expand the result obtained for double coset digraphs to a collection of bipartite graphs called bi-coset graphs and the bipartite equivalent to Cayley graphs called Haar graphs. Instead of considering when this collection of graphs is a wreath product, we consider the more general graph product known as an X-join by showing that a connected bi-coset graph of a group G with respect to some subgroups L and R of G is isomorphic to an X-join of a collection of empty graphs if and only if the connection set is a union of double cosets of some subgroups N containing L and M containing R in G. The automorphism group of such -joins is also found. We also prove that disconnected bi-coset graphs are always isomorphic to a wreath product of an empty graph with a bi-coset graph.