Mathematics Commons^™

The Future Is Now In Twisted Coil Polymer Actuators (Tcpa), Ryan Ronquillo

Electronic Theses and Dissertations

This thesis aimed to fabricate and test twisted coiled polymer actuators (TCPA) to understand the mechanical and thermal aspects of this artificial muscle fiber. The purpose of this thesis was to find a linear relationship using the LVDT sensor, fabricating TCPA fibers, and interpreting the data. The project tested whether nylon/polymer could be used as a better artificial muscle fiber.

This research accomplished three goals: (1) designing and fabricating a system capable of creating supercoiled muscle fibers consistently, (2) calibrating the Linear Variable Differential Transformer (LVDT) and Core, and (3) analyzing/interpreting the data of the Twisted Coiled Polymer Actuators (TCPA) …

Roots Of Quaternionic Polynomials And Automorphisms Of Roots, Olalekan Ogunmefun

Electronic Theses and Dissertations

The quaternions are an extension of the complex numbers which were first described by Sir William Rowan Hamilton in 1843. In his description, he gave the equation of the multiplication of the imaginary component similar to that of complex numbers. Many mathematicians have studied the zeros of quaternionic polynomials. Prominent of these, Ivan Niven pioneered a root-finding algorithm in 1941, Gentili and Struppa proved the Fundamental Theorem of Algebra (FTA) for quaternions in 2007. This thesis finds the zeros of quaternionic polynomials using the Fundamental Theorem of Algebra. There are isolated zeros and spheres of zeros. In this thesis, we …

Enestr¨Om-Kakeya Type Results For Complex And Quaternionic Polynomials, Matthew Gladin

Electronic Theses and Dissertations

The well known Eneström-Kakeya Theorem states that: for P(z)=∑_i=0ⁿ a_i zⁱ, a polynomial of degree n with real coefficients satisfying 0 ≤ a₀ ≤ a₁ ≤ ⋯≤ a_n, all zeros of P(z) lie in |z|≤1 in the complex plane. In this thesis, we will find inner and outer bounds in which the zeros of complex and quaternionic polynomials lie. We will do this by imposing restrictions on the real and imaginary parts, and on the moduli, of the complex and quaternionic coefficients. We also apply similar restrictions on complex polynomials with …

A Study Of The Local Deep Galerkin Method For The Modified Cahn Hilliard Equation, Shi Wen Wong

Electronic Theses and Dissertations

Solving higher order partial differential equations (PDEs) can often prove to be a challenging task due to the involvement of higher-order derivatives of the unknown function, particularly for complex problems. The higher the order of the PDE, the more challenging it becomes to obtain an analytical solution. In such cases, alternative numerical methods are often used, such as finite element method or finite difference method. However, these methods can be computationally expensive and require a significant amount of mathematical expertise to implement. In recent times, there has been significant progress in applying neural networks to various fields, including the solution …

Some 2-Color Rado Numbers For A Linear Equation With A Negative Constant, Rachel Bergjord

Electronic Theses and Dissertations

An r-coloring is a function Δ that assigns a color to each natural number from 1 to some number n using colors 0, 1, . . . , r − 1. A monochromatic solution (in Δ) to an equation L with m variables is an ordered m-tuple (x1, x2, . . . , xm) where Δ(x1) = Δ(x2) = · · · = Δ(xm) and (x1, x2, . . . , xm−1, xm) solves L. Given a linear equation L and t ∈ N, the t-color Rado number for L is the least integer n (if it exists) such that …

The On-Line Width Of Various Classes Of Posets., Israel R. Curbelo

Electronic Theses and Dissertations

An on-line chain partitioning algorithm receives a poset, one element at a time, and irrevocably assigns the element to one of the chains. Over 30 years ago, Szemer\'edi proved that any on-line algorithm could be forced to use $\binom{w+1}{2}$ chains to partition a poset of width $w$. The maximum number of chains that can be forced on any on-line algorithm remains unknown. In the survey paper by Bosek et al., variants of the problem were studied where the class is restricted to posets of bounded dimension or where the poset is presented via a realizer of size $d$. We prove …

Properties And Classifications Of Certain Lcd Codes., Dalton Seth Gannon

Electronic Theses and Dissertations

A linear code $C$ is called a linear complementary dual code (LCD code) if $C \cap C^\perp = {0}$ holds. LCD codes have many applications in cryptography, communication systems, data storage, and quantum coding theory. In this dissertation we show that a necessary and sufficient condition for a cyclic code $C$ over $\Z_4$ of odd length to be an LCD code is that $C=\big( f(x) \big)$ where $f$ is a self-reciprocal polynomial in $\Z_{4}[X]$ which is also in our paper \cite{GK1}. We then extend this result and provide a necessary and sufficient condition for a cyclic code $C$ of length …

The Impact Of Sea-Level Rise In Numerically Modeled Landfalling Hurricanes: Katrina And The Gulf Coast., Serenity Nadirah Mercuri

Electronic Theses and Dissertations

With climate change, landfalling hurricanes become an increasing threat to coastal regions. However, the interactions between the coastal landscape and landfalling hurricanes are often overlooked when addressing sea-level rise outside of inundation and independent of sea surface temperature. This study analyzed the potential impacts regarding structure and intensity as a result of sea-level rise in the Gulf of Mexico using the WRF-ARW numerical model coupled with a 1D ocean model. Analysis showed that 10 m windspeed from landfall forward was higher in modified coastlines, and minimum sea-level pressure post-landfall was consistently lower for modified runs where storms maintain a higher …

John Horton Conway: The Man And His Knot Theory, Dillon Ketron

Electronic Theses and Dissertations

John Horton Conway was a British mathematician in the twentieth century. He made notable achievements in fields such as algebra, number theory, and knot theory. He was a renowned professor at Cambridge University and later Princeton. His contributions to algebra include his discovery of the Conway group, a group in twenty-four dimensions, and the Conway Constellation. He contributed to number theory with his development of the surreal numbers. His Game of Life earned him long-lasting fame. He contributed to knot theory with his developments of the Conway polynomial, Conway sphere, and Conway notation.

On Loop Commutators, Quaternionic Automorphic Loops, And Related Topics, Mariah Kathleen Barnes

Electronic Theses and Dissertations

This dissertation deals with three topics inside loop and quasigroup theory. First, as a continuation of the project started by David Stanovský and Petr Vojtĕchovský, we study the commutator of congruences defined by Freese and McKenzie in order to create a more pleasing, equivalent definition of the commutator inside of loops. Moreover, we show that the commutator can be characterized by the generators of the inner mapping group of the loop. We then translate these results to characterize the commutator of two normal subloops of any loop.

Second, we study automorphic loops with the desire to find more examples of …

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 …

Banach Spaces On Topological Ramsey Structures, Cheng-Chih Ko

Electronic Theses and Dissertations

A Banach space T₁(d, θ) with a Tsirelson-type norm is constructed on the top of the topological Ramsey space T₁ defined by Dobrinen and Todorcevic [6]. Finite approximations of the isomorphic subtrees are utilised in constructing the norm. The subspace on each “branch” of the tree is shown to resemble the structure of an ℓ_∞ⁿ⁺¹ -space where the dimension corresponds to the number of terminal nodes on that branch. The Banach space T₁(d, θ) is isomorphic to (∑_n∊ℕ⊕ℓ_∞ⁿ⁺¹)_p , where d ∈ ℕ with d ≥ 2, …

Topics In Moufang Loops, Riley Britten

Electronic Theses and Dissertations

We will begin by discussing power graphs of Moufang loops. We are able to show that as in groups the directed power graph of a Moufang loop is uniquely determined by the undirected power graph. In the process of proving this result we define the generalized octonion loops, a variety of Moufang loops which behave analogously to the generalized quaternion groups. We proceed to investigate para-F quasigroups, a variety of quasigroups which we show are antilinear over Moufang loops. We briefly depart from the context of Moufang loops to discuss solvability in general loops. We then prove some results on …

Investigaion Of The Gamma Hurdle Model For A Single Population Mean, Alissa Jacobs

Electronic Theses and Dissertations

A common issue in some statistical inference problems is dealing with a high frequency of zeroes in a sample of data. For many distributions such as the gamma, optimal inference procedures do not allow for zeroes to be present. In practice, however, it is natural to observe real data sets where nonnegative distributions would make sense to model but naturally zeroes will occur. One example of this is in the analysis of cost in insurance claim studies. One common approach to deal with the presence of zeroes is using a hurdle model. Most literary work on hurdle models will focus …

Totally Multicolored Rado Numbers For The Equation X_1 + X_2 + X_3 + ... + X_(M−1) = X_M, Skylar Halverson

Electronic Theses and Dissertations

A set is called Totally Multicolored (TMC) if no elements in the set are colored the same. For all natural numbers t, m, let R(t, m) be the least natural number n such that for every t-coloring of the set {1, 2, 3, ..., R(t, m)} there exist a solution set {x_1, x_2, . . ., x_m} to L(m), x_1 + x_2 + x_3 + ... + x_(m−1) = x_m such that x_i does not equal x_j for all i that does not equal j, that avoids being Totally Multicolored. This paper shows a function to find R(t,m) for any …

The Efficacy Of The South Dakota State University Summer Jacks Leap Program, Tessa M. Sundermann

Electronic Theses and Dissertations

Today, several studies detail the continuing struggle many students have with college mathematics courses at universities across the United States. The South Dakota State University Summer Jacks LeaP program is a summer bridge mathematics program aimed at improving incoming students’ mathematics success. This analysis used a mixed methods research design to examine the efficacy of the Summer Jacks LeaP program. First, we analyzed the LeaP students’ homework averages, exam 1 scores, final exam scores, and overall grade scores to determine if they were finding success in their fall semester mathematics courses. We also used hypothesis testing to compare LeaP participants …

Efficient Numerical Optimization For Parallel Dynamic Optimal Power Flow Simulation Using Network Geometry, Rylee Sundermann

Electronic Theses and Dissertations

In this work, we present a parallel method for accelerating the multi-period dynamic optimal power flow (DOPF). Our approach involves a distributed-memory parallelization of DOPF time-steps, use of a newly developed parallel primal-dual interior point method, and an iterative Krylov subspace linear solver with a block-Jacobi preconditioning scheme. The parallel primal-dual interior point method has been implemented and distributed in the open-source PETSc library and is currently available. We present the formulation of the DOPF problem, the developed primal dual interior point method solver, the parallel implementation, and results on various multi-core machines. We demonstrate the effectiveness our proposed block-Jacobi …

A Practical Extension To The Ab/Ba Design, My T.A Nguyen

Electronic Theses and Dissertations

In this work, we take a close look at a general extension to the traditional AB/BA
crossover design that is commonly used in clinical trials to determine the effectiveness
of new candidate drugs. While the traditional crossover design requires each patient
in the study to be measured on both treatment A and treatment B, we consider the
possibility of additional measurements being available on each patient. This produces
designs such as the AABB/BBAA design which has been used in previous studies.
A general test statistic will be derived to test for treatment effects as well as its
corresponding power function …

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 …

Multilateration Index., Chip Lynch

Electronic Theses and Dissertations

We present an alternative method for pre-processing and storing point data, particularly for Geospatial points, by storing multilateration distances to fixed points rather than coordinates such as Latitude and Longitude. We explore the use of this data to improve query performance for some distance related queries such as nearest neighbor and query-within-radius (i.e. “find all points in a set P within distance d of query point q”). Further, we discuss the problem of “Network Adequacy” common to medical and communications businesses, to analyze questions such as “are at least 90% of patients living within 50 miles of a covered emergency …

Manifold Learning With Tensorial Network Laplacians, Scott Sanders

Electronic Theses and Dissertations

The interdisciplinary field of machine learning studies algorithms in which functionality is dependent on data sets. This data is often treated as a matrix, and a variety of mathematical methods have been developed to glean information from this data structure such as matrix decomposition. The Laplacian matrix, for example, is commonly used to reconstruct networks, and the eigenpairs of this matrix are used in matrix decomposition. Moreover, concepts such as SVD matrix factorization are closely connected to manifold learning, a subfield of machine learning that assumes the observed data lie on a low-dimensional manifold embedded in a higher-dimensional space. Since …

Partially Oriented 6-Star Decomposition Of Some Complete Mixed Graphs, Kazeem A. Kosebinu

Electronic Theses and Dissertations

Let $M_v$ denotes a complete mixed graph on $v$ vertices, and let $S_6^i$ denotes the partial orientation of the 6-star with twice as many arcs as edges. In this work, we state and prove the necessary and sufficient conditions for the existence of $\lambda$-fold decomposition of a complete mixed graph into $S_6^i$ for $i\in\{1,2,3,4\}$. We used the difference method for our proof in some cases. We also give some general sufficient conditions for the existence of $S_6^i$-decomposition of the complete bipartite mixed graph for $i\in\{1,2,3,4\}$. Finally, this work introduces the decomposition of a complete mixed graph with a hole into …

Applying Deep Learning To The Ice Cream Vendor Problem: An Extension Of The Newsvendor Problem, Gaffar Solihu

Electronic Theses and Dissertations

The Newsvendor problem is a classical supply chain problem used to develop strategies for inventory optimization. The goal of the newsvendor problem is to predict the optimal order quantity of a product to meet an uncertain demand in the future, given that the demand distribution itself is known. The Ice Cream Vendor Problem extends the classical newsvendor problem to an uncertain demand with unknown distribution, albeit a distribution that is known to depend on exogenous features. The goal is thus to estimate the order quantity that minimizes the total cost when demand does not follow any known statistical distribution. The …

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

Zn Orbifolds Of Vertex Operator Algebras, Daniel Graybill

Electronic Theses and Dissertations

Given a vertex algebra V and a group of automorphisms of V, the invariant subalgebra V^G is called an orbifold of V. This construction appeared first in physics and was also fundamental to the construction of the Moonshine module in the work of Borcherds. It is expected that nice properties of V such as C2-cofiniteness and rationality will be inherited by V^G if G is a finite group. It is also expected that under reasonable hypotheses, if V is strongly finitely generated and G is reductive, V^G will also be strongly finitely generated. This is an analogue …

On Domination And Bondage Numbers Of Some Classes Of Graphs, Andrew Pham

Electronic Theses and Dissertations

Given a simple finite graph G=(V,E), a vertex subset D ? V(G) is said to be a dominating set of G if every vertex v ? V(G)-D is adjacent to a vertex in D. The domination number of G, denoted ?(G), is the minimum cardinality among all dominating sets of G. In a network, the domination number determines the minimum number of sites required to dominate the entire network at a minimum cost. The bondage number of a graph G is the minimum cardinality among all edge sets B such that ?(G-B) > ?(G). The bondage number may serve as a …

Comparison Of Software Packages For Detecting Differentially Expressed Genes From Single-Sample Rna-Seq Data, Rong Zhou

Electronic Theses and Dissertations

RNA-sequencing (RNA-seq) has rapidly become the tool in many genome-wide transcriptomic studies. It provides a way to understand the RNA environment of cells in different physiological or pathological states to determine how cells respond to these changes. RNA-seq provides quantitative information about the abundance of different RNA species present in a given sample. If the difference or change observed in the read counts or expression level between two experimental conditions is statistically significant, the gene is declared as differentially expressed. A large number of methods for detecting differentially expressed genes (DEGs) with RNA-seq have been developed, such as the methods …

Detailing The Connection Between A Family Of Polar Graphs And Tremain Equiangular Tight Frames, Nicholas Brown

Electronic Theses and Dissertations

The relationship between strongly regular graphs and equiangular tight frames has been known for several years, and this relationship has been used to construct many of the most recent examples of new strongly regular graphs. In this paper, we present an explicit construction of a family of equiangular tight frames using the geometry of a quadratic space over the field of four elements. We observe that these frames give rise to a strongly regular graph on a subset of points of a quadratic space over the field with 4 elements. We then demonstrate an isomorphism between this graph and a …

Topics On Applications Of Optimization Theories On Statistical Methodologies, Duc Anh Anh Doan

Electronic Theses and Dissertations

In this dissertation, We show the results of our researches in statistical sampling, functional optimization, and methodology for partially observed Markov process (POMP) models. In statistical sampling, we introduce a p-generalized smoothing method that enables the Langevin-Monte Carlo method to generate a sample from a log concave distribution weakly smoothing potential function. For our optimization research, we introduce an accelerated inexact gradient (AIG) method. Combining the strengths while mitigating the weakness of its parent methods: gradient descent and Nesterov's accelerated gradient, AIG converges with excellent rates for both convex and non-convex optimization problems for smooth objective functions. Furthermore, we also …