Mathematics Commons^™

Analysis And Construction Of Artificial Neural Networks For The Heat Equations, And Their Associated Parameters, Depths, And Accuracies., Shakil Ahmed Rafi

Graduate Theses and Dissertations

This dissertation seeks to explore a certain calculus for artificial neural networks. Specifically we will be looking at versions of the heat equation, and exploring strategies on how to approximate them.

Our strategy towards the beginning will be to take a technique called Multi-Level Picard (MLP), and present a simplified version of it showing that it converges to a solution of the equation (^∂/_∂t u_d ) (t, x) = (∇² _x u_d)(t, x).

We will then take a small detour exploring the viscosity super-solution properties of solutions to such …

How To Explain Allen-Manandhar’S Method To Beginner Mathematicians : A Convergence Analysis Of A Hybrid Method For Variable-Coefficient Boundary Value Problems, Rebecca Scariano

Honors Theses

In this project, analogies are employed to make complex math concepts approachable to beginners who may only have a basic understanding of calculus and linear algebra. Serving as the focal point of this project, Allen-Manandhar’s method solves an equation, known as an ordinary differential equation (ODE). The mentioned equation with its coefficients is comparable to a pie recipe with ingredients. With the outcome to a recipe seen as its solution, the solution to our pie recipe is a perfectly baked pie, as in without error. The chosen method for baking a pie then classifies as its baking approach that when …

An Experimental And Computational Study On The Dynamics Of Vertical Axis Wind Turbines, Stephen Conte

Theses, Dissertations and Culminating Projects

This thesis conducts preliminary analyses on the estimated performance of a novel Vertical-Axis Wind Turbine at a small-scale through experimental and numerical means. This includes the construction of a wind tunnel in the Complex Fluids Lab at Montclair State University for the simulation and analyses of small-scale prototypes of said VAWT; as well as the utilization of Ansys® 2024 Student Fluent R1 for CFD simulation of scaled single-blade pairs, and potentially full-models of said VAWT.

Applications Of Conic Programming Reformulations, Sarah Kelly

All Dissertations

In general, convex programs have nicer properties than nonconvex programs. Notably, in a convex program, every locally optimal solution is also globally optimal. For this reason, there is interest in finding convex reformulations of nonconvex programs. These reformulation often come in the form of a conic program. For example, nonconvex quadratically-constrained quadratic programs (QCQPs) are often relaxed to semidefinite programs (SDPs) and then tightened with valid inequalities. This dissertation gives a few different problems of interest and shows how conic reformulations can be usefully applied.

In one chapter, we consider two variants of the trust-region subproblem. For each of these …

(R2082) Two New Operations And Extended Modal Operators On Bipolar Pythagorean Fuzzy Matrices, S. Sriram, K. Sivaranjani

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, two novel binary operations concerning bipolar Pythagorean fuzzy matrices are delineated. Several algebraic properties, such as commutativity and associativity, are explored. Additionally, extended modal operators for Bipolar Pythagorean fuzzy matrices are introduced. Subsequently, these methodologies are applied to a decision-making scenario wherein a scoring matrix is formulated and alternatives are ranked according to their cumulative score values.

Mathematical And Computational Analysis Of Certain Regularizations For The 3d Navier-Stokes Equations And Nonlocal Peridynamic Conservation Laws, Isabel Safarik

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

Voigt regularization is a technique used to model turbulent flows, offering advantages such as sharing steady states with the Navier-Stokes equations and requiring no modification of boundary conditions. We explore a modification to the Voigt regularization technique by introducing fractional dissipation into the system, specifically incorporating a fractional power, r. In this work, the proofs are in the context of periodic boundary conditions. The resulting fractional Navier-Stokes-Voigt (fNSV) and fractional Euler-Voigt (fEV) equations are studied for global well-posedness in three dimensions. It is shown that global well-posedness holds in the 3D case for fEV when the fractional power r …

Plumbing The Depths Of The Shallow End: Exploring Persistent Homology Using Small Data, R. Anne Flynn

All NMU Master's Theses

Persistent homology is a prominent tool in topological data analysis. This thesis is designed to be an introduction and guide to a beginner in persistent homology. This comprehensive overview discusses the math used behind it, the code needed to apply it, and its current place in the field. We explain and demonstrate the algebraic topology which fuels persistent homology. Homotopies inspire homology groups, which are able to determine how many holes a shape has. By visualizing data as a shape, persistent homology determines what type of holes are present.

We demonstrate this by using the package TDA in the manipulation …

Hilbert Reciprocity Over Number Fields, Dillon Snyder

Honors Scholar Theses

A Hilbert symbol has the value 1 or −1 depending on the existence of solutions to a certain quadratic equation in a local field, R, or C. Hilbert reciprocity states that for a number field F and two nonzero a and b in F, the product of Hilbert symbols associated to a and b at all the places of F is 1. That is, these Hilbert symbols are −1 for a finite, even number of places of F . Hilbert reciprocity when F = Q is equivalent to the classical quadratic reciprocity law, so Hilbert reciprocity in number fields can …

The Future Of Brain Tumor Diagnosis: Cnn And Transfer Learning Innovations, Shengyuan Wang

Mathematics, Statistics, and Computer Science Honors Projects

For the purpose of improving patient survival rates and facilitating efficient treatment planning, brain tumors need to be identified early and accurately classified. This research investigates the application of transfer learning and Convolutional Neural Networks (CNN) to create an automated, high-precision brain tumor segmentation and classification framework. Utilizing large-scale datasets, which comprise MRI images from open-accessible archives, the model exhibits the effectiveness of the method in various kinds of tumors and imaging scenarios. Our approach utilizes transfer learning techniques along with CNN architectures strengths to tackle the intrinsic difficulties of brain tumor diagnosis, namely significant tumor appearance variability and difficult …

Conditional Constrained And Unconstrained Quantization For A Uniform Distribution On A Hexagon, Christina Hamilton

Theses and Dissertations

In this thesis, we have considered a uniform distribution on a regular hexagon and the set of all its six vertices as a conditional set. For the uniform distribution under the conditional set first, for all positive integers n ≥ 6, we obtain the conditional optimal sets of n-points and the nth conditional quantization errors, and then we calculate the conditional quantization dimension and the conditional quantization coefficient in the unconstrained scenario. Then, for the uniform distribution on the hexagon taking the same conditional set, we investigate the conditional constrained optimal sets of n-points and the conditional constrained quantization errors …

How Mathematics Instructors Foster The Development Of Black Students' Mathematics Identity In Undergraduate Active Learning Mathematics Courses, Ashly J. Olusanya

Theses and Dissertations

Black students must overcome unique challenges to succeed in mathematics. Educators are tasked with identifying equitable teaching practices to support these students. Active learning (AL) is a teaching pedagogy that engages students in rigorous mathematical activities and encourages student participation. This research study will explore the professors’ beliefs about how students learn mathematics and why they use active learning in their collegiate mathematics courses. The study explores the connections between these beliefs and their reported use of instructional practices. The study also identifies the instructors’ beliefs about developing students’ mathematics identities, particularly their Black …

A Study On A Vector Complex Modified Korteweg-De Vries Equation, Changyan Shi

Theses and Dissertations

In this thesis, we systematically study a vector complex modified Kordeweg-de Vries equation by combining Hirota's bilinear method and the the Kadomtsev–Petviashvili (KP) reduction method. This vector nonlinear equation is a multi-component generalization of the well-known modified Kordeweg-de Vries (mKdV) equation and can be reduced to the known Hirota equation, Sasa-Satsuma (SS) equation, Sasa-Satsuma-mKdV equation as well as coupled Sasa-Satsuma equation. First, we bilinearize the vector complex mKdV equation under both the zero and nonzero boundary conditions by introducing auxiliary tau functions. Then, starting from two sets of bilinear equations of multi-component KP hierarchy and single-component KP-Toda …

The Perspectives Of Using Desmos For Students’ Conceptual Understanding And Procedural Fluency To Solve Linear Equations, Larmel Dimatulac Madrilejos

Theses and Dissertations

The study examines the perspectives of using the Desmos calculator of Algebra I students' conceptual understanding and procedural fluency to write, graph, and solve linear equations in Algebra I STAAR. While the students have continuously used technology for mathematics assessment, emergent bilingual students in South Texas still need help passing high-stakes testing. The framework of the study is grounded in the theory of mathematical education (knowledge of mathematics educators to teach), the theory of mathematical learning (understanding how students learn mathematics), and social constructivism. The study seeks ways to teach all students, mainly the minority, to learn …

On Cheeger Constants Of Knots, Robert Lattimer

Electronic Theses, Projects, and Dissertations

In this thesis, we will look at finding bounds for the Cheeger constant of links. We will do this by analyzing an infinite family of links call two-bridge fully augmented links. In order to find a bound on the Cheeger constant, we will look for the Cheeger constant of the link’s crushtacean. We will use that Cheeger constant to give us insight on a good cut for the link itself, and use that cut to obtain a bound. This method gives us a constructive way to find an upper bound on the Cheeger constant of a two-bridge fully augmented link. …

A Post-Quantum Mercurial Signature Scheme, Madison Mabe

All Theses

This paper introduces the first post-quantum mercurial signature scheme. We also discuss how this can be used to construct a credential scheme, as well as some practical applications for the constructions.

Domination In Graphs And The Removal Of A Matching, Geoffrey Boyer

All Theses

We consider how the domination number of an undirected graph changes on the removal of a maximal matching. It is straightforward that there are graphs where no matching removal increases the domination number, and where some matching removal doubles the domination number. We show that in a nontrivial tree there is always a matching removal that increases the domination number; and if a graph has domination number at least $2$ there is always a maximal matching removal that does not double the domination number. We show that these results are sharp and discuss related questions.

The Brahmagupta Equation And Record Numbers, Christine Patterson

Boise State University Theses and Dissertations

The Diophantine equation x² - Dy² = k has been explored since antiquity and has found significant applications in diverse contexts in mathematics. This thesis focuses on two aspects of solutions of this equation:

1. For fixed k, the sizes of the D values for which there is a solution, and the corresponding sizes of the x and y constituting solutions. This topic is previously uninvestigated and our contribution is data-based.
2. For fixed k and D for which the equation is solvable, statistical properties of the x and y occurring in these solutions. We prove that Benford's Law applies …

A Survey Of The Classification Of 1-Dimensional Shift Systems, Jacob Miller

Boise State University Theses and Dissertations

The one-dimensional full shift over a finite set A is the collection of bi-infinite sequences of symbols in A together with the left-shift map which shifts the indexing of the sequence. A shift space is a subset of a full shift defined by a collection of forbidden blocks, i.e., finite words which are not allowed to appear. Many shift spaces arise as the set of bi-infinite walks on a labeled graph, and many dynamical systems can be encoded as shift spaces where the dynamics are replaced by the left-shift map.

We introduce shift spaces and their basic properties, then …

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.

The Forget Time For Random Walks On Trees Of A Fixed Diameter, Lola R. Vescovo

Mathematics, Statistics, and Computer Science Honors Projects

A mixing measure is the expected length of a random walk on a graph given a set of starting and stopping conditions. We study a mixing measure called the forget time. Given a graph G, the pessimal access time for a target distribution is the expected length of an optimal stopping rule to that target distribution, starting from the worst initial vertex. The forget time of G is the smallest pessimal access time among all possible target distributions. We prove that the balanced double broom maximizes the forget time on the set of trees on n vertices with diameter …