Physical Sciences and Mathematics Commons^™

Aging An Ancient Maya Population From Actuncan, Belize Using Dental X-Rays, Kaitlyn Nicole Cash

Honors Theses

My goal is to determine an accurate age at death estimation of an ancient Maya population from the archaeological site of Actuncan, Belize. This was done by measuring the lengths of the coronal pulp cavities in the individuals’ teeth. I used X-Ray images to measure the coronal pulp cavities of the teeth and estimated age using multiple regression formulae for premolars, molars, and incisors to make age estimations. The formulae came from two studies, Ikeda et al. (1985) and Drusini (2008), that form the basis of my research. Ikeda et al. (1985) was the first to use this aging method, …

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 …

Relative Energy Comparison For Various Water Clusters Using Mp2, Df-Mp2, And Ccsd(T):Mp2 Methods, Qihang Wang

Honors Theses

The study of water clusters is an important area of research in many disciplines, such as biology, physical chemistry, and environmental studies. However, due to the difficulty in studying larger water clusters, such as clathrate hydrates, it is beneficial to obtain accurate descriptions of smaller water clusters to use as models for larger systems via computational methods. By starting with small water clusters, such as (H2O)₆, and moving into larger systems it is possible to build up data on various water structures that can determine the energetics of the various geometries within a certain number of water molecules. …

A Weighted Version Of Erdős-Kac Theorem, Unique Subedi

Honors Theses

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. A celebrated result of Erd{\H o}s and Kac states that $\omega(n)$ as a Gaussian distribution. In this thesis, we establish a weighted version of Erd{\H o}s-Kac Theorem. Specifically, we show that the Gaussian limiting distribution is preserved, but shifted, when $\omega(n)$ is weighted by the $k-$fold divisor function $\tau_k(n)$. We establish this result by computing all positive integral moments of $\omega(n)$ weighted by $\tau_k(n)$.

We also provide a proof of the classical identity of $\zeta(2n)$ for $n \in \mathbb{N}$ using Dirichlet's kernel.

United States Suicide Analysis: 1999-2016, Malynn Clark

Honors Theses

The purpose of this thesis is to create information visualizations surrounding suicide trends from 1999-2016 in the United States. The original data was obtained from the Centers for Disease Control and Prevention’s Compressed Mortality Database. This database permits users to download several fields of information regarding deaths for the years given. Using this information, many graphs below show trends and patterns for suicide. One notable trend includes the higher proportion of male to female suicides for all categories explored including: age group, race, and metro/nonmetro status. The goal is to bring awareness and understanding surrounding the suicide epidemic in the …

Portfolio Optimization Methods: The Mean-Variance Approach And The Bayesian Approach, Hoang Nguyen

Honors Theses

This thesis is a discussion on the mean-variance approach to portfolio optimization and an introduction of the Bayesian approach, which is designed to solve certain limitations of the classical mean-variance analysis. The primary goal of portfolio optimization is to achieve the maximum return from investment given a certain level of risk. The mean-variance approach, introduced by Harry Markowitz, sought to solve this optimization problem by analyzing the means and variances of a certain collection of stocks. However, due to its simplicity, the mean-variance approach is subject to various limitations. In this paper, we seek to solve some of these limitations …

#Whyididntreport: Using Social Media As A Tool To Understand Why Sexual Assault Victims Do Not Report, Abby Garrett

Honors Theses

Sexual assault has gone largely under-reported, and social media movements, like #WhyIDidntReport, have brought great awareness to this issue. In order to take advantage of the large amounts of data the #WhyIDidntReport movement has generated, the study uses tweets to explore reasons why victims do not report their assault. The thesis cites current research on the topic of assault to generate a list of explanations victims use to describe their lack of reporting and compares the distributions with existing studies. We use a supervised learning technique to automatically categorize tweets into one of eight categories. This approach uses social sensing …

6th-12th Grade Math Teachers And Their Experiences With The Mississippi College- And Career-Readiness Standards, Dorothy Reid

Honors Theses

This thesis identifies and describes 6th-12th grade math teachers and their experiences with the Mississippi College- and Career- Readiness Standards. There are two parts to this thesis: 1) a survey distributed to public school math teachers across the state and 2) the written thesis. In my thesis, I craft teacher narratives from the quantitative and qualitative results of the survey. Listening to the teachers’ narratives provides beneficial insights to the implementation of the MCCRS at the classroom level. Teachers have many different experiences. My thesis offers policy recommendations, based on the teacher narratives, to three levels of education: teachers, schools …

On A Generalization Of Lucas Numbers, Skylyn Olyvia Irby

Honors Theses

In this paper, we consider a generalization of Lucas numbers. Recall that Lucas numbers are the sequence of integers defined by the recurrence relation: L_n = L_{n−1} + L_{n−2} with the initial conditions L_1 = 1 and L_2 = 3(or L_0 = 1 and L_1 = 3 if the first subscript is zero). That is, the classical Lucas number sequence is 1, 3, 4, 7, 11, 18, .... The goal of the present paper is to study properties of certain generalizations of the Lucas sequence. In particular, we consider the following generalizations of the sequence: l_n = al_{n−1} + l_{n−2} …

Scheduling Problems, Aamir Kudai

Honors Theses

Manufacturing industry is growing exponentially. The need of using algorithms and computational techniques to enhance processes is increasing every day. Algorithms help us solve almost all kind of computational problems. Not only choosing the right algorithm for a problem is important but also optimizing its time and space efficiency is crucial. BorgWarner Transmission Systems located in Water Valley, Mississippi is one among the leading manufacturing companies. This paper will demonstrate a real-world audit scheduling problem happened at BorgWarner and the techniques used to solve it. A gentle introduction to some of the heuristic algorithms such as Genetic algorithm, Randomized algorithm, …

Automating The Calculation Of Hilbert-Kunz Multiplicities And F-Signatures, Gabriel Johnson

Honors Theses

We describe an application written to automate a calculation for the mathematical research of Dr. Spiroff of University of Mississippi & Dr. Enescu of Georgia State University. This work represents a way to overcome the barriers of the mathematical calculations in obtaining theoretical results.

The Largest Bond In 3-Connected Graphs, Melissa Flynn

Honors Theses

A graph G is connected if given any two vertices, there is a path between them. A bond B is a minimal edge set in G such that G − B has more components than G. We say that a connected graph is dual Hamiltonian if its largest bond has size |E(G)|−|V (G)|+2. In this thesis we verify the conjecture that any simple 3-connected graph G has a largest bond with size at least Ω(nlog32) (Ding, Dziobiak, Wu, 2015 [3]) for a variety of graph classes including planar graphs, complete graphs, ladders, Mo ̈bius ladders and circular ladders, complete bipartite …

A Study Of Conductance For A Random, Hierarchically-Structured Material, Daniel Salvador

Honors Theses

I consider a mathematical model for the conductance of a system formed by a hi- erarchical network of random bonds. My simulations show that the net conductance converges to a fixed number γ ≈ 0.35337 when the conductances of the bonds are num- bers selected uniformly at random from the interval (0,1). By linearly approximating the model around γ, I derive a new simplified model which I then study in rigorous mathematical detail. I prove a generalized central limit theorem for the new linearized system.

Independence Polynomials And Extended Vertex Reduction, Jonathan Broom

Honors Theses

The independence polynomial of a graph is a polynomial whose coefficients number the independent sets of each size in that graph. This paper looks into methods of obtaining these polynomials for certain classes of graphs which prove too large to easily find the polynomial by traditional methods.

The Matrix Method Of Linear Dichroism, Kenna Collums

Honors Theses

This thesis discusses linear dichroism, and in particular the matrix method behind the spectroscopic technique. Linear dichroism uses the difference in the absorption of light that is parallel to the orientation axis and the absorption of light that is perpendicular to the orientation axis. From this process, the structure and function of molecules can be studied. The matrix method diagonalizes a Hamiltonian matrix with a unitary matrix. This Hamiltonian matrix is constructed from the transition energies, which are the diagonal elements, and coupling energies, which are off-diagonal elements.

The Tutte Polynomial Formula For The Class Of Twisted Wheel Graphs, Amanda Hall

Honors Theses

The 20th century work of William T. Tutte developed a graph polynomial that is modernly known as the Tutte polynomial. Graph polynomials, such as the Tutte polynomial, the chromatic polynomial, and the Jones polynomial, are at the heart of combinatorical and algebraic graph theory and can be used as tools with which to study graph invariants. Graph invariants, such as order, degree, size, and connectivity which are defined in Section 2, are graph properties preserved under all isomorphisms of a graph. Thus any graph polynomial is not dependent upon a particular labeling or drawing but presents relevant information about the …