Join the Mathematics and Statistics Department for a variety of stimulating math talks. We will meet every Monday from 3:10 to 4 p.m. (unless otherwise noted). For those who are on our distribution list, instructions on how to join each virtual meeting will be sent to your Kenyon email. If you would like to be added to the distribution list, please email Emily Teater at teater1@kenyon.edu.
Fall 2026
Our first Math Monday of the new year is set for Aug. 31. Please join us for a Math Nature Walk, which will start at 3:10 p.m. Plan to meet at the outside doors to Hayes Hall. We will leave shortly after 3:10 p.m.
A drink station will be available before the walk, but you are encouraged to bring your own water bottles. This is your chance to catch up with old friends and meet new ones as we say hello to all our fellow math and stats faculty and students. We hope to see you there!
Meet and greet with your fellow math/stat students and the math and statistics faculty at this year's First-Year Welcome Tea. Say hello to our math community and hear about all the exciting news in math and statistics.
Join us on the Peirce Hall patio (weather permitting) at 3:10 p.m. on Monday, Sept. 7. We will be offering a variety of snacks with lemonade and iced tea. Celebrate another year of mathematics and statistics here at Kenyon. We hope to see you there!
Every summer, many of our students participate in various summer research programs. Students work as full participants in the processes of creating a research plan, executing a research project, and preparing results for presentation in a public forum. Learn more about the research done by your fellow mathematics and statistics students.
This week's panelists include:
Owen Brown '27 did summer research at the Summer@ICERM 2026 program focused on DNA graph theoretical modeling of DNA self-assembly. Self-assembly is the process where a set of components combine to form an organized structure without external direction or energy input. Double stranded DNA molecules have unique properties that make them a useful material for the self-assembly of nanostructures. These nanostructures can be modeled with discrete graphs, turning DNA self-assembly into an interesting mathematical puzzle. These nanostructures have wide-ranging applications, such as containers for the transport and release of nano-cargos, templates for the controlled growth of nano-objects, and in drug-delivery methods. His research this summer explored several graph families, utilizing graph theoretical and combinatorial properties of DNA self-assembly to optimize the nanostructure construction for laboratories. This presentation will explain the graph theoretical model for DNA self-assembly and feature an example that Owen worked on this summer, Kayak Paddle Graphs.
Quang Doan '28 - Worked with Prof. Gee as part of this year's Summer Science Scholars. This project explores optimal path planning for an undetected survivor in a zombie apocalypse who must reach a safe zone within a set deadline. He developed a path planning model in which local slope determines the survivor's speed, while terrain type and zombie density determine the cost of movement. Because the zombies diffuse randomly, their density is modeled by the 2D diffusion equation (PDE). With the solution to the PDE, he then derived a time-dependent Hamilton-Jacobi-Bellman (HJB) equation and solve it numerically backward in time. He tested the model on real elevation and terrain data from Gambier, OH, using an initial zombie population inspired by Kenyon College student activity patterns. Evaluating the model under different deadlines generates distinct optimal evacuation paths. Specifically, shortening the deadline generates a path approaching the time-optimal trajectory, whereas increasing the deadline makes the solution converge to the safest path. Overall, when the deadline is long enough, he predicted it is optimal to take a slower path that avoids high-density zombie regions at the expense of time.
Join us on Monday, Sept. 14, at 3:10 pm in Hayes Hall 109 to hear these exciting presentations and perhaps learn how you too can get involved in summer research programs. We hope to see you there!
Every summer, many of our students participate in various summer research programs. Students work as full participants in the processes of creating a research plan, executing a research project, and preparing results for presentation in a public forum. Learn more about the research done by your fellow mathematics and statistics students.
This week's panelists include:
Khanh Mai ‘28 worked as part of the Kenyon Summer Science Scholars this year. As a generalization of cyclic and constacyclic codes, polycyclic codes offer a promising framework for constructing codes with good properties. Since the dual of a polycyclic code is not necessarily polycyclic, characterizing their dual presents theoretical challenges. In this research, he investigated polycyclic codes associated with trinomials and quadrinomials. He established that all dual-containing polycyclic codes are, in fact, constacyclic. Furthermore, he proved several duality results for polycyclic codes associated with trinomials and quadrinomials, and presented many examples of polycyclic codes with optimum or best-known parameters. Finally, he resolved an open conjecture from a recent manuscript regarding binary polycyclic codes associated with trinomials.
Lucas Waite ‘28 also worked as part of the Kenyon Summer Science Scholars over the summer. Recent progress has produced the first exponential improvement in nearly fifty years to the general asymptotic upper bounds for binary codes. By contrast, the corresponding lower-bound problem remains open. Lucas studied this problem, the Gilbert-Varshamov conjecture, through the lens of graph theory by defining the proximity graph of a metric space, in which codes correspond to independent sets and the Gilbert-Varshamov bound arises from the classical degree bound on independence. Lucas thus investigated whether fixed subgraph counts in the Hamming proximity graph can force independent sets exponentially larger than those guaranteed by Gilbert-Varshamov.
Join us on Tuesday, Sept. 22, at 11:10 am in Hayes Hall 109 (please note the date and time change) to hear these exciting presentations and perhaps learn how you too can get involved in summer research programs. We hope to see you there!
Interested in using your mathematical and statistical knowledge to solve current, real-world problems? Learn about open-ended mathematical and statistical problems posed by local partner organizations, including the Knox Department of Public Health, the Knox Area Development Foundation, and the Mount Vernon Law Director’s Office.
We’ll be exploring these problems in our new spring offering, the "Kenyon Applied Math and Stats Analytics and Modeling Partnership" (MATH/STAT 391). In this class, you’ll work in faculty-guided teams to apply your mathematical and statistical knowledge to these problems. At the end of the semester, you’ll present your findings and recommendations in written and oral form to your respective organization.
In this session, we’ll present some of the interesting questions that our local partners have posed. We’ll also describe class structure, interactions with partners, and what kinds of knowledge will be useful. There will be plenty of time to get all your questions answered.
Everyone interested in learning about real-world mathematical and statistical applications is welcome to attend, even if MATH/STAT 391 won’t work in your schedule. Join us on Monday, Oct. 5, at 3:10 p.m. in Hayes 109. We hope to see you there!
AI can produce polished answers with little effort from a student, making it harder to tell what they actually understand. The concern is cognitive bypass: arriving at a convincing result without doing the thinking the task was meant to develop. This talk explores a broader question for education: how can we use AI while keeping student reasoning at the center of learning? One approach is to design the activity around structured collaboration, turns that require students to contribute, and AI feedback that guides without simply giving the answer. Making intermediate steps visible can help students reflect on their thinking and help instructors see where understanding develops or breaks down. Early classroom observations suggest that this kind of structure may also support more balanced participation.
Join us on Monday, Oct. 12, for this exciting presentation from Jim Skon, professor of mathematics and computer science at Kenyon College. The presentation will begin in Hayes 109 at 3:10 p.m. We hope to see you there!
Are you interested in a summer or mid-semester internship? Are you curious about what internships look like in math or related fields? Then join us for a Student Internship Panel. Hear your peers discuss their recent internships and share their experiences with you. Alicia Misarti and Lori Gastin from Kenyon’s Career Development Office (CDO) will also share some details about how the CDO can support you in the process of securing an internship.
This week's panelists include Riley Bhatia '27 (working at Verisk Analytics), Kate Bogan '27 (working at Novolex), and Alejandro Gonzalez '27 (working at Ankura Consulting Group). Join us on Monday, Oct. 19, at 3:10 am in Hayes Hall 109 to hear these exciting presentations and perhaps learn how you too can get involved in summer internship programs. We hope to see you there!
A central philosophy in commutative algebra is that the (free) resolutions of algebraic objects are the keys to understanding the objects themselves. Indeed, a resolution approximates an algebraic object by simpler algebraic objects and conceals a world of subtle yet essential information. This information is often difficult to extract without realizing additional algebraic structure (i.e. a DG algebra structure) on the resolution itself. In this talk, we introduce the notion of a DG algebra resolution and specialize to the case of edge ideals of split graphs, which are algebraic objects defined by such graphs.
Much of the talk will be devoted to unpacking the terminology in the title, and towards the end, recent results from joint work with Oberlin students will be presented. The talk is intended to be accessible to students who have seen some linear algebra.
Join us on Monday, Nov. 9, for this exciting presentation from Rachel Diethorn, assistant professor of mathematics at Oberlin College & Conservatory. The presentation will begin in Hayes 109 at 3:10 p.m. We hope to see you there!
Looking for a break from all the homework and exams? This week’s Math Monday is a relaxing breather from course work and a thank you for attending our Math Monday sessions this fall. Free snacks and drinks provided by AVI Dining Services will be available at the door. Join us on Monday, Nov. 16, at 3:10 p.m. in Hayes 109 for all the fun. We hope to see you there!
Eye trackers are an important tool in cognitive science research. Advances in eye-tracking technology have reduced the invasiveness of early equipment, along with the cost of acquiring devices for research. As such, eye-tracking is becoming an essential part of research on software engineering and program comprehension. However, eye-tracking devices create challenges for researchers. Eye-tracking devices have inherent margins of error in sampling introduced by various factors, which cannot be controlled and can introduce errors in study data. As such, despite best efforts, eye-tracking data always needs some form of correction to identify and remove invalid data or adjust it as samples drift or become displaced over time due to participant movement, fatigue, or other factors. The processes used to correct eye-tracking data are time-consuming and require trial and error to correct the data reasonably while mitigating the impact of the corrections.
Additionally, eye-tracking infrastructure to support program comprehension studies with realistic stimuli in natural software development environments is limited. This work addresses these limitations. Focusing on program comprehension-based studies using eye-tracking, this work presents SrcGaze, an algorithm that automatically corrects fixation gaze event data using source code stimuli. Compared with state-of-the-art fixation correction methods, SrcGaze achieves 73% agreement with manually corrected fixation data. The algorithm also has a linear runtime, making it the most computationally efficient approach; it can correct over 44,000 fixations in only 6 seconds.
This work also contributes to iTrace, an infrastructure to support eye-tracking studies using source code. This work includes a redesign of the infrastructure, the creation of plugins to support multiple development environments and tools, implementation of eye-tracking data analysis and storage tools, and Deja Vu, a novel approach to supporting high-speed eye-tracking devices sampling at speeds >60 Hz while also supporting recording and playback of participant studies for unlimited research opportunities post-data collection.
Join us on Thursday, Nov. 19, for this exciting presentation from Drew Guarnera, assistant professor of Computer Science at the College of Wooster. The presentation will begin in Tomsich 101 at 11:10 a.m. (Please note the date, time and location change). We hope to see you there!
This semester, our seniors majoring in mathematics and statistics pursued independent research projects on a topic of interest. The research topics spanned a wide range. These students will present their work at a poster session this week to share their work with the wider Kenyon community. Come support your fellow math and stat students!
The poster session will be held in Peirce Hall in the Alumni Dining Room from 11:10 a.m. to 1 p.m. on Thursday, December 3. We hope to see you there!