Honors Program Theses


Open Access Honors Program Thesis

First Advisor

Marius Somodi


Dessins d'enfants are bipartite graphs with a cyclic ordering given to the set of edges that meet at each vertex. Merling and Perlis presented a method by which to construct pairs of dessins d'enfants using the permutations induced by the action of a finite group on the cosets of two locally conjugate subgroups of that group. They called these pairs of dessins Gassmann equivalent and investigated some of their properties. First, we discuss several properties of pairs of dessins that imply Gassmann equivalence. Then, using elementwise conjugate subgroups, we introduce and investigate a weaker type of equivalence of dessins, which we refer to as Kronecker equivalence.

Year of Submission



Department of Mathematics

University Honors Designation

A thesis submitted in partial fulfillment of the requirements for the designation University Honors


If you are the rightful copyright holder of this thesis and wish to have it removed from the Open Access Collection, please submit a request to scholarworks@uni.edu and include clear identification of the work, preferably with URL.

Date Original


Object Description

1 PDF file (25 pages)