Mentees and Mentors from 2025 on presentation day! From left to right: Mandi, Kathleen, Peter, Ashley, June, Christian, Paul, Eden, Zion
MEET THE MENTORING TEAM FOR THE 2026 EDITION OF THE DIRECTED READING PROGRAM!
Paul Johnson
Eden Ketchum
Christian Naess
Zion Hefty
Luke Hetzel
Kaya Wright
Mandi Schaeffer Fry
- faculty mentor
(Prerequisites: Formally, none; however, some familiarity with proofs would be helpful)
A graph is a collection of vertices and edges connecting some of those vertices. A word is a finite string of letters. We will study word-representable graphs, graphs for which there exists a certain kind of word associated with them (more precisely, they are graphs for which there exists a word on the vertex set of the graph such that an edge xy is present in the graph exactly when x and y alternate in the word). Along the way, we will learn about partially ordered sets and orientations on graphs, and how those are useful tools when determining if a graph can be represented by a word in this way, and if so, how long/short such a word must/can be.
Book: Words and Graphs by Sergey Kitaev and Vadim Lozin
(Prerequisites: Formally, none; however, some familiarity with proofs could be helpful)
The topic of number theory has been of interest to mathematicians for thousands of years. In recent times it has proven to be useful for computer science and cryptography. In this reading cover the following topics associated with the set of integers: divisibility, congruences, modular arithmetic, arithmetic functions and further topics based on the interest of the student.
Book: Elementary Number Theory by Burton
(Prerequesites: linear algebra; some abstract algebra (such as knowing what a group is) is highly recommended.)
Sitting behind familiar algebraic structures like groups and rings lies structural properties such as commutativity and associativity. These properties can be represented visually with the language of string diagrams, as the fusing and twisting of strands. Hopf algebras generalize a lot of algebraic objects, in a way that can be twisted and deformed, creating a bridge to knot theory. String diagrams themselves are also useful, for example they provide a visual way to think about quantum computing. We will be following the book "A Course on Hopf Algebras" by Rinat Kashaev, although we can divert to talk about other topics.
(Prerequisites: just calculus, but real analysis would be a bonus!)
The study of the differential and integral calculus was initiated in the seventeenth and eighteenth centuries, mainly by Isaac Newton and Gottfried Leibniz. This early treatment of the subject relied on an intuitive notion of an "infinitesimal" a number smaller than any positive real number but importantly non-zero.
As such a number does not exist within the real numbers, when calculus was formalized in the nineteenth century, as an analysis of the real number line and its functions, the intuitive infinitesimals were rejected in favor of the so called ε,δ approach. It was not until the 1960's that Abraham Robinson formalized a sort of "nonstandard analysis" that uses a rigorous notion of infinitesimal, a type of hyperreal number, in order to give a rigorous foundation to the intuitive constructions of Newton and Leibniz.
The benefits of the infinitesimal calculus aside from justifying the historical origins of the subject are mainly pedagogical and technical. On the side of pedagogy, some mathematicians and educators argue that the infinitesimal approach is more easily grasped by students than the usual ε,δ approach. On the technical side the method has had use in pure and applied mathematics, including physics and economics as a source of mathematical models.
Book: Foundations of Infinitesimal Calculus by H. Jerome Keisler.
(prerequisites: formally, none; but linear algebra and/or some coding experience could help!)
From spies and generals to banks and businesses, encryption is essential. Much of the Allies' success in the second world war can be attributed to their breaking of the enigma machine. The reason only you can access your bank account is the strength of RSA protocols. In this directed reading we will study various methods of encryption and decryption that have been used throughout history. Depending on student interest we may study modern computer assisted methods of encryption and decryption as well.
(prerequisites: linear algebra; some group theory could also be helpful but is not a strict requirement)
Did you enjoy linear algebra? Do you wish to hear of matrices and eigenvalues and graphs and counting with an algebraic flavor throughout?
Come! Join me on a read through of Algebraic Combinatorics: Walks, Trees, Tableaux, and More by Richard P. Stanley
We'll start off with a discussion of counting walks in graphs using matrices and eigenvalues and then move on to other topics connected to graphs and partitions as time allows.