Physical Sciences and Mathematics Commons^™

Explorations In Well-Rounded Lattices, Tanis Nielsen

HMC Senior Theses

Lattices are discrete subgroups of Euclidean spaces. Analogously to vector spaces, they can be described as spans of collections of linearly independent vectors, but with integer (instead of real) coefficients. Lattices have many fascinating geometric properties and numerous applications, and lattice theory is a rich and active field of theoretical work. In this thesis, we present an introduction to the theory of Euclidean lattices, along with an overview of some major unsolved problems, such as sphere packing. We then describe several more specialized topics, including prior work on well-rounded ideal lattices and some preliminary results on the study of planar …

Computational Investigation Of The Ionization Potential Of Lead Sulfide Quantum Dots, Jessica Beyer

Scripps Senior Theses

The purpose of this work was to determine the impact of quantum dot size on ionization potential and to determine how the presence of carbonyl-based ligands affect the ionization potential of lead sulfide quantum dot systems. Ionization potential (IP) is defined as the energy required to remove an electron from an atom, molecule, or material. IP helps scientists determine how reactive the material of interest is, which is crucial information when manufacturing nanomaterials. Accurate quantum chemical calculations of ionization potential are challenging due to the computational cost associated with the numerical solution of the Dyson equation. In this work, the …

Lattice Extensions And Zeros Of Multilinear Polynomials, Maxwell Forst

CGU Theses & Dissertations

We treat several problems related to the existence of lattice extensions preserving certain geometric properties and small-height zeros of various multilinear polynomials. An extension of a Euclidean lattice $L_1$ is a lattice $L_2$ of higher rank containing $L_1$ so that the intersection of $L_2$ with the subspace spanned by $L_1$ is equal to $L_1$. Our first result provides a counting estimate on the number of ways a primitive collection of vectors in a lattice can be extended to a basis for this lattice. Next, we discuss the existence of lattice extensions with controlled determinant, successive minima and covering radius. In …

On Symmetric Operator Ideals And S-Numbers, Daniel Akech Thiong

CGU Theses & Dissertations

Motivated by the well-known theorem of Schauder, we study the relationship between various s-numbers of an operator T and its adjoint T∗ between Banach spaces. For non-compact operator T ∈ L(X, Y ), we do not have a lot of information about the relationship between n-th s-number, sn(T), with sn(T∗ ), however, in chapter 2, by considering X and Y , with lifting and extension properties, respectively, we were able to obtain a relationship between sn(T) with sn(T∗ ) for certain …

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 …

Beginner's Analysis Of Financial Stochastic Process Models, David Garcia

HMC Senior Theses

This thesis explores the use of geometric Brownian motion (GBM) as a financial model for predicting stock prices. The model is first introduced and its assumptions and limitations are discussed. Then, it is shown how to simulate GBM in order to predict stock price values. The performance of the GBM model is then evaluated in two different periods of time to determine whether it's accuracy has changed before and after March 23, 2020.

Multilayer Network Model Of Gender Bias And Homophily In Hierarchical Structures, Emerson Mcmullen

HMC Senior Theses

Although women have made progress in entering positions in academia and
industry, they are still underrepresented at the highest levels of leadership.
Two factors that may contribute to this leaky pipeline are gender bias,
the tendency to treat individuals differently based on the person’s gender
identity, and homophily, the tendency of people to want to be around those
who are similar to themselves. Here, we present a multilayer network model
of gender representation in professional hierarchies that incorporates these
two factors. This model builds on previous work by Clifton et al. (2019), but
the multilayer network framework allows us to …

The Sensitivity Of A Laplacian Family Of Ranking Methods, Claire S. Chang

HMC Senior Theses

Ranking from pairwise comparisons is a particularly rich subset of ranking problems. In this work, we focus on a family of ranking methods for pairwise comparisons which encompasses the well-known Massey, Colley, and Markov methods. We will accomplish two objectives to deepen our understanding of this family. First, we will consider its network diffusion interpretation. Second, we will analyze its sensitivity by studying the "maximal upset" where the direction of an arc between the highest and lowest ranked alternatives is flipped. Through these analyses, we will build intuition to answer the question "What are the characteristics of robust ranking methods?" …

Discrete Analogues Of The Poincaré-Hopf Theorem, Kate Perkins

HMC Senior Theses

My thesis unpacks the relationship between two discrete formulations of the Poincaré-Hopf index theorem. Chapter 1 introduces necessary definitions. Chapter 2 describes the discrete analogs and their differences. Chapter 3 contains a proof that one analog implies the other and chapter 4 contains a proof that the Poincaré-Hopf theorem implies the discrete analogs. Finally, chapter 5 presents still open questions and further research directions.

An Inquiry Into Lorentzian Polynomials, Tomás Aguilar-Fraga

HMC Senior Theses

In combinatorics, it is often desirable to show that a sequence is unimodal. One method of establishing this is by proving the stronger yet easier-to-prove condition of being log-concave, or even ultra-log-concave. In 2019, Petter Brändén and June Huh introduced the concept of Lorentzian polynomials, an exciting new tool which can help show that ultra-log-concavity holds in specific cases. My thesis investigates these Lorentzian polynomials, asking in which situations they are broadly useful. It covers topics such as matroid theory, discrete convexity, and Mason’s conjecture, a long-standing open problem in matroid theory. In addition, we discuss interesting applications to known …

Long Increasing Subsequences, Hannah Friedman

HMC Senior Theses

In my thesis, I investigate long increasing subsequences of permutations from two angles. Motivated by studying interpretations of the longest increasing subsequence statistic across different representations of permutations, we investigate the relationship between reduced words for permutations and their RSK tableaux in Chapter 3. In Chapter 4, we use permutations with long increasing subsequences to construct a basis for the space of 𝑘-local functions.

Permutations, Representations, And Partition Algebras: A Random Walk Through Algebraic Statistics, Ian Shors

HMC Senior Theses

My thesis examines a class of functions on the symmetric group called permutation statistics using tools from representation theory. In 2014, Axel Hultman gave formulas for computing expected values of permutation statistics sampled via random walks. I present analogous formulas for computing variances of these statistics involving Kronecker coefficients – certain numbers that arise in the representation theory of the symmetric group. I also explore deep connections between the study of moments of permutation statistics and the representation theory of the partition algebras, a family of algebras introduced by Paul Martin in 1991. By harnessing these partition algebras, I derive …

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 …

Counting Spanning Trees On Triangular Lattices, Angie Wang

CMC Senior Theses

This thesis focuses on finding spanning tree counts for triangular lattices and other planar graphs comprised of triangular faces. This topic has applications in redistricting: many proposed algorithmic methods for detecting gerrymandering involve spanning trees, and graphs representing states/regions are often triangulated. First, we present and prove Kirchhoff’s Matrix Tree Theorem, a well known formula for computing the number of spanning trees of a multigraph. Then, we use combinatorial methods to find spanning tree counts for chains of triangles and 3 × n triangular lattices (some limiting formulas exist, but they rely on higher level mathematics). For a chain of …

Measuring Racial Segregation In Los Angeles County Using Random Walks, Zarina Kismet Dhillon

CMC Senior Theses

As of now there is no universal quantitative measure used to evaluate racial segregation in different regions. This paper begins by providing a history of segregation, with an emphasis on the impact of redlining in the early 20th century. We move to its effect on the current population distribution in Los Angeles, California, and then provide an overview of the mathematical concepts that have been used in previous measurements of segregation. We then introduce a method that we believe encompasses the most representative aspects of preceding work, proposed by Sousa and Nicosia in their work on quantifying ethnic segregation in …

Partially Filled Latin Squares, Mariam Abu-Adas

Scripps Senior Theses

In this thesis, we analyze various types of Latin squares, their solvability and embeddings. We examine the results by M. Hall, P. Hall, Ryser and Evans first, and apply our understandings to develop an algorithm that the determines the minimum possible embedding of an unsolvable Latin square. We also study Latin squares with missing diagonals in detail.

Algebraic Invariants Of Knot Diagrams On Surfaces, Ryan Martinez

HMC Senior Theses

In this thesis we first give an introduction to knots, knot diagrams, and algebraic structures defined on them accessible to anyone with knowledge of very basic abstract algebra and topology. Of particular interest in this thesis is the quandle which "colors" knot diagrams. Usually, quandles are only used to color knot diagrams in the plane or on a sphere, so this thesis extends quandles to knot diagrams on any surface and begins to classify the fundamental quandles of knot diagrams on the torus.

This thesis also breifly looks into Niebrzydowski Tribrackets which are a different algebraic structure which, in future …

Results On The Generalized Covering Radius Of Error Correcting Codes, Benjamin Langton

HMC Senior Theses

The recently proposed generalized covering radius is a fundamental property of error correcting codes. This quantity characterizes the trade off between time and space complexity of certain algorithms when a code is used in them. However, for the most part very little is known about the generalized covering radius. My thesis seeks to expand on this field in several ways. First, a new upper bound on this quantity is established and compared to previous bounds. Second, this bound is used to derive a new algorithm for finding codewords within the generalized covering radius of a given vector, and also to …

On Coherence And The Geometry Of Certain Families Of Lattices, David Booth Kogan

CGU Theses & Dissertations

The coherence of a lattice is, roughly speaking, a measure of non-orthogonality of its minimal vectors. It was introduced to lattices (by analogy with frame theory) by L. Fukshansky and others as a possible route to gaining insight into packing density, a central problem in lattice theory. In this work, we introduce the related measure of average coherence, explore connections between packing density and coherence, and prove several properties of certain families of lattices, most notably nearly orthogonal lattices, cyclotomic lattices, and cyclic lattices.

On Multiplication Groups Of Quasigroups, Ahmed Al Fares

CGU Theses & Dissertations

Quasigroups are algebraic structures in which divisibility is always defined. In this thesis we investigate quasigroups using a group-theoretic approach. We first construct a family of quasigroups which behave in a group-like fashion. We then focus on the multiplication groups of quasigroups, which have first appeared in the work of A. A. Albert. These permutation groups allow us to study quasigroups using group theory. We also explore how certain natural operations on quasigroups affect the associated multiplication groups. Along the way we take the time and special care to pose specific questions that may lead to further work in the …

Analyzing Marriage Statistics As Recorded In The Journal Of The American Statistical Association From 1889 To 2012, Annalee Soohoo

CMC Senior Theses

The United States has been tracking American marriage statistics since its founding. According to the United States Census Bureau, “marital status and marital history data help federal agencies understand marriage trends, forecast future needs of programs that have spousal benefits, and measure the effects of policies and programs that focus on the well-being of families, including tax policies and financial assistance programs.”[1] With such a wide scope of applications, it is understandable why marriage statistics are so highly studied and well-documented.

This thesis will analyze American marriage patterns over the past 100 years as documented in the Journal of …

On The Polytopal Generalization Of Sperner’S Lemma, Amit Harlev

HMC Senior Theses

We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed point theorem, and then attempt to gain a better understanding of the polytopal generalization of Sperner’s lemma conjectured in Atanassov (1996) and proven in De Loera et al. (2002). After explaining the polytopal generalization and providing examples, we present a new, simpler proof of a slightly weaker result that helps us better understand the result and why it is correct. Some ideas for how to generalize this proof to the complete result are discussed. In the last two chapters we provide a brief introduction to …

Games For One, Games For Two: Computationally Complex Fun For Polynomial-Hierarchical Families, Kye Shi

HMC Senior Theses

In the first half of this thesis, we explore the polynomial-time hierarchy, emphasizing an intuitive perspective that associates decision problems in the polynomial hierarchy to combinatorial games with fixed numbers of turns. Specifically, problems in 𝐏 are thought of as 0-turn games, 𝐍𝐏 as 1-turn “puzzle” games, and in general 𝚺ₖ𝐏 as 𝑘-turn games, in which decision problems answer the binary question, “can the starting player guarantee a win?” We introduce the formalisms of the polynomial hierarchy through this perspective, alongside definitions of 𝑘-turn CIRCUIT SATISFIABILITY games, whose 𝚺ₖ𝐏-completeness is assumed from prior work (we briefly justify this assumption …

An Exploration Of Voting With Partial Orders, Mason Acevedo

HMC Senior Theses

In this thesis, we discuss existing ideas and voting systems in social choice theory. Specifically, we focus on the Kemeny rule and the Borda count. Then, we begin trying to understand generalizations of these voting systems in a setting where voters can submit partial rankings on their ballot, instead of complete rankings.

Interpolating The Riemann Zeta Function In The P-Adics, Rebecca Mamlet

Scripps Senior Theses

In this thesis, we develop the Kubota-Leopoldt Riemann zeta function in the p-adic integers. We follow Neil Koblitz's interpolation of Riemann zeta, using Bernoulli measures and p-adic integrals. The underlying goal is to better understand p-adic expansions and computations. We finish by connecting the Riemann zeta function to L-functions and their p-adic interpolations.

An Exponential Formula For Random Variables Generated By Multiple Brownian Motions, Maximilian Lawrence Baroi

CGU Theses & Dissertations

The frozen operator has been used to develop Dyson-series like representations for random variables generated by classical Brownian motion, Lévy processes and fractional Brownian with Hurst index greater than 1/2.The relationship between the conditional expectation of a random variable (or fractional conditional expectation in the case of fractional Brownian motion)and that variable's Dyson-series like representation is the exponential formula. These results had not yet been extended to either fractional Brownian motion with Hurst index less than 1/2, or d-dimensional Brownian motion. The former is still out of reach, but we hope our review of stochastic integration for fractional Brownian motion …

Mary Eleanor Spear's Importance To The History Of Statistical Visualization, Melanie Williams

CMC Senior Theses

This paper will demonstrate why Mary Eleanor Spear (1897-1986) is an important figure in the history of statistical visualization. She lead an impressive career working in the federal government as a data analyst before "data analyst" became a thing. She wrote and illustrated two comprehensive textbooks which furthered the art of statistical visualization. Her textbooks cover extensive graphing knowledge still valuable to statisticians and viewers today. Most notable of her works is her development of the box plot. In addition to Spear's career and contributions, this paper will also address the lack of female representation in science, technology, engineering, and …

Energy As A Limiting Factor In Neuronal Seizure Control: A Mathematical Model, Sophia E. Epstein

CMC Senior Theses

The majority of seizures are self-limiting. Within a few minutes, the observed neuronal synchrony and deviant dynamics of a tonic-clonic or generalized seizure often terminate. However, a small epilesia partialis continua can occur for years. The mechanisms that regulate subcortical activity of neuronal firing and seizure control are poorly understood. Published studies, however, through PET scans, ketogenic treatments, and in vivo mouse experiments, observe hypermetabolism followed by metabolic suppression. These observations indicate that energy can play a key role in mediating seizure dynamics. In this research, I seek to explore this hypothesis and propose a mathematical framework to model how …

On Rank-Two And Affine Cluster Algebras, Feiyang Lin

HMC Senior Theses

Motivated by existing results about the Kronecker cluster algebra, this thesis is concerned with two families of cluster algebras, which are two different ways of generalizing the Kronecker case: rank-two cluster algebras, and cluster algebras of type A_n,1. Regarding rank-two cluster algebras, our main result is a conjectural bijection that would prove the equivalence of two combinatorial formulas for cluster variables of rank-two skew-symmetric cluster algebras. We identify a technical result that implies the bijection and make partial progress towards its proof. We then shift gears to study certain power series which arise as limits of ratios of …

Radial Singular Solutions To Semilinear Partial Differential Equations, Marcelo A. Almora Rios

HMC Senior Theses

We show the existence of countably many non-degenerate continua of singular radial solutions to a p-subcritical, p-Laplacian Dirichlet problem on the unit ball in R^N. This result generalizes those for the 2-Laplacian to any value p and extends recent work on the p-Laplacian by considering solutions both radial and singular.