Mathematics Commons^™

The Existence And Quantum Approximation Of Optimal Pure State Ensembles, Ryan Thomas Mcgaha

Theses and Dissertations

In this manuscript we study entanglement measures defined via the convex roof construction. In the first chapter we build the notion of an entanglement measure from the ground up and discuss various issues that arise when trying to measure the amount of entanglement present in an arbitrary density operator. Through this introduction we will motivate the use of the convex roof construction. In the second chapter we will show that the infimum in the convex roof construction is achieved for a specific set of entanglement measures and provide canonical examples of such measures. We also describe LOCC operations via a …

Results On Select Combinatorial Problems With An Extremal Nature, Stephen Smith

Theses and Dissertations

This dissertation is split into three sections, each containing new results on a particular combinatorial problem. In the first section, we consider the set of 3-connected quadrangulations on n vertices and the set of 5-connected triangulations on n vertices. In each case, we find the minimum Wiener index of any graph in the given class, and identify graphs that obtain this minimum value. Moreover, we prove that these graphs are unique up to isomorphism.

In the second section, we work with structures emerging from the biological sciences called tanglegrams. In particular, our work pertains to an invariant of tanglegrams called …

Some Properties And Applications Of Spaces Of Modular Forms With Eta-Multiplier, Cuyler Daniel Warnock

Theses and Dissertations

This dissertation considers two topics. In the first part of the dissertation, we prove the existence of fourteen congruences for the $p$-core partition function of the form given by Garvan in \cite{G1}. Different from the congruences given by Garvan, each of the congruences we give yield infinitely many congruences of the form $$a_p(\ell\cdot p^{t+1} \cdot n + p^t \cdot k - \delta_p) \equiv 0 \pmod \ell.$$ For example, if $t \geq 0$ and $\sfrac{m}{n}$ is the Jacobi symbol, then we prove $$a_7(7^t \cdot n - 2) \equiv 0 \pmod 5, \text{ \ \ if $\bfrac{n}{5} = 1$ and $\bfrac{n}{7} = …

Motivic Classes Of Degeneracy Loci And Pointed Brill-Noether Varieties, D. Anderson, Linda Chen, N. Tarasca

Mathematics & Statistics Faculty Works

Motivic Chern and Hirzebruch classes are polynomials with K-theory and homology classes as coefficients, which specialize to Chern–Schwartz–MacPherson classes, K-theory classes, and Cappell–Shaneson L-classes. We provide formulas to compute the motivic Chern and Hirzebruch classes of Grassmannian and vexillary degeneracy loci. We apply our results to obtain the Hirzebruch χ_y-genus of classical and one-pointed Brill–Noether varieties, and therefore their topological Euler characteristic, holomorphic Euler characteristic, and signature.

Amphichiral Knots With Large 4-Genus, Allison N. Miller

Mathematics & Statistics Faculty Works

For each we give g > 0 infinitely many knots that are strongly negative amphichiral, hence rationally slice and representing 2-torsion in the smooth concordance group, yet which do not bound any locally flatly embedded surface in the 4-ball with genus less than or equal to g. Our examples also allow us to answer a question about the four-dimensional clasp number of knots.

Advances And Applications Of Optimal Polynomial Approximants, Raymond Centner

USF Tampa Graduate Theses and Dissertations

The history of optimal polynomial approximants (OPAs) dates back to the engineering literature of the 1970s. Here, these polynomials were studied in the context of the Hardy space H^2(X), where X denotes the open unit disk D or the bidisk D^2. Under certain conditions, it was thought that these polynomials had all of their zeros outside the closure of X. Hence, it was suggested that these polynomials could be used to design a stable digital filter. In recent mathematics literature, OPAs have been studied in many different function spaces. In these settings, numerous papers have been devoted to studying the …

Parallel Resource Defined Fitness Sharing: A Study On Parallel Optimizations For Niching Algorithms, Blayne A. Rogers

Masters Theses

The exploitation of niches by genetic algorithms (GAs) is a computationally expensive, but effective, methodology for solving complex open problems and real-world applications. Niching, differentiated on the modality of sharing, casts problems in terms of the specific resources available. These concepts arise from the broader natural algorithms that encapsulate the ideas and theories used in artificial intelligence. In remediating the computational costs, a study on exploiting niche-defined parallel structures is performed in the contest of the resourcedefined fitness sharing (RFS) algorithm.

Sharing is a natural algorithm paradigm that emulates the use of resources within an environment or population. Defining these …

Varieties Of Nonassociative Rings Of Bol-Moufang Type, Ronald E. White

All NMU Master's Theses

In this paper we investigate Bol-Moufang identities in a more general and very natural setting, \textit{nonassociative rings}.

We first introduce and define common algebras. We then explore the varieties of nonassociative rings of Bol-Moufang type. We explore two separate cases, the first where we consider binary rings, rings in which we make no assumption of it's structure. The second case we explore are rings in which, $2x=0$ implies $x=0$.

Quandles That Are Knot Quandles, Jason Haskell

All NMU Master's Theses

There are many papers that introduce the relationship between knots and quandles which are written tersely and focus mainly on applications or implications. Here, we will take time to explain in depth how to derive quandles from oriented knots. Starting with an rigorous introduction to what a knot is and what a quandle is, we will also define the Fundamental Quandle of a knot and the relationship between colorings of a knot and the homomorphisms from an arbitrary quandle to a Fundamental Quandle. Then using this foundation, we will examine two sets of knots that produce quandles that contain subquandles …

Kissing The Archimedeans, Anthony Webb

All NMU Master's Theses

In this paper the three dimensional kissing problem will be related to the Platonic and Archimedean solids. On each polyhedra presented their vertices will have spheres expanding such that the center of each of these outer spheres are the vertices of the polyhedron, and these outer spheres will continue to expand until they become tangent to each other. The ratio will be found between the radius of each outer sphere, and the radius of an inner sphere such that each inner sphere's center is the circumcenter of the polyhedron, and the inner sphere is tangent to each outer sphere. Every …

All Pairs Routing Path Enumeration Using Latin Multiplication And Julia, Haochen Sun

Dissertations (1934 -)

Enumerating all routing paths among Autonomous Systems (ASes) at an Internet-scale is an intractable problem. The Border Gateway Protocol (BGP) is the standard exterior gateway protocol through which ASes exchange reachability information. Building an efficient path enumeration tool for a given network is an essential step toward estimating the resiliency of the network to cyber security attacks, such as routing origin and path hijacking. In our work, we use the matrix Latin multiplication method to compute all possible paths among all pairs of nodes. We parallelize this computation through the domain decomposition for matrix multiplication and implement our solution in …

The Traveling Salesman Problem: An Analysis And Comparison Of Metaheuristics And Algorithms, Mason Helmick

Senior Honors Theses

One of the most investigated topics in operations research is the Traveling Salesman Problem (TSP) and the algorithms that can be used to solve it. Despite its relatively simple formulation, its computational difficulty keeps it and potential solution methods at the forefront of current research. This paper defines and analyzes numerous proposed solutions to the TSP in order to facilitate understanding of the problem. Additionally, the efficiencies of different heuristics are studied and compared to the aforementioned algorithms’ accuracy, as a quick algorithm is often formulated at the expense of an exact solution.

Heat And Mass Transfer Of A Molten Polymer Conveying Nanoparticles In A Wire Coating Process With Temperature-Dependent Fluid Properties: Optimization Using Response Surface Method, Mahanthesh Basavarajappa, Dambaru Bhatta

School of Mathematical & Statistical Sciences Faculty Publications

Heat and mass transfer rates play a significant role in achieving a high-efficiency, low-cost wire coating process. Therefore, the flow analysis of molten polymer (polyvinyl chloride) carrying nanoparticles inside a pressure-type die is presented. The third-grade liquid model is used for the constitutive equation of the polyvinyl chloride (PVC), while the non-homogeneous biphasic model is used for nanoparticles. The properties of PVC are temperature-dependent. The melt flow is governed by the modified Navier-Stokes equation for the third-grade fluid, energy conservation, and nanoparticles' continuity equation. The finite difference method-based routine is applied to solve the nonlinear differential equations that include …

Autonomous Eco-Driving With Traffic Light And Lead Vehicle Constraints: An Application Of Best Constrained Interpolation, Yara Hazem Mohamed Mahmoud

Masters Theses

Eco-Driving is a critical technology for improving automotive transportation efficiency. It is achieved by modifying the driving trajectory over a particular route to minimize required propulsion energy. Eco-Driving can be approached as an optimal control problem subject to driving constraints such as traffic lights and positions of other vehicles. Best interpolation in a strip is a problem in approximation theory and optimal control. The solution to this problem is a cubic spline. In this research we demonstrate the connection between Eco-Driving and best interpolation in the strip. By exploiting this connection, we are able to generate optimal Eco-Driving trajectories that …

Classifying Pretzel Links Obtained By Strong Fusion, Jonathan Homan

Honors Theses

A link is a collection of circles embedded into 3-dimensional space. Pretzel links are an important family of links which comprises those links that fit a general form that includes many of the most common links. The strong fusion of a link joins two components of the link via a band and adds an unknotted circle about the band [4]; this naturally arises in the study of concordance and has been used to model biological phenomena such as site specific recombination in DNA [2]. Here we present a complete and original classification of those pretzel links which can be obtained …

On The Generalized Hardy-Littlewood Maximal Operator, Namarig Hashim Hassan

Theses

No abstract provided.

Quadratic Neural Network Architecture As Evaluated Relative To Conventional Neural Network Architecture, Reid Taylor

Senior Theses

Current work in the field of deep learning and neural networks revolves around several variations of the same mathematical model for associative learning. These variations, while significant and exceptionally applicable in the real world, fail to push the limits of modern computational prowess. This research does just that: by leveraging high order tensors in place of 2nd order tensors, quadratic neural networks can be developed and can allow for substantially more complex machine learning models which allow for self-interactions of collected and analyzed data. This research shows the theorization and development of mathematical model necessary for such an idea to …

Growth Models And Their Stability Analysis For Populations Of A Single Species, Iris Gomez, Michael Garza

Student Research Symposium 2022 (Archived)

Understanding the patterns of population growth for human beings or other animals is important for effective society and resource management. We study several population growth models for a single species to exhibit how the secret of growth patterns can be unlocked from a mathematical perspective. The models are derived from differential equations involving rate of population change, birth/death rate, population carrying capacity, and delayed population influence on population growth. Solutions of the population as functions of time are obtained and plotted to show their visual effect. Equilibriums of the solutions are also analyzed to understand the long-term behavior of population …

A Uniform Chevalley Theorem For Direct Summands Of Polynomial Rings In Mixed Characteristic, Alessandro De Stefani, Eloisa Grifo, Jack Jeffries

Department of Mathematics: Faculty Publications

We prove an explicit uniform Chevalley theorem for direct summands of graded polynomial rings in mixed characteristic. Our strategy relies on the introduction of a new type of differential powers that does not require the existence of a p-derivation on the direct summand.

Tangled Up In Tanglegrams, Drew Joseph Scalzo

Theses and Dissertations

Tanglegrams are graphs consisting of two rooted binary plane trees with the same number of leaves and a perfect matching between the two leaf sets. A Tanglegram drawing is a special way of drawing a Tanglegram; and a Tanglegram is called planar if it has a drawing such that the matching edges do not cross. In this thesis, we will discuss various results related to the construction and planarity of Tanglegrams, as well as demonstrate how to construct all the Tanglegrams of size 4 by looking at two types of rooted binary trees - Caterpillar and Complete Binary Trees. After …