During the Fall 2009 semester I took an independent study with Dr. Joe Stickles and
Dr. James Rauff of the Millikin University’s Department of Mathematics on researching
the possibility of using formal language theory to study graphs. By the end of the
semester I proved that there exists a regular language whose words are paths in a
graph. At this time Dr. Stickles mentioned that this research couple be applied
to researching zero-divisor graphs of commutative ring theory.
Starting that spring I began to research using these new graph languages to study
zero-divisor graphs in my free time. By May, I was able to come up with a large number of
results. The paper attached with this letter contains all of the more interesting and
important theorems and definitions. All of this work was completed at Millikin University
during my undergraduate career. Dr. Joe Stickles of Millikin University’s Department of
Mathematics will be acting as my sponsor.
I have since graduated from Millikin University and I am now a graduate student at
The University of Iowa’s Department of Computer Science. I plan to graduate with a PhD in
theoretical computer science. As of late, I am considering computational logic as a research
interest. I have just a few hobbies other than computer science and mathematics they are
reading biographies of mathematicians and computer scientists, jogging, mountain biking, and
listening to music.
The only special requirements on the attached paper are that it is written in latex and
it uses PGF and TiKz for the graphs. You must have both of these installed before compiling
the paper into a PDF.
Sincerely,
Harley D. Eades III