Pictured: The 2026 Directed Reading Mentors and Mentees
Application link is at the bottom!
This year's edition of the Directed Reading at DU program will run through the
Winter and Spring Quarters 2027.
If you would like to get an idea of what happened in earlier editions, you can find this from the menu!
The goal of the program is twofold:
to provide opportunities and support for undergraduates interested in learning beautiful math and math-adjacent topics under the guidance of one of our graduate student mentors;
to provide our graduate students the opportunity for mentoring undergraduate projects.
We will focus on creating a welcoming learning community for the exchange of beautiful mathematics. We will also work on presentation skills with the goal of communicating math ideas in an effective way.
This year, Mentors and Mentees will receive small stipends!
The stipends are made possible by a CAREER grant through the U.S. National Science Foundation (DMS-2439897).
MEET THE MENTORING TEAM FOR THE 2026 EDITION OF THE DIRECTED READING PROGRAM!
August Sangalli
Luke Hetzel
Christian Naess
Orin Gotchey
Brendan Dufty
Paul Johnson
Mandi Schaeffer Fry - faculty mentor
(Prerequisites: Formally, none; however, some familiarity with abstract algebra (groups) would be helpful)
Topology is the study of geometric properties of objects that are stable under certain kinds of transformations (e.g. the coffee mug and the donut are comparable in some sense). Algebraic topology leverages certain connections with algebraic objects to study the topologies of certain spaces.
Topics to be studied include, but are not limited to: fundamental groups, covering spaces, Van Kampen's theorem, and homology.
Category theory is the mathematical study of connections. While it is often used at a very abstract level to work on mathematical structures, recent work has shown that category theory can also be used to explain and model ecological food webs, chemical reactions, and data transformations. In this directed reading we will be focusing on the first of these, building up an understanding of category theory using the book Seven Sketches in Compositionality before leaping into more recent research to investigate how several longstanding questions of biodiversity have been answered using categorical methods.
(Prerequisites: Techniques of Proofs required, would recommend some interest in abstract algebra, such as familiarity with a group and modular arithmetic)
The foundations of 20th century mathematics are built on ZFC set theory. Naïvely, a set is a bucket you can put things into that cannot contain itself. This has generally been quite effective, and one can reasonably say mathematicians have accomplished a lot in the past century. However, there are conceptual elements to type theory that don't seem to line up with how mathematicians think. There are infinitely many groups with two elements, although since they are all isomorphic, we like to think of there only being one group of order 2, Z2.
Type theory replaces sets with types, which always track what kind of data they contain. In homotopy type theory (HoTT), types become objects with a geometric flavor. Isomorphisms become paths linking together objects that we would want to consider "the same", and equality becomes a hierarchy of shapes that glue together things with "sameness" in possibly different ways. Homotopy type theory offers an alternative to foundations in mathematics that captures all the dynamic relationships between things.
In this project we will cover the basics of dependent type theory, and work towards understanding the univalent axiom of HoTT, building basic structures such as the natural numbers from the ground up. We will also learn how to formalize proofs as computer code. HoTT has found use in formalizing proofs for computers, and I see value in learning how this process works, rather than it being a mysterious black box.
Book: Introduction to Homotopy Type Theory by Egbert Rijke
(Prerequisites: Intro to Abstract Algebra (Math 3170))
Universal algebra studies properties of abstract algebraic structures. This is distinct from the related branch of mathematics, abstract algebra. Where abstract algebra studies algebraic structures and asks questions like "What are the properties of fields?" or "What is a representation theory of groups?", universal algebra treats the structures themselves as objects of study and asks questions such as "What are the properties of the class of all groups?" or "What is the subalgebra structure of the class of all bounded lattices?".
Book: A Course in Universal Algebra The Millenium Edition by S. Burris and H.P. Sankappanavar. This book is available for free online, a title search should easily find it.
(prerequisites: Calc 3 is required; linear algebra would be nice but is not required; probability and/or real analysis is highly recommended)
How do you make a password that you can remember that machines can't crack? What on earth is entropy and why does nobody seem to agree? What is a jpeg really doing when it says it is "compressing" the data? How is it that sometimes when a cd is scratched it skips but sometimes it reads perfectly fine? All these questions are related to a field called information theory, which we will explore.
(Prerequisites: Intro to Proofs and ideally familiarity with diagonalization arguments although not a strict requirement and can be covered in our readings.)
While the notion of an algorithm has existed since antiquity, modern computability theory began with David Hilbert's Entscheidungsproblem in 1928. Mathematicians spent the better part of the 1930s searching for the correct model of computation. In 1936, Turing introduced his model of computation and simultaneously dashed Hilbert's dream that all problems are computable.
We will study the foundational notions of computability from the perspective of Turing machines. This includes the Church-Turing thesis, the halting problem (an example of a non-computable problem), the recursion theorem (which implies the existence of a self-referential program), oracle machines, computably enumerable sets, and more!
Depending on the interest of the student, we will then be well equipped to study other models of computation, complexity theory, formal language theory, and advanced topics in computability theory such as forcing, the arithmetic hierarchy, and the structure of the Turing degrees.
Book: Turing Computability: Theory and Applications by Robert I. Soare
More details about the program:
During the Winter and Spring quarters, mentees will meet once a week for an hour with their mentors to discuss material related to their project.
At the end of the program (near the end of the spring quarter), each mentee will give a 20-minute presentation on something cool that they have learned. The mentor-mentee team will work together on this presentation during the last month of the program.
We will have a few social events in which we all get together to give updates on our projects and to consider relevant issues to the program such as: stories of resilience in mathematics, ways in which we can build a welcoming math community, ways in which we can improve as communicators of mathematical ideas, and ways in which we can be supportive mentors.
If you are on the fence about applying and/or have any questions please reach out to Dr. Mandi (mandi (dot) schaefferfry (at) du (dot) edu).
Prerequisites to apply:
1) Be excited about at least one of the projects described above. (Please read the project descriptions to make sure that you satisfy any class specific prerequisites of the project. Please, also note that most projects have no extra prerequisites).
2) Be available to meet once a week for an hour with your mentor, plus 1.5 hours of reading/work outside of the weekly meeting during the Winter and Spring quarters.
3) Be available for a few social gatherings.
4) Be interested in presenting some of what you have learned at the end of the program with the help and support of the mentoring team.
5) Be an undergraduate at DU.
APPLICATIONS ARE OPEN FROM October 16th TO NOV 13TH, 2026
Read the project descriptions above and
APPLY HERE!
We will be in touch with news on the mentor-mentee pairings in November 2026.