Physical Sciences and Mathematics Commons^™

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, …

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 …

An Explicit Formula For Dirichlet's L-Function, Shannon Michele Hyder

Honors Theses

The Riemann zeta function has a deep connection to the distribution of primes. In 1911 Landau proved that, an explicit formula where ρ = β + iγ denotes a complex zero of the zeta function and Λ(x) is an extension of the usual von Mangoldt function, so that Λ(x) = log p if x is a positive integral power of a prime p and Λ(x) = 0 for all other real values of x. Landau’s remarkable explicit formula lacks uniformity in x and therefore has limited applications to the theory of the zeta function. In 1993 Gonek proved a version …

A Logistic Regression Analysis Of First-Time College Students’ Completion Rates At The University Of Southern Mississippi, Jesse Homer Robinson

Honors Theses

The demand for employees with a college degree is steadily on the rise in a plethora of competitive job markets throughout the United States. This increase in demand has aided in the increasing college enrollment rates throughout the country. However, unlike enrollment trends, the rate of college completion has not had the same fortunate rise.

The goal of this study is to research and compare differences among those first-time college students who completed college within four years, six years, or did not complete. The primary source for data in this study was the Office of Institutional Research at USM. Both …

Operator Semigroups Induced By First-Order Differential Equations, Amy Adair

Honors Theses

No abstract provided.

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.

Schubert Polynomial Multiplication, Sara Amato

Honors Theses

Schur polynomials are a fundamental object in the field of algebraic combinatorics. The product of two Schur polynomials can be written as a sum of Schur polynomials using non-negative integer coefficients. A simple combinatorial algorithm for generating these coefficients is called the Littlewood-Richardson Rule. Schubert polynomials are generalizations of the Schur polynomials. Schubert polynomials also appear in many contexts, such as in algebraic combinatorics and algebraic geometry. It is known from algebraic geometry that the product of two Schubert polynomials can be written as a sum of Schubert polynomials using non-negative integer coefficients. However, a simple combinatorial algorithm for generating …

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.

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 …

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. …

Launch-Explore-Summarize In High School Calculus, Nate Mattis

Honors Theses

Current research on high school calculus instruction indicates that students often possess a procedural knowledge of differentiation and integration as opposed to a conceptual knowledge (Orton, 1983; Ferrini-Mundy & Graham, 1994). Given the prominence of traditional lecture and textbook-based calculus classes in the United States, students are not always given the opportunity to expand their conceptual knowledge of essential calculus concepts. This project introduces calculus students to a more active and communal method of teaching: Launch-Explore-Summarize (LES) (CMP, n.d.). This methodology places students at the center of their learning and emphasizes inquiry-based thinking during a class. Specifically, two LES lessons …

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.