The Northfield Undergraduate Mathematics Symposium (NUMS) is an annual event sponsored jointly by Carleton and St. Olaf. In 2024, eleven students spoke at the symposium on research they did around the country over the summer.
Exploring Social Bias in Downstream Applications of Text-to-Image Foundation Models
Barry Han (Carleton)
Ideals Preserved by Changes of Coordinates in Positive Characteristic
Akash Ganguly (Carleton)

We consider the polynomial ring in finitely many variables over an algebraically closed field of positive characteristic, and initiate the systematic study of ideals preserved by the action of the general linear group by changes of coordinates. We show that these ideals are classified by sets of carry patterns, which are finite sequences of integers introduced by Doty in the study of representation theory of the polynomial ring. We provide an algorithm to decompose an invariant ideal as a sum of carry ideals with no redundancies. Next, we study the conditions under which one carry ideal is contained in another, and completely characterize the image of the multiplication map between the space of linear forms and a subrepresentation of forms of degree d. Finally, we begin an investigation into free resolutions of these ideals. Our results are most explicit in the case of carry ideals in two variables, where we completely describe the monomial generators and syzygies using base-p expansions of the parameters involved.
A New Graph Move on Higher Rank Graphs that Preserves the Morita Equivalence of C*-Algebras
Mackenzie Amann and Liam Gallagher (St. Olaf)
A higher rank graph, also known as a k-graph, is a higher dimensional generalization of a directed graph. That is, a k-graph is a network of points and arrows going between those points. Higher rank graphs are a combinatorial aid to the study of C*-algebras, which are groups whose structure is informed by the structure of the k-graph. Many mathematicians have studied how changes to a k-graph affect the properties of the k-graph and its associated C*-algebra.
In this presentation, we introduce a new move on k-graphs which we call LiMaR-split. We prove that, when performing LiMaR-split, the resulting graph is a k-graph and its C*-algebra is equivalent, in a certain sense, to the C*-algebra of the original k-graph.
Narrative Analysis of True Crime Podcasts with Knowledge Graph-Augmented Large Language Models
Cynthia Leng (Carleton)

Narrative data spans all disciplines and provides a coherent model of the world to the reader or viewer. Recent advancement in machine learning and Large Language Models (LLMs) have enabled great strides in analyzing natural language. However, Large language Models (LLMs) still struggle with complex narrative arcs as well as narratives containing conflicting information. Recent work indicates LLMs augmented with external knowledge bases can improve the accuracy and interpretability of the resulting models. In this work, we analyze the effectiveness of applying knowledge graphs (KGs) in understanding true-crime podcast data from both classical Natural Language Processing (NLP) and LLM approaches. We directly compare KG-augmented LLMs (KGLLMs) with classical methods for KG construction, topic modeling, and sentiment analysis. Additionally, the KGLLM allows us to query the knowledge base in natural language and test its ability to factually answer questions. We examine the robustness of the model to adversarial prompting in order to test the model’s ability to deal with conflicting information. Finally, we apply classical methods to understand more subtle aspects of the text such as the use of hearsay and sentiment in narrative construction and propose future directions. Our results indicate that KGLLMs outperform LLMs on a variety of metrics, are more robust to adversarial prompts, and are more capable of summarizing the text into topics.
Infinite Free Resolutions of Numerical Semigroup Algebras
Nzingha Joseph (Carleton)

A numerical semigroup (cofinite subsemigroup of Z≥ 0 has an associated finite poset, the Kunz poset, which encodes much of its additive structure. Recent work has shown that numerical semigroups with the same Kunz poset have semigroup algebras with similar infinite free resolutions of the base field. We expand on this by investigating such infinite free resolutions for numerical semigroups generated by generalized arithmetic progressions. We provide a combinatorial construction, using pattern-avoiding words, for a minimal free resolution of the base field K over the semigroup algebra K[S]. We also conjecture minimal resolutions when S has smallest positive element 5 or 6. This presentation is based on research conducted at the University of Minnesota Algebra and Combinatorics REU under the supervision of Professor Christopher O’Neill (San Diego State University).
Alternating Harmonic Series Grouped by Fibonacci and Triangular Numbers
Matthew Blake (St. Olaf)
In recent work, several authors explored reordering the Alternating Harmonic Series, rearranging the terms into blocks whose sizes are given by the Fibonacci numbers. In this talk, we modify their approach in two ways: by replacing the Fibonacci numbers with the triangular numbers, and by removing their parity restriction on the sign of each term; we thus create three new series. We analyze convergence and boundedness across all four series, finding that while the original diverges but is bounded, two of the new series converge, while the final series diverges without bound. Finally, inspired by the Riemann zeta function, we consider a new family of series by exponentiating every blocked term by a positive power s. We analyze properties of these generalized series, including convergence and boundedness, and, using RStudio, compute approximating formulae for these general sums.
Stochastic Simulation and Finite State Projection Algorithms for Viral Infections
Elena Parkerson (Carleton)
Prochlorococcus is the most abundant cyanobacterium on Earth, with an estimated 3×10^27 cells distributed across the global surface ocean. Despite its small cell size and minimal genome, Prochlorococcus persists in a multitude of diverse environments due to high levels of intergeneric genetic diversity. Horizontal gene transfer (HGT) is an important process in maintaining high diversity and information flow between cells. Viruses come to share host genes between cells through viral mispackaging, which occurs during infection when empty capsids are filled with the host cell’s DNA instead of the virus’ own DNA. Laurenceau et al. showed that for T7-like viruses of Prochlorococcus, mispackaging rates increased with light intensity due to increased rates of protein synthesis relative to DNA replication.
We constructed a Master Equation to describe how the probability of an infected Prochlorococcus cell being in a given state evolves over time. We simulated infections of a T7-like Podovirus and a T4-like Myovirus within a Prochlorococcus cell in direct accordance with the Master Equation, using the Stochastic Simulation Algorithm (SSA). In addition, we made progress on approximating an exact solution to the Master Equation using the Finite State Projection algorithm (FSP). We found that in Podovirus infections there is a strong relationship between light intensity and mispackaging rate, whereas Myovirus infections do not show such a relationship. Our simulation showed that mispackaging rates for Podovirus tend to be highest at the lower latitudes, consistent with trends in cyanophage population structure predicted by Carlson et al. This suggests that rates of HGT via transduction may be higher at lower latitudes, where Prochlorococcus populations and mispackaging rates are both increased relative to higher latitudes.
Constructing Balanced Walls in Random Groups
Yang Tan and Nhi Luong (Carleton)
The study of random groups is one way to understand ‘typical’ behavior in groups. Gromov random groups are defined by a density parameter 0<d<1 controlling the size of a relator set for the group. Existing work has shown that random groups are cubulated, i.e. they act geometrically on a CAT(0) cube complex, when d<1/6 or d<3/14 they are ‘almost’ cubulated, and for d>1/3 they are not cubulated. The first two results involved constructing walls in the Cayley complex of the group. Montee described an algorithm to construct these walls and conjectured that it works for d<1/4. We disprove that conjecture, and propose a revised construction method. We also present initial work proving that this new construction works for d<7/32.
Morsels of Mandelbrots
Murali Meyer (St. Olaf)
In this project, the main object of focus was the Mandelbrot set, a well-known fractal that is generated by a fairly simple complex function. In recent years, other more complicated complex function families have been found to produce homeomorphic copies of the Mandelbrot set. We continued to explore one of these rational function families of the form f(z) = z^n + a/(z^d) + c, where z is a complex number, c is a fixed real number, n and d are positive integers, and a is a complex valued parameter. For c between 0 and -1 and n and d at least 3, but not both 3, we were able to locate and prove the existence of a single homeomorphic copy of the Mandelbrot set, lying along the positive real axis.