Other Mathematics Commons^™

The Food Truck: A Multi-Product Newsvendor With Trans-Shipment Cost, Samuel Ajibola

Electronic Theses and Dissertations

The Newsvendor Problem is a key model in supply chain management that focuses on determining the optimal order quantity to minimize costs under uncertain demand. This thesis introduces the Food Truck Problem, an extension of the Newsvendor model that incorporates nonlinear transshipment costs for inventory transportation. In this context, a Food Truck must determine the optimal stock levels for multiple products while minimizing costs related to stock shortages, excess inventory, and transportation. Unlike traditional Newsvendor models, our approach explicitly considers a quadratic transshipment cost, which necessitates the use of Lagrangian duality and Karush-Kuhn-Tucker (KKT) conditions for analysis. Moreover, we apply …

Developing A Comprehensive Cognitive Model Of Math Achievement, Nina Anderson

Electronic Theses and Dissertations

Recently, downward trends have been reported in U.S. children’s math performance following school disruptions during COVID-19 amidst longstanding concerns for instruction and curricula within the subject. In support of efforts to remedy these declines, the current work presents two studies dedicated to identifying cognitive factors that are most strongly related to math performance, and which therefore offer promising potential targets for assessment and intervention. Both studies use data from the Colorado Learning Disabilities Research Center, which includes participants ages 8 - 16 and multiple well-validated measures of all constructs of interest. Study 1 tests three alternative latent cognitive models of …

Combinatorial Problems On The Integers: Colorings, Games, And Permutations, Collier Gaiser

Electronic Theses and Dissertations

This dissertation consists of several combinatorial problems on the integers. These problems fit inside the areas of extremal combinatorics and enumerative combinatorics.

We first study monochromatic solutions to equations when integers are colored with finitely many colors in Chapter 2. By looking at subsets of {1, 2, . . . , n} whose least common multiple is small, we improved a result of Brown and Rödl on the smallest integer n such that every 2-coloring of {1, 2, . . . , n} has a monochromatic solution to equations with unit fractions. Using a recent result of Boza, …

Building Blocks For W-Algebras Of Classical Types, Vladimir Kovalchuk

Electronic Theses and Dissertations

The universal 2-parameter vertex algebra W_∞ of type W(2, 3, 4; . . . ) serves as a classifying object for vertex algebras of type W(2, 3, . . . ,N) for some N in the sense that under mild hypothesis, all such vertex algebras arise as quotients of W_∞. There is an ℕ X ℕ family of such 1-parameter vertex algebras known as Y-algebras. They were introduced by Gaiotto and Rapčák are expected to be building blocks for all W-algebras in type A, i.e, every W-(super) algebra in …

Strategy-Proof Social Choice Functions On Condorcet Domains., Flannery Marie Musk Wells

Electronic Theses and Dissertations

A social choice function is said to be strategy-proof if no voter has any motivation to lie about their true preference. Strategy-proofness is a desirable property of social choice functions so we consider here functions that always satisfy this property. We add to this property the additional desirable conditions of anonymity and neutrality and present domains on which we can get a characterization of majority rule as the only social choice function that satisfies these three properties. Furthermore, we consider what functions look like when we drop the condition of anonymity.

Convolution And Autoencoders Applied To Nonlinear Differential Equations, Noah Borquaye

Electronic Theses and Dissertations

Autoencoders, a type of artificial neural network, have gained recognition by researchers in various fields, especially machine learning due to their vast applications in data representations from inputs. Recently researchers have explored the possibility to extend the application of autoencoders to solve nonlinear differential equations. Algorithms and methods employed in an autoencoder framework include sparse identification of nonlinear dynamics (SINDy), dynamic mode decomposition (DMD), Koopman operator theory and singular value decomposition (SVD). These approaches use matrix multiplication to represent linear transformation. However, machine learning algorithms often use convolution to represent linear transformations. In our work, we modify these approaches to …

Unilinear Residuated Lattices, Xiao Zhuang

Electronic Theses and Dissertations

We characterize all residuated lattices that have height equal to 3 and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint incomparable chains, with bounds added. We give the characterization of all unilinear residuated lattices. By presenting the constructions and axiomatizations for different classes of unilinear residuated lattices, we conclude that the study of unilinear residuated lattices can be reduced to the study of the ⊤-unital ones. Using the classification of unilinear residuated lattices, the idempotent unilinear residuated lattices are studied and amalgamation property and strong …

Local-Global Results On Discrete Structures, Alexander Lewis Stevens

Electronic Theses and Dissertations

Local-global arguments, or those which glean global insights from local information, are central ideas in many areas of mathematics and computer science. For instance, in computer science a greedy algorithm makes locally optimal choices that are guaranteed to be consistent with a globally optimal solution. On the mathematical end, global information on Riemannian manifolds is often implied by (local) curvature lower bounds. Discrete notions of graph curvature have recently emerged, allowing ideas pioneered in Riemannian geometry to be extended to the discrete setting. Bakry- Émery curvature has been one such successful notion of curvature. In this thesis we use combinatorial …

Decisive Neutrality, Restricted Decisive Neutrality, And Split Decisive Neutrality On Median Semilattices And Median Graphs., Ulf Högnäs

Electronic Theses and Dissertations

Consensus functions on finite median semilattices and finite median graphs are studied from an axiomatic point of view. We start with a new axiomatic characterization of majority rule on a large class of median semilattices we call sufficient. A key axiom in this result is the restricted decisive neutrality condition. This condition is a restricted version of the more well-known axiom of decisive neutrality given in [4]. Our theorem is an extension of the main result given in [7]. Another main result is a complete characterization of the class of consensus on a finite median semilattice that satisfies the axioms …

Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang

Electronic Theses and Dissertations

While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …

Constructions & Optimization In Classical Real Analysis Theorems, Abderrahim Elallam

Electronic Theses and Dissertations

This thesis takes a closer look at three fundamental Classical Theorems in Real Analysis. First, for the Bolzano Weierstrass Theorem, we will be interested in constructing a convergent subsequence from a non-convergent bounded sequence. Such a subsequence is guaranteed to exist, but it is often not obvious what it is, e.g., if an = sin n. Next, the H¨older Inequality gives an upper bound, in terms of p ∈ [1,∞], for the the integral of the product of two functions. We will find the value of p that gives the best (smallest) upper-bound, focusing on the Beta and Gamma integrals. …

Exponential Random Graphs And A Generalization Of Parking Functions, Ryan Demuse

Electronic Theses and Dissertations

Random graphs are a powerful tool in the analysis of modern networks. Exponential random graph models provide a framework that allows one to encode desirable subgraph features directly into the probability measure. Using the theory of graph limits pioneered by Borgs et. al. as a foundation, we build upon the work of Chatterjee & Diaconis and Radin & Yin. We add complexity to the previously studied models by considering exponential random graph models with edge-weights coming from a generic distribution satisfying mild assumptions. In particular, we show that a large family of two-parameter, edge-weighted exponential random graphs display a phase …

Decompositions Of The Complete Mixed Graph By Mixed Stars, Chance Culver

Electronic Theses and Dissertations

In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions …

Discrepancy Inequalities In Graphs And Their Applications, Adam Purcilly

Electronic Theses and Dissertations

Spectral graph theory, which is the use of eigenvalues of matrices associated with graphs, is a modern technique that has expanded our understanding of graphs and their structure. A particularly useful tool in spectral graph theory is the Expander Mixing Lemma, also known as the discrepancy inequality, which bounds the edge distribution between two sets based on the spectral gap. More specifically, it states that a small spectral gap of a graph implies that the edge distribution is close to random. This dissertation uses this tool to study two problems in extremal graph theory, then produces similar discrepancy inequalities based …

Hybrid Recommender Systems Via Spectral Learning And A Random Forest, Alyssa Williams

Electronic Theses and Dissertations

We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interpreted as a nearest neighbor network. A hybrid recommender can be constructed by first …

A Study Of Big Field Multivariate Cryptography., Ryann Cartor

Electronic Theses and Dissertations

As the world grapples with the possibility of widespread quantum computing, the cryptosystems of the day need to be up to date. Multivariate Public Key Cryptography is a leading option for security in a post quantum society. One goal of this work is to classify the security of multivariate schemes, especially C*variants. We begin by introducing Multivariate Public Key Cryptography and will then discuss different multivariate schemes and the main types of attacks that have been proven effective against multivariate schemes. Once we have developed an appropriate background, we analyze security of different schemes against particular attacks. Specifically, we …

Roman Domination Cover Rubbling, Nicholas Carney

Electronic Theses and Dissertations

In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of pebbles, so that from any initial configuration of those pebbles on $G$, it is possible to obtain a configuration which is Roman dominating after some sequence of pebbling and rubbling moves. We begin by characterizing graphs $G$ having small $\rho_{R}(G)$ value. Among other things, we also obtain the Roman domination cover rubbling number for paths and give an upper bound for the …

Taking Notes: Generating Twelve-Tone Music With Mathematics, Nathan Molder

Electronic Theses and Dissertations

There has often been a connection between music and mathematics. The world of musical composition is full of combinations of orderings of different musical notes, each of which has different sound quality, length, and em phasis. One of the more intricate composition styles is twelve-tone music, where twelve unique notes (up to octave isomorphism) must be used before they can be repeated. In this thesis, we aim to show multiple ways in which mathematics can be used directly to compose twelve-tone musical scores.

Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates

Electronic Theses and Dissertations

Ever since Shor's algorithm was introduced in 1994, cryptographers have been working to develop cryptosystems that can resist known quantum computer attacks. This push for quantum attack resistant schemes is known as post quantum cryptography. Specifically, my contributions to post quantum cryptography has been to the family of schemes known as Multivariate Public Key Cryptography (MPKC), which is a very attractive candidate for digital signature standardization in the post quantum collective for a wide variety of applications. In this document I will be providing all necessary background to fully understand MPKC and post quantum cryptography as a whole. Then, I …

Developmental Mathematics: A Quantitative Investigation Of Instructor Classification As Related To Student Success, Brittany A. Fish

Electronic Theses and Dissertations

The purpose of this quantitative study was to examine what type of predictive power exists between an instructor’s employment classification, student gender, student race, and first-generation status on a student’s academic success in developmental mathematics, as measured by final semester grades at a regionally comprehensive state university in Texas between fall 2013 and spring 2017. Data were collected from the institution under study and the sample population included 1932 unique student observations. The data collected in this study were analyzed through a binary logistic regression model to determine whether an instructor’s employment classification, student gender, student race, and first-generation status …

Italian Domination In Complementary Prisms, Haley D. Russell

Electronic Theses and Dissertations

Let $G$ be any graph and let $\overline{G}$ be its complement. The complementary prism of $G$ is formed from the disjoint union of a graph $G$ and its complement $\overline{G}$ by adding the edges of a perfect matching between the corresponding vertices of $G$ and $\overline{G}$. An Italian dominating function on a graph $G$ is a function such that $f \, : \, V \to \{ 0,1,2 \}$ and for each vertex $v \in V$ for which $f(v)=0$, it holds that $\sum_{u \in N(v)} f(u) \geq 2$. The weight of an Italian dominating function is the value $f(V)=\sum_{u \in V(G)}f(u)$. …

Theoretical Analysis Of Nonlinear Differential Equations, Emily Jean Weymier

Electronic Theses and Dissertations

Nonlinear differential equations arise as mathematical models of various phenomena. Here, various methods of solving and approximating linear and nonlinear differential equations are examined. Since analytical solutions to nonlinear differential equations are rare and difficult to determine, approximation methods have been developed. Initial and boundary value problems will be discussed. Several linear and nonlinear techniques to approximate or solve the linear or nonlinear problems are demonstrated. Regular and singular perturbation theory and Magnus expansions are our particular focus. Each section offers several examples to show how each technique is implemented along with the use of visuals to demonstrate the accuracy, …

Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., M. Ryan Luke

Electronic Theses and Dissertations

In this dissertation, we will examine residuated mappings on a function lattice and how they behave with respect to the way-below relation. In particular, which residuated $\phi$ has the property that $F$ is way-below $\phi(F)$ for $F$ in appropriate sets. We show the way-below relation describes the separation of two functions and how this corresponds to contraction mappings on probabilistic metric spaces. A new definition for contractions is considered using the way-below relation.

Extending Difference Of Votes Rules On Three Voting Models., Sarah Schulz King

Electronic Theses and Dissertations

In a voting situation where there are only two competing alternatives, simple majority rule outputs the alternatives with the most votes or declares a tie if both alternatives receive the same number of votes. For any non-negative integer k, the difference of votes rule M_k outputs the alternative that beats the competing alternative by more than k votes. Llamazares (2006) gives a characterization of the difference of votes rules in terms of five axioms. In this thesis, we extend Llamazares' result by completely describing the class of voting rules that satisfy only two out of his five axioms. …

Vertex Weighted Spectral Clustering, Mohammad Masum

Electronic Theses and Dissertations

Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to …

Multilevel Models For Longitudinal Data, Aastha Khatiwada

Electronic Theses and Dissertations

Longitudinal data arise when individuals are measured several times during an ob- servation period and thus the data for each individual are not independent. There are several ways of analyzing longitudinal data when different treatments are com- pared. Multilevel models are used to analyze data that are clustered in some way. In this work, multilevel models are used to analyze longitudinal data from a case study. Results from other more commonly used methods are compared to multilevel models. Also, comparison in output between two software, SAS and R, is done. Finally a method consisting of fitting individual models for each …

Newsvendor Models With Monte Carlo Sampling, Ijeoma W. Ekwegh

Electronic Theses and Dissertations

Newsvendor Models with Monte Carlo Sampling by Ijeoma Winifred Ekwegh The newsvendor model is used in solving inventory problems in which demand is random. In this thesis, we will focus on a method of using Monte Carlo sampling to estimate the order quantity that will either maximizes revenue or minimizes cost given that demand is uncertain. Given data, the Monte Carlo approach will be used in sampling data over scenarios and also estimating the probability density function. A bootstrapping process yields an empirical distribution for the order quantity that will maximize the expected profit. Finally, this method will be used …

An Algorithm For The Machine Calculation Of Minimal Paths, Robert Whitinger

Electronic Theses and Dissertations

Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R³, but also to the general case of finding minimal functionals on hypersurfaces in Rⁿ associated with an arbitrary metric.

Neighborhood-Restricted Achromatic Colorings Of Graphs, James D. Chandler Sr.

Electronic Theses and Dissertations

A (closed) neighborhood-restricted 2-achromatic-coloring of a graph G is an assignment of colors to the vertices of G such that no more than two colors are assigned in any closed neighborhood. In other words, for every vertex v in G, the vertex v and its neighbors are in at most two different color classes. The 2-achromatic number is defined as the maximum number of colors in any 2-achromatic-coloring of G. We study the 2-achromatic number. In particular, we improve a known upper bound and characterize the extremal graphs for some other known bounds.

Revised Model For Antibiotic Resistance In A Hospital, Ruhang Pei

Electronic Theses and Dissertations

In this thesis we modify an existing model for the spread of resistant bacteria in a hospital. The existing model does not account for some of the trends seen in the data found in literature. The new model takes some of these trends into account. For the new model, we examine issues relating to identifiability, sensitivity analysis, parameter estimation, uncertainty analysis, and equilibrium stability.