Physical Sciences and Mathematics Commons^™

An Application Of The Pagerank Algorithm To Ncaa Football Team Rankings, Morgan Majors

Honors Theses

We investigate the use of Google’s PageRank algorithm to rank sports teams. The PageRank algorithm is used in web searches to return a list of the websites that are of most interest to the user. The structure of the NCAA FBS football schedule is used to construct a network with a similar structure to the world wide web. Parallels are drawn between pages that are linked in the world wide web with the results of a contest between two sports teams. The teams under consideration here are the members of the 2021 Football Bowl Subdivision. We achieve a total ordering …

The Hilbert Sequence And Its Associated Jacobi Matrix, Caleb Beckler

Honors Theses

In this project, we investigate positive definite sequences and their associated Jacobi matrices in Hilbert space. We set out to determine the Jacobi matrix associated to the Hilbert sequence by methods described in Akhiezer’s book The Classical Moment Problem. Using methods in Teschl’s book Jacobi Operators and Completely Integrable Nonlinear Lattice, we determine the essential spectrum of the corresponding Jacobi matrix.

Elliptic Curves Over Finite Fields, Christopher S. Calger

Honors Theses

The goal of this thesis is to give an expository report on elliptic curves over finite fields. We begin by giving an overview of the necessary background in algebraic geometry to understand the definition of an elliptic curve. We then explore the general theory of elliptic curves over arbitrary fields, such as the group structure, isogenies, and the endomorphism ring. We then study elliptic curves over finite fields. We focus on the number of F_q-rational solutions, Tate modules, supersingular curves, and applications to elliptic curves over Q. In particular, we approach the topic largely through the use …

Application Of Linear Algebra Within The High School Curriculum: Designing Activities To Stimulate An Interest In Upper-Level Math, Shelby Castle

Honors Theses

This senior project outlines potential lecture activities for a guest speaker or teacher in a high school classroom to present interesting applications of linear algebra. These applications are meant to be pertinent to things students at this age level are already learning or are interested in. The activities are designed such that the ideas of upper-level math are introduced in a very guided and non-intense way. The intent of the activities is mostly applications and interesting results rather than mathematical lecturing or instruction.

The high school level courses explored in this project are chemistry, economics, and health/physical education. For these …

A Contraction Based Approach To Tensor Isomorphism, Anh Kieu

Honors Theses

Tensor isomorphism is a hard problem in computational complexity theory. Tensor isomorphism arises not just in mathematics, but also in other applied fields like Machine Learning, Cryptography, and Quantum Information Theory (QIT). In this thesis, we develop a new approach to testing (non)-isomorphism of tensors that uses local information from "contractions" of a tensor to detect differences in global structures. Specifically, we use projective geometry and tensor contractions to create a labelling data structure for a given tensor, which can be used to compare and distinguish tensors. This contraction labelling isomorphism test is quite general, and its practical potential remains …

Representation Theory And Its Applications In Physics, Jakub Bystrický

Honors Theses

Representation theory is a branch of mathematics that allows us to represent elements of a group as elements of a general linear group of a chosen vector space by means of a homomorphism. The group elements are mapped to linear operators and we can study the group using linear algebra. This ability is especially useful in physics where much of the theories are captured by linear algebra structures. This thesis reviews key concepts in representation theory of both finite and infinite groups. In the case of finite groups we discuss equivalence, orthogonality, characters, and group algebras. We discuss the importance …

Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa

Honors Theses

In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …

Counting Conjugacy Classes Of Elements Of Finite Order In Compact Exceptional Groups, Qidong He

Honors Theses

Given a compact exceptional group $G$ and $m,s\in\mathbb{N}$, let $N(G,m)$ be the number of conjugacy classes of elements of order $m$ in $G$, and $N(G,m,s)$ the number of such classes whose elements have $s$ distinct eigenvalues. In string theory, the problem of enumerating certain classes of vacua in the string landscape can be rephrased in terms of the study of these quantities. We develop unified combinatorial algorithms based on Burnside's Lemma that can be used to compute both quantities for each of the five compact exceptional groups. Thus, we provide a combinatorial, alternative method to that of Djoković and extend …

Singular Value Decomposition, Krystal Bonaccorso, Andrew Incognito

Honors Theses

A well-known theorem is Diagonalization, where one of the factors is a diagonal matrix. In this paper we will be describing a similar way to factor/decompose a non-square matrix. The key to both of these ways to factor is eigenvalues and eigenvectors.

Classification Of Torsion Subgroups For Mordell Curves, Zachary Porat

Honors Theses

Elliptic curves are an interesting area of study in mathematics, laying at the intersection of algebra, geometry, and number theory. They are a powerful tool, having applications in everything from Andrew Wiles’ proof of Fermat’s Last Theorem to cybersecurity. In this paper, we first provide an introduction to elliptic curves by discussing their geometry and associated group structure. We then narrow our focus, further investigating the torsion subgroups of elliptic curves. In particular, we will examine two methods used to classify these subgroups. We finish by employing these methods to categorize the torsion subgroups for a specific family of elliptic …

Category Theory And Universal Property, Niuniu Zhang

Honors Theses

Category theory unifies and formalizes the mathematical structure and concepts in a way that various areas of interest can be connected. For example, many have learned about the sets and its functions, the vector spaces and its linear transformation, and the group theories and its group homomorphism. Not to mention the similarity of structure in topological spaces, as the continuous function is its mapping. In sum, category theory represents the abstractions of other mathematical concepts. Hence, one could use category theory as a new language to define and simplify the existing mathematical concepts as the universal properties. The goal of …

Basis Reduction In Lattice Cryptography, Raj Kane

Honors Theses

We develop an understanding of lattices and their use in cryptography. We examine how reducing lattice bases can yield solutions to the Shortest Vector Problem and the Closest Vector Problem.

Positivity Among P-Partition Generating Functions Of Partially Ordered Sets, Nate Lesnevich

Honors Theses

We find necessary and separate sufficient conditions for the difference between two labeled partially ordered set's (poset) partition generating functions to be positive in the fundamental basis. We define the notion of a jump sequence for a poset and show how different conditions on the jump sequences of two posets are necessary for those posets to have an order relation in the fundamental basis. Our sufficient conditions are of two types. First, we show how manipulating a poset's Hasse diagram produces a poset that is greater according to the fundamental basis. Secondly, we also provide tools to explain posets that …

Galois Theory And The Quintic Equation, Yunye Jiang

Honors Theses

Most students know the quadratic formula for the solution of the general quadratic polynomial in terms of its coefficients. There are also similar formulas for solutions of the general cubic and quartic polynomials. In these three cases, the roots can be expressed in terms of the coefficients using only basic algebra and radicals. We then say that the general quadratic, cubic, and quartic polynomials are solvable by radicals. The question then becomes: Is the general quintic polynomial solvable by radicals? Abel was the first to prove that it is not. In turn, Galois provided a general method of determining when …

Introduction To Computational Topology Using Simplicial Persistent Homology, Jason Turner, Brenda Johnson, Ellen Gasparovic

Honors Theses

The human mind has a natural talent for finding patterns and shapes in nature where there are none, such as constellations among the stars. Persistent homology serves as a mathematical tool for accomplishing the same task in a more formal setting, taking in a cloud of individual points and assembling them into a coherent continuous image. We present an introduction to computational topology as well as persistent homology, and use them to analyze configurations of BuckyBalls®, small magnetic balls commonly used as desk toys.

Extensions Of The Morse-Hedlund Theorem, Eben Blaisdell

Honors Theses

Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example "...ababababab...". The Morse-Hedlund theorem says that a bi-infinite word f repeats itself, in at most n letters, if and only if the number of distinct subwords of length n is at most n. Using the example, "...ababababab...", there are 2 subwords of length 3, namely "aba" and "bab". Since 2 is less than 3, we must have that "...ababababab..." repeats itself after at most 3 letters. In fact it does repeat itself every two letters. …

Parametric Polynomials For Small Galois Groups, Claire Huang

Honors Theses

Galois theory, named after French mathematician Evariste Galois in 19th-century, is an important part of abstract algebra. It brings together many different branches of mathematics by providing connections among fields, polynomials, and groups.

Specifically, Galois theory allows us to attach a finite field extension with a finite group. We call such a group the Galois group of the finite field extension. A typical way to attain a finite field extension to compute the splitting field of some polynomial. So we can always start with a polynomial and find the finite group associate to the field extension on its splitting field. …

On Spectral Theorem, Muyuan Zhang

Honors Theses

There are many instances where the theory of eigenvalues and eigenvectors has its applications. However, Matrix theory, which usually deals with vector spaces with finite dimensions, also has its constraints. Spectral theory, on the other hand, generalizes the ideas of eigenvalues and eigenvectors and applies them to vector spaces with arbitrary dimensions. In the following chapters, we will learn the basics of spectral theory and in particular, we will focus on one of the most important theorems in spectral theory, namely the spectral theorem. There are many different formulations of the spectral theorem and they convey the "same" idea. In …

Algebraic Number Theory And Simplest Cubic Fields, Jianing Yang

Honors Theses

The motivation behind this paper lies in understanding the meaning of integrality in general number fields. I present some important definitions and results in algebraic number theory, as well as theorems and their proofs on cyclic cubic fields. In particular, I discuss my understanding of Daniel Shanks' paper on the simplest cubic fields and their class numbers.

The Central Hankel Transform, Matthew J. Levine

Honors Theses

This honors thesis presents the Hankel transform on an integer sequence, a function with colorful mathematical history and rich theoretical background. We then introduce a matricial Toeplitz transform that parallels some of most famous qualities of the Hankel transform, especially when in consideration of popular sequences like the Fibonacci numbers. The result is a characterization of the injectivity of this new function, a description of some of its interesting behaviors, and a discussion of a few new Fibonacci identities.

An Algebraic Approach To Number Theory Using Unique Factorization, Mark Sullivan

Honors Theses

Though it may seem non-intuitive, abstract algebra is often useful in the study of number theory. In this thesis, we explore some uses of abstract algebra to prove number theoretic statements. We begin by examining the structure of unique factorization domains in general. Then we introduce number fields and their rings of algebraic integers, whose structures have characteristics that are analogous to some of those of the rational numbers and the rational integers. Next we discuss quadratic fields, a special case of number fields that have important applications to number theoretic problems. We will use the structures that we introduce …

Odd Or Even: Uncovering Parity Of Rank In A Family Of Rational Elliptic Curves, Anika Lindemann

Honors Theses

Puzzled by equations in multiple variables for centuries, mathematicians have made relatively few strides in solving these seemingly friendly, but unruly beasts. Currently, there is no systematic method for finding all rational values, that satisfy any equation with degree higher than a quadratic. This is bizarre. Solving these has preoccupied great minds since before the formal notion of an equation existed. Before any sort of mathematical formality, these questions were nested in plucky riddles and folded into folk tales. Because they are so simple to state, these equations are accessible to a very general audience. Yet an astounding amount of …

Factorization Of Primes Primes Primes: Elements Ideals And In Extensions, Peter J. Bonventre

Honors Theses

It is often taken it for granted that all positive whole numbers except 0 and 1 can be factored uniquely into primes. However, if K is a finite extension of the rational numbers, and OK its ring of integers, it is not always the case that non-zero, non-unit elements of OK factor uniquely. We do find, though, that the proper ideals of OK do always factor uniquely into prime ideals. This result allows us to extend many properties of the integers to these rings. If we a finite extension L of K and OL of OK , we find that …

Groups, Janie Ferguson

Honors Theses

This paper explores abstract algebra groups.