Physical Sciences and Mathematics Commons^™

Construction Of Quot-Schemes, Majid Dehghani

Electronic Theses and Dissertations

The Quot Scheme is a construction representing parameter spaces for quotient objects of sheaves or coherent modules over a scheme. It encapsulates families of quotients by fixing a certain quotient's structure. The Hilbert Scheme, a specific type of Quot Scheme, focuses on parameterizing subschemes of a fixed projective space by fixing their Hilbert polynomials. After recalling the basic concepts of the theory, we explain the Grothendieck’s Quot scheme construction and its Grassmannian embedding. Then we continue to an explicit construction of Quot scheme in the case of graded modules over graded rings.

On A Class Of James-Stein’S Estimators In High-Dimensional Data, Arash Aghaei Foroushani

Electronic Theses and Dissertations

In this thesis, we consider the estimation problem of the mean matrix of a multivariate normal distribution in high-dimensional data. Building upon the groundwork laid by Chételat and Wells (2012), we extend their method to the cases where the parameter is the mean matrix of a matrix normal distribution. In particular, we propose a novel class of James-Stein’s estimators for the mean matrix of a multivariate normal distribution with an unknown row covariance matrix and independent columns. Given a realistic assumption, we establish that our proposed estimator outperforms the classical maximum likelihood estimator (MLE) in the context of high-dimensional data. …

A Map-Algebra-Inspired Approach For Interacting With Wireless Sensor Networks, Cyber-Physical Systems Or Internet Of Things, David Almeida

Electronic Theses and Dissertations

The typical approach for consuming data from wireless sensor networks (WSN) and Internet of Things (IoT) has been to send data back to central servers for processing and analysis. This thesis develops an alternative strategy for processing and acting on data directly in the environment referred to as Active embedded Map Algebra (AeMA). Active refers to the near real time production of data, and embedded refers to the architecture of distributed embedded sensor nodes. Network macroprogramming, a style of programming adopted for wireless sensor networks and IoT, addresses the challenges of coordinating the behavior of multiple connected devices through a …

A Bridge Between Graph Neural Networks And Transformers: Positional Encodings As Node Embeddings, Bright Kwaku Manu

Electronic Theses and Dissertations

Graph Neural Networks and Transformers are very powerful frameworks for learning machine learning tasks. While they were evolved separately in diverse fields, current research has revealed some similarities and links between them. This work focuses on bridging the gap between GNNs and Transformers by offering a uniform framework that highlights their similarities and distinctions. We perform positional encodings and identify key properties that make the positional encodings node embeddings. We found that the properties of expressiveness, efficiency and interpretability were achieved in the process. We saw that it is possible to use positional encodings as node embeddings, which can be …

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 …

A History Of Complex Simple Lie Algebras, Avrila Frazier

Electronic Theses and Dissertations

In 1869, prompted by his work in differential equations, Sophus Lie wondered about categorizing what he called “closed systems of commutative transformations,” while around the same time, Wilhelm Killing’s work on non-Euclidean geometry encountered related topics. As mathematicians recognized this as a division of abstract algebra, the area became known as “continuous transformation groups," but we now refer to them as Lie groups.

Patterns and structures emerged from their work, such as describing Lie groups in connection with their associated Lie algebras, which can be categorized in many important ways. In this paper, we focus on Lie algebras over the …

Inference In Generalized Mean Reverting Processes, Yunhong Lyu

Electronic Theses and Dissertations

This dissertation proposes three types of processes that are suitable for modeling positive datasets with periodic behavior and mean-reverting level phenomenon. A class of generalized exponential Ornstein–Uhlenbeck process (GEOU) is consid- ered in Chapter 2. This chapter’s key characteristics include the following: first, the classical exponential Ornstein–Uhlenbeck process is generalized to the case where the drift coefficient is driven by a period function of time; second, as opposed to the results in recent literature, the dimension of the drift parameter is considered unknown. This chapter serves to weaken some assumptions, in recent literature, underlying the asymp- totic optimality of some …

A Vector-Valued Trace Formula For Finite Groups, Miles Chasek

Electronic Theses and Dissertations

We derive a trace formula that can be used to study representations of a finite group G induced from arbitrary representations of a subgroup Γ. We restrict our attention to finite-dimensional representations over the field of complex numbers. We consider some applications and examples of our trace formula, including a proof of the well-known Frobenius reciprocity theorem.

Examining The Effectiveness Of Using Point-Of-View Video Modeling On Mathematics Improvement In Students With Learning Disabilities In Saudi Arabia, Tirad Alsaluli

Electronic Theses and Dissertations

Video Modeling (VM) is one of the most widely used approaches by researchers to improve many skills, such as academic skills in students with Learning Disabilities (LD; Boon et al., 2020). As the incidence rate of individuals with LD in Saudi Arabia increase (Almedlij & Rubinstein-Ávila, 2018), the need for evidence-based math interventions focused on the math development of individuals with LD also increases. Although VM is recognized as an Evidence-based Practice (EBPs), a limited number of studies have implemented VM as an intervention to improve mathematic skills. Implementing VM as a math intervention strategy would explore its effects on …

A Machine Learning Approach To Constructing Ramsey Graphs Leads To The Trahtenbrot-Zykov Problem., Emily Hawboldt

Electronic Theses and Dissertations

Attempts at approaching the well-known and difficult problem of constructing Ramsey graphs via machine learning lead to another difficult problem posed by Zykov in 1963 (now commonly referred to as the Trahtenbrot-Zykov problem): For which graphs F does there exist some graph G such that the neighborhood of every vertex in G induces a subgraph isomorphic to F? Chapter 1 provides a brief introduction to graph theory. Chapter 2 introduces Ramsey theory for graphs. Chapter 3 details a reinforcement learning implementation for Ramsey graph construction. The implementation is based on board game software, specifically the AlphaZero program and its …

Stability Of Cauchy's Equation On Δ+., Holden Wells

Electronic Theses and Dissertations

The most famous functional equation f(x+y)=f(x)+f(y) known as Cauchy's equation due to its appearance in the seminal analysis text Cours d'Analyse (Cauchy 1821), was used to understand fundamental aspects of the real numbers and the importance of regularity assumptions in mathematical analysis. Since then, the equation has been abstracted and examined in many contexts. One such examination, introduced by Stanislaw Ulam and furthered by Donald Hyers, was that of stability. Hyers demonstrated that Cauchy's equation exhibited stability over Banach Spaces in the following sense: functions that approximately satisfy Cauchy's equation are approximated with the same level of error by functions …

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 …

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 …

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 …

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

The Category Of Modules Over A Leavitt Path Algebra, Davis Macdonald

Electronic Theses and Dissertations

In this thesis we establish the technique used to construct universal algebras, and apply this technique to construct Leavitt path algebras. We then establish the basic language of category theory. From there we look at the category of modules over Leavitt Path Algebras over a finite graph, and establish a functorial classification of this category.

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 …

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 …

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

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 …

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 …

Graph Realizability And Factor Properties Based On Degree Sequence, Daniel John

Electronic Theses and Dissertations

A graph is a structure consisting of a set of vertices and edges. Graph construction has been a focus of research for a long time, and generating graphs has proven helpful in complex networks and artificial intelligence.

A significant problem that has been a focus of research is whether a given sequence of integers is graphical. Havel and Hakimi stated necessary and sufficient conditions for a degree sequence to be graphic with different properties. In our work, we have proved the sufficiency of the requirements by generating algorithms and providing constructive proof.

Given a degree sequence, one crucial problem is …

The Equality Case Of The Kraft And The Kraft-Mcmillan Inequalities, Xavier Nunes

Electronic Theses and Dissertations

In this thesis, we analyze the Kraft Inequality and the Kraft-McMillan Inequality in their equality cases. Kraft’s Inequality deals with prefix-free code and Kraft-McMillan’s Inequality deals with uniquely decodable codes. The focus of the Kraft Inequality analysis is to study the occurrence of prefix-free codes that satisfy the equality case and the structure of words in the code when the equality condition is met. The second part of the thesis touches on the Kraft-McMillan Inequality. Since the proof of this latter inequality uses limits, we cannot immediately analyse its equality cases. The paper will therefore study the equality cases of …

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 …