Number Theory Commons^™

Galoistheory And The Arithmetic-Geometric Series, Daniel Vargas

HMC Senior Theses

Motivated by classical works of Gauss and Euler on the AGM, Ono and his

collaborators Griffin et al. (2023); McSpirit and Ono (2023) have investigated

the union of AGM sequences over finite fields 𝔽𝑞, where 𝑞 ≡3 mod 4. A

recent preprint Kayath et al. (2024) extends some of their results to all finite

fields with odd characteristic. We refine these works when 𝑞≡5 mod 8. In

particular, we explicitly determine the components of these graphs and their

total population. We also use Galois-theoretic results to make progress in

the search for cycles over finite fields with odd characteristic.

Solving Robert Wilson’S 𝑡 ≠ 2 Conjecture On Graham Sequences, Krishna Rajesh

HMC Senior Theses

Ron Graham's sequence is a surprising bijection from the natural numbers to the non-prime integers, which is constructed by looking at sequences whose product is square. In this thesis we will resolve a 22-year-old conjecture about this bijection, by construction of explicit sequences in a modified number theoretic context. Additionally, we will discuss the history of this problem, and give computational techniques for computing this bijection, levering ideas from linear algebra over the finite field of two elements.

A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman

HMC Senior Theses

We can think of a pixel as a particle in three dimensional space, where its x, y and z coordinates correspond to its level of red, green, and blue, respectively. Just as a particle’s motion is guided by physical rules like gravity, we can construct rules to guide a pixel’s motion through color space. We can develop striking visuals by applying these rules, called dynamical systems, onto images using animation engines. This project explores a number of these systems while exposing the underlying algebraic structure of color space. We also build and demonstrate a Visual DJ circuit board for …

Generalized Far-Difference Representations, Prakod Ngamlamai

HMC Senior Theses

Integers are often represented as a base-$b$ representation by the sum $\sum c_ib^i$. Lekkerkerker and Zeckendorf later provided the rules for representing integers as the sum of Fibonacci numbers. Hannah Alpert then introduced the far-difference representation by providing rules for writing an integer with both positive and negative multiples of Fibonacci numbers. Our work aims to generalize her work to a broader family of linear recurrences. To do so, we describe desired properties of the representations, such as lexicographic ordering, and provide a family of algorithms for each linear recurrence that generate unique representations for any integer. We then prove …

Tiling Representations Of Zeckendorf Decompositions, John Lentfer

HMC Senior Theses

Zeckendorf’s theorem states that every positive integer can be decomposed uniquely into a sum of non-consecutive Fibonacci numbers (where f₁ = 1 and f₂ = 2). Previous work by Grabner and Tichy (1990) and Miller and Wang (2012) has found a generalization of Zeckendorf’s theorem to a larger class of recurrent sequences, called Positive Linear Recurrence Sequences (PLRS’s). We apply well-known tiling interpretations of recurrence sequences from Benjamin and Quinn (2003) to PLRS’s. We exploit that tiling interpretation to create a new tiling interpretation specific to PLRS’s that captures the behavior of the generalized Zeckendorf’s theorem.

Adinkras And Arithmetical Graphs, Madeleine Weinstein

HMC Senior Theses

Adinkras and arithmetical graphs have divergent origins. In the spirit of Feynman diagrams, adinkras encode representations of supersymmetry algebras as graphs with additional structures. Arithmetical graphs, on the other hand, arise in algebraic geometry, and give an arithmetical structure to a graph. In this thesis, we will interpret adinkras as arithmetical graphs and see what can be learned.

Our work consists of three main strands. First, we investigate arithmetical structures on the underlying graph of an adinkra in the specific case where the underlying graph is a hypercube. We classify all such arithmetical structures and compute some of the corresponding …

There And Back Again: Elliptic Curves, Modular Forms, And L-Functions, Allison F. Arnold-Roksandich

HMC Senior Theses

L-functions form a connection between elliptic curves and modular forms. The goals of this thesis will be to discuss this connection, and to see similar connections for arithmetic functions.