Physical Sciences and Mathematics Commons^™

The Tor Algebra Of Trimmings Of Gorenstein Ideals, Luigi Ferraro, Alexis Hardesty

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

Let (R,\mathfrak m,\Bbbk ) be a regular local ring of dimension 3. Let I be a Gorenstein ideal of R of grade 3. Buchsbaum and Eisenbud proved that there is a skew-symmetric matrix of odd size such that I is generated by the sub-maximal pfaffians of this matrix. Let J be the ideal obtained by multiplying some of the pfaffian generators of I by \mathfrak m; we say that J is a trimming of I. Building on a recent paper of Vandebogert, we construct an explicit free resolution of R/J and compute a partial DG algebra structure on this …

First Order Approximation On The Basilica Julia Set, Xintan Xia, Taryn Flock

Mathematics, Statistics, and Computer Science Honors Projects

We consider the basilica Julia set of the quadratic polynomial P (z) = z^2 - 1, with its successive graph approximations defined in terms of the external ray parametrization of the set. Following the model of Kigami and later Strichartz, we exploit these graph approximations to define derivatives of functions defined on the fractal, an endeavor complicated by asymmetric neighborhood behaviors at approximated vertex points across levels, and by the topology of these vertices. We hence differentiate even and odd levels of approximations of the Julia set and construct, accordingly, normal derivatives corresponding to each level category at the vertices, …

Cyclically Compact Operators In Banach Modules Over L0(B), Jasurbek Karimov

Bulletin of National University of Uzbekistan: Mathematics and Natural Sciences

In this paper the properties of linear cyclically compact operators in Banach modules over space L⁰(B) are given.

Optimal Stopping And Related Topics, Jackson Scott Hebner

Honors Scholar Theses

Suppose we are observing a randomly evolving system and have the ability to freeze it at any time. If we want to maximize some function of the state of the system, how can we determine the best time to freeze the system based on observations only up until the present moment? That is, without seeing the future, how can we form a rule for stopping the system such that we optimize the expected value of the function of interest to us? This is an informal statement of the concept of optimal stopping, a topic with deep theory and numerous applications. …

Wiener Index In Graphs Given Girth, Minimum, And Maximum Degrees, Fadekemi J. Osaye, Liliek Susilowati, Alex S. Alochukwu, Cadavious Jones

Theory and Applications of Graphs

Let $G$ be a connected graph of order $n$. The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. The well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n \choose 2}$ on the Wiener index of a graph of order $n$ and minimum degree $\delta$ by Kouider and Winkler \cite{Kouider} was improved significantly by Alochukwu and Dankelmann \cite{Alex} for graphs containing a vertex of large degree $\Delta$ to $W(G) \leq {n-\Delta+\delta \choose 2} \big( \frac{n+2\Delta}{\delta+1}+4 \big)$. In this paper, we give upper bounds on the Wiener index of $G$ in terms of order …

Game-Theoretic Approaches To Optimal Resource Allocation And Defense Strategies In Herbaceous Plants, Molly R. Creagar

Dissertations and Doctoral Documents from University of Nebraska-Lincoln, 2023–

Empirical evidence suggests that the attractiveness of a plant to herbivores can be affected by the investment in defense by neighboring plants, as well as investment in defense by the focal plant. Thus, allocation to defense may not only be influenced by the frequency and intensity of herbivory but also by defense strategies employed by other plants in the environment. We incorporate a neighborhood defense effect by applying spatial evolutionary game theory to optimal resource allocation in plants where cooperators are plants investing in defense and defectors are plants that do not. We use a stochastic dynamic programming model, along …

On The Hardness Of The Balanced Connected Subgraph Problem For Families Of Regular Graphs, Harsharaj Pathak

Theory and Applications of Graphs

The Balanced Connected Subgraph problem (BCS) was introduced by Bhore et al. In the BCS problem we are given a vertex-colored graph G = (V, E) where each vertex is colored “red” or “blue”. The goal is to find a maximum cardinality induced connected subgraph H of G such that H contains an equal number of red and blue vertices. This problem is known to be NP-hard for general graphs as well as many special classes of graphs. In this work we explore the time complexity of the BCS problem in case of regular graphs. We prove that the BCS …

The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson

Cybersecurity Undergraduate Research Showcase

The RSA encryption algorithm has secured many large systems, including bank systems, data encryption in emails, several online transactions, etc. Benefiting from the use of asymmetric cryptography and properties of number theory, RSA was widely regarded as one of most difficult algorithms to decrypt without a key, especially since by brute force, breaking the algorithm would take thousands of years. However, in recent times, research has shown that RSA is getting closer to being efficiently decrypted classically, using algebraic methods, (fully cracked through limited bits) in which elliptic-curve cryptography has been thought of as the alternative that is stronger than …

Renormalized Stress-Energy Tensor For Scalar Fields In Hartle-Hawking, Boulware, And Unruh States In The Reissner-Nordström Spacetime, Julio Arrechea, Cormac Breen, Adrian Ottewill, Peter Taylor

Articles

In this paper, we consider a quantum scalar field propagating on the Reissner-Nordström black hole spacetime. We compute the renormalized stress-energy tensor for the field in the Hartle-Hawking, Boulware and Unruh states. When the field is in the Hartle-Hawking state, we renormalize using the recently developed “extended coordinate” prescription. This method, which relies on Euclidean techniques, is very fast and accurate. Once, we have renormalized in the Hartle-Hawking state, we compute the stress-energy tensor in the Boulware and Unruh states by leveraging the fact that the difference between stress-energy tensors in different quantum states is already finite. We consider a …

Laterally Complete Regular Modules, Jasurbek Karimov

Bulletin of National University of Uzbekistan: Mathematics and Natural Sciences

In this paper we introduce the notion laterally complete regular modules and study some properties of theese modules.

A Review On Possible Physical Meaning Of Elastic-Electromagnetic Mathematical Equivalences, Florentin Smarandache, Victor Christianto

Branch Mathematics and Statistics Faculty and Staff Publications

It is known, despite special theory of relativity has been widely accepted, in our recent draft submitted to this journal it is shown that some experiments have been carried out suggesting superluminal wave propagation, which make Minkowski lightcone not valid anymore. Therefore, it seems worth to reconsider the connection between elastic wave and electromagnetic wave equations, as in their early development. In this paper we will start with Maxwell-Dirac isomorphism, then we will find its connection with elastic wave equations.

A Survey On Varieties Generated By Small Semigroups And A Companion Website, João Araújo, João Pedro Araújo, Peter J. Cameron, Edmond W. H. Lee, Jorge Raminhos

Mathematics Faculty Articles

This paper presents new findings on varieties generated by small semigroups and groups, and offers a survey of existing results. A companion website is provided which hosts a computational system integrating automated reasoning tools, finite model builders, SAT solvers, and GAP. This platform is a living guide to the literature. In addition, the first complete and justified list of identity bases for all varieties generated by a semigroup of order up to 4 is provided as supplementary material. The paper concludes with an extensive list of open problems.

Every Relu-Based Neural Network Can Be Described By A System Of Takagi-Sugeno Fuzzy Rules: A Theorem, Barnabas Bede, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

While modern deep-learning neural networks are very successful, sometimes they make mistakes, and since their results are "black boxes" -- no explanation is provided -- it is difficult to determine which recommendations are erroneous. It is therefore desirable to make the resulting computations explainable, i.e., to describe their results by using commonsense rules. In this paper, we use "fuzzy" techniques -- techniques developed by Lotfi Zadeh to deal with commonsense rules formulated by using imprecise ("fuzzy") words from natural language -- to show that such a rule-based representation is always possible. Our result does not yet provide the desired explainability, …

Smooth Non-Additive Integrals And Measures And Their Potential Applications, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we explain why non-additive integrals and measures are needed, how non-additive integrals and measures are related, how to use them in decision making, and how they can help in fundamental physics. These four topics are covered, correspondingly, in Sections 2-5 of this paper.

When Is A Single "And"-Condition Enough?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, there are several possible decisions. Any general recommendation means specifying, for each possible decision, conditions under which this decision is recommended. In some cases, a single "and"-condition is sufficient: e.g., a condition under which a patient is recommended to take aspirin is that "the patient has a fever and the patient does not have stomach trouble". In other cases, conditions are more complicated. A natural question is: when is a single "and"-condition enough? In this paper, we provide an answer to this question.

If We Add Axiom Of Choice To Constructive Analysis, We Get Classical Arithmetic: An Exercise In Reverse Constructive Mathematics, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

A recent paper in Bulletin of Symbolic Logic reminded that the Axiom of Choice is, in general, false in constructive analysis. This result is an immediate consequence of a theorem -- first proved by Tseytin -- that every computable function is continuous. In this paper, we strengthen the result about the Axiom of Choice by proving that this axiom is as non-constructive as possible: namely, that if we add this axiom to constructive analysis, then we get full classical arithmetic.

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 …

Combinatorial Problems Related To Optimal Transport And Parking Functions, Jan Kretschmann

Theses and Dissertations

In the first part of this work, we provide contributions to optimal transport through work on the discrete Earth Mover's Distance (EMD).We provide a new formula for the mean EMD by computing three different formulas for the sum of width-one matrices: the first two formulas apply the theory of abstract simplicial complexes and result from a shelling of the order complex, whereas the last formula uses Young tableaux. Subsequently, we employ this result to compute the EMD under different cost matrices satisfying the Monge property. Additionally, we use linear programming to compute the EMD under non-Monge cost matrices, giving an …

(R2054) Convergence Of Lagrange-Hermite Interpolation Using Non-Uniform Nodes On The Unit Circle, Swarnima Bahadur, Sameera Iqram, Varun .

Applications and Applied Mathematics: An International Journal (AAM)

In this research article, we brought into consideration the set of non-uniformly distributed nodes on the unit circle to investigate a Lagrange-Hermite interpolation problem. These nodes are obtained by projecting vertically the zeros of Jacobi polynomial onto the unit circle along with the boundary points of the unit circle on the real line. Explicitly representing the interpolatory polynomial as well as establishment of convergence theorem are the key highlights of this manuscript. The result proved are of interest to approximation theory.

On Dyadic Parity Check Codes And Their Generalizations, Meraiah Martinez

Department of Mathematics: Dissertations, Theses, and Student Research

In order to communicate information over a noisy channel, error-correcting codes can be used to ensure that small errors don’t prevent the transmission of a message. One family of codes that has been found to have good properties is low-density parity check (LDPC) codes. These are represented by sparse bipartite graphs and have low complexity graph-based decoding algorithms. Various graphical properties, such as the girth and stopping sets, influence when these algorithms might fail. Additionally, codes based on algebraically structured parity check matrices are desirable in applications due to their compact representations, practical implementation advantages, and tractable decoder performance analysis. …

Unexpectedness Stratified By Codimension, Frank Zimmitti

Department of Mathematics: Dissertations, Theses, and Student Research

A recent series of papers, starting with the paper of Cook, Harbourne, Migliore, and Nagel on the projective plane in 2018, studies a notion of unexpectedness for finite sets Z of points in N-dimensional projective space. Say the complete linear system L of forms of degree d vanishing on Z has dimension t yet for any general point P the linear system of forms vanishing on Z with multiplicity m at P is nonempty. If the dimension of L is more than the expected dimension of t−r, where r is N+m−1 choose …

Pappus Of Alexandria, Book Iii Of The Mathematical Collection, Pappus Of Alexandria, John B. Little

Holy Cross Bookshelf

John B. Little is the translator.

This is a translation of Book III of the Mathematical Collection by Pappus of Alexandria (ca. 290 - 350 CE) from the original Greek to English, following the edition of Friedrich Hultsch. While other books of the Mathematical Collection have been translated into English and short quotations from Book III have appeared in a number of places (see the Introduction), to my knowledge, no complete English translation of Book III has been published. Pappus was very influential as a sort of conduit between knowledge preserved from ancient Greek mathematics and European mathematicians in the …

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 …

Discrete Complementary Exponential And Sine Integral Functions, Samer Assaf, Tom Cuchta

Mathematics Faculty Research

Discrete analogues of the sine integral and complementary exponential integral functions are investigated. Hypergeometric representation, power series, and Laplace transforms are derived for each. The difficulties in extending these definitions to other common trigonometric integral functions are discussed.

Wavelet Compression As An Observational Operator In Data Assimilation Systems For Sea Surface Temperature, Bradley J. Sciacca

University of New Orleans Theses and Dissertations

The ocean remains severely under-observed, in part due to its sheer size. Containing nearly billion of water with most of the subsurface being invisible because water is extremely difficult to penetrate using electromagnetic radiation, as is typically used by satellite measuring instruments. For this reason, most observations of the ocean have very low spatial-temporal coverage to get a broad capture of the ocean’s features. However, recent “dense but patchy” data have increased the availability of high-resolution – low spatial coverage observations. These novel data sets have motivated research into multi-scale data assimilation methods. Here, we demonstrate a new assimilation approach …

Measuring The Lengths Of Sperm Whales Of The Northern Gulf Of Mexico By Wavelet Analysis Of Their Usual Clicks, George Drouant

University of New Orleans Theses and Dissertations

Abstract

Acoustic recordings of underwater sounds produced by marine mammals present an attractive alternative to costly and logistically complex ship based visual surveys for collecting population data for various species.

The first reported use of underwater acoustic recordings in the long-term monitoring of sperm whale populations was by Ackleh et al. (Ackleh et al., 2012). The paper describes counting sperm whale clicks at different locations to track population changes over time.

Analysis of sperm whale clicks offers additional insight into sperm whale populations. The echo location clicks (usual clicks) of sperm whales can be used to give an estimate of …

A Combinatorial Proof Of Supercranks For Partitions With A Fixed Number Of Parts, Jacob J. Gutierrez

Theses and Dissertations

In a previous paper by Eichhorn and Kronholm, a selection of supercranks for p(n,m) was established by generating functions. In this paper we will reprove this result with combinatorial witnesses for the selection of supercranks via integer lattice points.

Attitudes Towards Mathematics Of Developmental Mathematics Students In A Community College, Benjamin Ortiz

Theses and Dissertations

Reformations to developmental mathematics aim to remove barriers for students entering higher education. Challenges like costly multi-course sequences and high failure rates prohibit students’ access to college-level math courses and prevent degree or certification completion. Understanding factors that foster student success is critical to increase student success. This study focuses on students’ attitudes towards mathematics, utilizing the novice-expert continuum through Code et al.’s Mathematical Attitude and Perceptions Survey (MAPS) instrument. Student expertise scores, including all MAPS dimensions and specific dimension scores, were assigned. Kruskal-Wallis Rank-Sum tests identified differences in student populations by course and attitude dimension. …

An Automatic Solver For Optimal Control Problems, Marcel Efren Benitez

Theses and Dissertations

Optimal control theory is a study that is used to find a control for a dynamical system over a period of time such that a objection function is optimized. In this study we will be looking at optimal control problems for ordinary differential equations or ODEs and see that we can use an automatic solver using the forward-backward sweep using Matlab to solve for them from an 1 dimension to bounded cases and to nth dimension cases.