CMU Mathematics Undergraduate Research, 2025
In early 2020, as the global coronavirus pandemic brought the world to a screeching halt, many of our students found that their summer programs had been cancelled. Many of these students were very interested in using this suddenly free summer to engage with open ended-projects in mathematics. In response to this demand, the Department of Mathematical Sciences curated a brand new summer program: Summer Experiences in Mathematical Sciences (SEMS). This program is offered in parallel with the traditional SURF program, which provides stipends to students who stay at 好色先生TV in the summer months to work on research projects. Outlined below are the projects undertaken during the summer of 2025 as part of the SURF and SEMS programs.
▼ SURF project
► Negative moments of Steinhaus sums
Isabella Wu
Advisor: Tomasz Tkocz
Abstract: How "large" is the magnitude of a random walk on the plane started at the origin with independent increments chosen uniformly at random on the circles with prescribed radii? We prove a sharp upper bound on negative moments of sums of independent Steinhaus random variables (that is uniform on circles in the plane).

▼ SEMS projects
► Monotonicity of Minkowski Averages
Nathaniel Kenschaft, Zubin Narayan
Advisors: Martin Rapaport and Tomasz Tkocz
Abstract: This project explored two interconnected problems in convex geometry and analysis. First, the students analyzed a new proof of the classical Borell--Brascamp--Lieb inequality, a fundamental result that generalizes the Brunn--Minkowski and Prékopa--Leindler inequalities. Second, they investigated a conjecture concerning the monotonicity of Minkowski averages, which is known to hold in dimension one and to fail in sufficiently high dimensions, but remains unresolved in dimensions $2 \leq n \leq 11$.
The students examined structural properties of iterated Minkowski sums, explored functional analogues of the conjecture, and studied related geometric quantities such as the Hausdorff distance and the Schneider convexity index.

In addition, they implemented a computational model to approximate iterated Minkowski sums and visualize their growth directly in dimension~2, and investigated approaches to the conjecture via discretizations on $\mathbb{Z}^2$ as a potential direction to eventually prove the conjecture. Finally, they wrote a short report documenting their progress, methods, and ideas for further work on this open problem.
► Fiid Coloring Percolation Components
Daniel Sium, Justin Hsu
Advisor:
Abstract: Fiid processes are one model for local or distributed algorithms with many applications in probability and combinatorics. In this project, we looked for fiid analogues of the famous 4-color theorem.
We showed that if you generate a random map by deleting boundaries from the square grid (so that each grid line is erased independently with some probability less than 1/2), you can color the resulting map with an fiid process using only 6 colors.
► New Interpretations of $q$-Ballot Numbers
Alex Wittig, Will Schremmer, Corey Predella
Advisor: Irina Gheorghiciuc
Abstract: A Ballot path is a finite lattice path in the $xy$-plane that starts at the origin, consists of diagonal up steps $(1,1)$ and diagonal down steps $(1,-1)$, and never goes below the $x$-axis. The Ballot number $B(a,b)$ is the number of Ballot paths that end in the point $(a+b,a-b)$. In this project we considered two different polynomial generalizations of the Ballot number, $B_q(n,r)$ and $B^{(2)}_q(n,r)$, both of which matter in the combinatorial interpretation of the Super Catalan polynomial.

Symmetric Lattice of Dyck Paths (length 6)
Smaller area paths are on top

We found a new interpretation of $B_q(n,r)$ in therms of the inversion statistics $inv(w)$, and a less elegant interpretation of $B^{(2)}_q(n,r)$ in terms of the major $maj(w)$ and $des(w)$ statistics.
► Free Boundary Problems
Henry Zheng, Gorden Jin
Advisor: Giovanni Leoni
Abstract: A free boundary problem is mathematical problem where the solution is not only unknown but also part of the region in which it is defined is unknown and must be determined as part of the solution. One of the simplest examples of a free boundary problem is the obstacle problem. Imagine you have a thin, flexible membrane (like a stretched rubber sheet) lying over a fixed obstacle (like a bump). The membrane is pushed down by an external force (like gravity), but it cannot go below the obstacle. Mathematically, we describe this problem using differential inequalities. In this project, we study free boundary problems involving functions of one variable.
We prove the existence of solutions to second-order differential equations using the notion of viscosity solutions and then apply this technique to the obstacle problem.

2025 SURF team
Student: Isabella Wu
Faculty: Tomasz Tkocz
2025 SEMS research team
Students: Justin Hsu, Gorden Jin, Nathaniel Kenschaft, Zubin Narayan, Corey Predella, Will Schremmer, Daniel Sium, Alex Wittig, Henry Zheng
Faculty: Irina Gheorghiciuc, Giovanni Leoni, Martin Rapaport, Riley Thornton, Tomasz Tkocz