Directed Reading Program (DRP)
Mission Statement
The primary goal of the DRP is to broaden participation in mathematics, especially among members of underrepresented groups, by increasing individuals’ self-identity as mathematicians, by providing them with mentors close to their age, and by welcoming them into the broader mathematical family. Secondary objectives of the program are to extend the undergraduate curriculum and to provide mentoring experience to graduate students.
Requirements
Student mentees are expected to meet with their mentors for one hour each week and spend about four hours prior to each meeting reading and preparing. The precise details of what the undergraduates should do outside of these meetings can be worked out between mentors and mentees, but could include taking notes and preparing questions, working out exercises, or preparing to present a proof on the board at the next meeting. During the second to last week of classes mentees will give a 15 minute presentation on what they learned.
Organization
The DRP is organized by a committee of graduate students. The committee’s responsibilities include recruiting participants, pairing mentors and mentees, and providing guidance and mediation as needed.
Webpage
The main page for the Directed Reading Program at Syracuse University can be found at this link.
Previous Projects
Year | Project | Student(s) | Advisor | |
---|---|---|---|---|
2023 | Spring | |||
Complex Analysis and Applications to Fluid Flow | Nicholas Rubayiza | Jesse Hulse | ||
Rank Nullity Theorem | Lillian Impastato | Des Martin | ||
Lasker-Noether Theorem | Connor Ritchie | Richard Bartels | ||
Category Theory | Zhiyu Miao | Ben Kaufman | ||
Relator Games on Groups | Xizhe Zhang, Taeheun Lee | Henry Potts-Rubin | ||
Knot Theory | Hao Yao | Jacob Migdail-Smith | ||
Graph Colorings | Hanbing Wei | Chelsea Sato | ||
Algorithms on Trees | Aksel Malatak | Marie Kramer | ||
Graph Labelings | Juliette Mangon | Hannah Kimbrell | ||
Number Theory | Sadie Meyer | Elana Israel | ||
Basic Applications of Graph Theory | Spencer Evans-Cole | Karie Schmitz | ||
2022 | Fall |
Number Theory |
Lillian Impastato | Elana Israel |
Complex Analysis | Trevor Knight | Jesse Hulse | ||
Combinatorics | Elizabeth Ricchetti | Hannah Kimbrell | ||
Algebra | Lisa Zhang | Nicholas Ng | ||
Graph Theory | Hanbing Wei | Chelsea Sato | ||
Topology | Hao Yao | Jacob Migdail-Smith | ||
Graph Theory | Chance Baggett & Connor Ritchie | Marie Kramer | ||
2022 | Spring | Topology, Topological Properties of the Fundamental Group of the Circle | Aksel Malatak | Nicholas Ng |
The Pumping Lemma and Regular Languages | Athanasios Hadjidimoulas | Eric Cochran | ||
Topological Space | Bei Luo | Ralph Xu | ||
Defining a Hilbert Space | Chance Baggett | Tim Tribone | ||
Knot Theory | Hanbing Wei | Elana Israel | ||
Surface Integrals and the Divergence Theorem | Isaac Lehigh | Jesse Hulse | ||
Number Theory | Lillian Impastato | Chelsea Sato | ||
Combinatorics | Mikhail Khramov | Hannah Kimbrell | ||
The Residue Theorem | Yao Cai | Jesse Hulse | ||
Group Operation and Group Action | Yuming Jiang | Bhargavi Pathasarathy | ||
2021 | Fall | Introduction to Group Theory | Yuming Jiang | Kaiyue He |
Number Theory | Yao Cai | Keshab Raj Adhikari | ||
Frenet Fields and Their Uses | Arthur “Will” Edwards | Paul Makkumba | ||
Maximizing Network Flows Algorithmically | Anthony Mazzacane | Chelsea Sato | ||
Knot Theory | Kevin Nam | Jacob Migdail-Smith | ||
2021 | Spring | Pólya Enumeration Theory | Erika Hall | Nathan Uricchio |
Rolle’s Theorem to the Cauchy Mean Value Theorem | Chien-peng Lee | Rick Bartles | ||
Matroid Duality and the Greedy Algorithm | Kalayaan Raguso | Nathan Uricchio | ||
The Joy of X | Tongxi Yu | Casey Necheles | ||
2020 | Fall | Introductory Matroid Theory | Chenmeinian Guo | Nathan Uricchio |
Elementary Linear Algebra | Juha Schraden | Tim Tribone | ||
Worlds beyond metrics | Megan Perlman | Jacob Migdail-Smith | ||
An Invitation to Algebraic Topology | Elahe Samani | |||
Game Theory | Caleb Mcwhorter | |||
2020 | Spring/Fall | Network Flows and the Augmenting Flow Algorithm | Bradley Pirie | Nathan Uricchio |
2020 | Spring* | Planar Graphs | Michael Perry | Nathan Uricchio |
Mathematical Cryptography | Joseph D’Angelo | Tim Tribone | ||
2019 | Fall | Rouche’s Theorem and Applications | Austin Church | Steven Farnham |
2019 | Spring | Mathopoly: A Game Theory Saga | Kevin Aubrey, Emily Dyckman | Josh Fenton |
An Introduction to Elliptic Curves and Their Cryptographic Applications | Samuel Wheeler | Caleb McWhorter | ||
Machine Learning Outline: Neural Network and Digit Recognition | Yantao Wu | Erin Tripp | ||
2018 | Fall | Gröbner Bases | Delong Chen | Laura Ballard |
Optimal Blackjack Strategy | Tighe Gugerty | Josh Fenton | ||
The Four Vertex Theorem and its Converse | Seif Hejazine | Alice Lim | ||
Linear Optimization Theory and Applications | Chang Liu | Steve Farnham | ||
Fermat’s Last Theorem | Xinxuan Wang | Caleb McWhorter | ||
Some Fundamental Theorems of Number Theory and their Proofs | Brooke Weiss | Rachel Diethorn |
*Cut short due to Covid-19
Other Directed Reading Programs
DRP Network
UCLA
Rutgers
Berkeley
University of North Carolina at Chapel Hill
University of Georgia
University of Virginia
University of California, Santa Cruz
MIT
Stanford
Brown University
Brown University (Applied Mathematics)
University of Texas, Austin
University of Maryland
Boston University
Tufts University
University of Wisconsin-Madison
Brandeis University
UCONN
Indiana University
Johns Hopkins
University of California, Santa Barbara
University of Oregon
SUNY Stony Brook
Georgia Tech
Yale University
University of Minnesota
Vanderbilt University
University of Chicago
University of Oklahoma
University of Pennsylvania
University of Utah
Wesleyan University