Mathematics Commons^™

Erlang-Distributed Seir Epidemic Models With Cross-Diffusion, Victoria Chebotaeva

Theses and Dissertations

We examine the effects of cross-diffusion dynamics in epidemiological models. Using reaction-diffusion dynamics to model the spread of infectious diseases, we focus on situations in which the movement of individuals is affected by the concentration of individuals of other categories. In particular, we present a model where susceptible individuals move away from large concentrations of infected and infectious individuals.

Our results show that accounting for this cross-diffusion dynamics leads to a noticeable effect on epidemic dynamics. It is noteworthy that this leads to a delay in the onset of epidemics and an increase in the total number of people infected. …

Enumeration Of Level-K Hypertriangulations, Patrick J. Kaylor

Theses and Dissertations

Triangulations are a classical object in discrete and computational geometry that finds it uses in many other fields, including numerous applications. In this thesis we approach the question of enumerating all hypertriangulations of a point set, the family of tilings introduced by Olarte and Santos in 2022 as induced projections of hypersimplices. Unfortunately, the usual approach to enumeration of trinagulations using flips may not work for hypertriangulations as flip-connectivity is only conjectured for that family even in the two-dimensional case. As a result, we develop a DFS-based algorithm and present its Python implementation that enumerates all hypertriangulations of small point …

Missing Data Imputation With Longitudinal Data, Joseph Omar Alanis

Theses and Dissertations

In the repeated measures longitudinal datasets where missing data is a relatively common issue, we explored different imputation methods, including machine learning (ML) methods in order to examine potential efficiencies for using traditional versus newer computational methods. In order to accomplish said comparison, we used a Monte Carlo simulation experiment of a population of size N=70000 to mimic a clinical trial, with different scenarios of missing at random (MAR) data in the response variable. To compare the behavior of each method resulting from the difference between population and sample dataset, a real dataset was used from the Boston College on …

Recognizing Triangles Using Weighted Ehrhart Polynomials, Rafael Sarabia

Theses and Dissertations

Ehrhart theory is a classical topic for polygons or polytopes with vertices with integer coordinates. One of the main results of the theory claims that for every convex polygon P with integer vertices, the number of integer points in its nth dilation is a polynomial in n, the Ehrhart polynomial of P. This property can be extended if for a polynomial weight w(x, y), we sum values of w(x, y) over all points with integer coordinates in the nth dilation of P. The resulted polynomial is called the weighted Ehrhart polynomial of P associated with the weight w. In this …

Conditional Optimal Sets And The Quantization Coefficients For Some Uniform Distributions, Evans Nyanney

Theses and Dissertations

Bucklew and Wise (1982) established that the quantization dimension of an absolutely continuous probability measure on a Euclidean space equals the Euclidean dimension of the space, and that the quantization coefficient is finite and positive. This thesis explores the variability of quantization coefficients for uniform distributions on various geometric structures, including line segments, circles, and regular polygons. We derive the conditional optimal sets of n-points and calculate the n-th conditional quantization errors for uniform distributions under different conditions. On line segments, we identify optimal point distributions as either equally spaced or geometrically spaced towards fixed end-points. For circles, we analyze …

Application And Analysis Of Machine Learning And Deep Learning Algorithms In Detection Of Ddos Cyberattacks, Dipok Deb

Theses and Dissertations

A Distributed Denial-of-Service (DDoS) attack involves overwhelming a target system's data bandwidth or computational resources, often using multiple attack systems, aiming to slow down or disable the targeted system. Detecting and mitigating DDoS attacks effectively remains challenging due to their varying characteristics. One of the promising approaches involves developing an AI based Intrusion Detection System (IDS) against cyberattacks. In this study, we aim to develop an AI based Intrusion Detection System (IDS) for DDoS threat detection using Machine Learning, Deep Learning, or hybrid techniques. Different Machine Learning (ML) and Deep Learning (DL) algorithms like Random Forest (RF), Naïve Bayes (NB), …

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 …

Conditional Quantization For Uniform Distributions On Line Segments And Regular Polygons, Tsianna Danielle Dominguez

Theses and Dissertations

Quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with support containing a finite number of elements. If in the quantization some of the elements in the support are preselected, then the quantization is called a conditional quantization. In this thesis, we have investigated the conditional quantization for the uniform distributions defined on the unit line segments and m-sided regular polygons, where m ≥ 3, inscribed in a unit circle.

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 …

A Study Of Quantitative Reasoning Instructors’ Choices And Motivations When Teaching Quantitative Reasoning For The First Time, Trish Ann Harding

Theses and Dissertations

This qualitative study delves into the instructional decision-making processes of post-secondary instructors teaching quantitative reasoning (QR) courses for the first time. The study aims to address the gap in understanding how first-time QR instructors navigate the complexities of curriculum design and pedagogical strategies, and how these experiences contribute to their professional development. The research questions center on identifying the instructional decisions made by these instructors, exploring the factors influencing their decision-making, and understanding the impact of exercising agency has on their professional development. Through in-depth exploration, this study seeks to shed light on the challenges and opportunities faced by first-time …

Representation Learning For Generative Models With Applications To Healthcare, Astronautics, And Aviation, Van Minh Nguyen

Theses and Dissertations

This dissertation explores applications of representation learning and generative models to challenges in healthcare, astronautics, and aviation.

The first part investigates the use of Generative Adversarial Networks (GANs) to synthesize realistic electronic health record (EHR) data. An initial attempt at training a GAN on the MIMIC-IV dataset encountered stability and convergence issues, motivating a deeper study of 1-Lipschitz regularization techniques for Auxiliary Classifier GANs (AC-GANs). An extensive ablation study on the CIFAR-10 dataset found that Spectral Normalization is key for AC-GAN stability and performance, while Weight Clipping fails to converge without Spectral Normalization. Analysis of the training dynamics provided further …

Proving The Existence Of Equichordal Tight Fusion Frames Using The Newton–Kantorovich Theorem, Staci R. Davis

Theses and Dissertations

An equichordal tight fusion frame (ECTFF) is an example of an optimal packing of subspaces. In particular, an ECTFF is an optimal packing of points in the Grassmannian with respect to chordal distance. Equivalently, every ECTFF is an arrangement of subspaces that meet certain criteria; tightness and equichordality. The existence of an ECTFF can be rephrased as, a certain polynomial mapping as a root. Hence, one can prove the existence of an ECTFF by applying Newton–Kantorovich theorem to this polynomial mapping, given a close enough approximation of one. Newton–Kantorovich requires checking an inequality within a neighborhood of the approximate root, …

Graph Coloring Reconfiguration, Reem Mahmoud

Theses and Dissertations

Reconfiguration is the concept of moving between different solutions to a problem by transforming one solution into another using some prescribed transformation rule (move). Given two solutions s₁ and s₂ of a problem, reconfiguration asks whether there exists a sequence of moves which transforms s₁ into s₂. Reconfiguration is an area of research with many contributions towards various fields such as mathematics and computer science.
The k-coloring reconfiguration problem asks whether there exists a sequence of moves which transforms one k-coloring of a graph G into another. A move in this case is a type …

Developing Machine Learning And Time-Series Analysis Methods With Applications In Diverse Fields, Muhammed Aljifri

Theses and Dissertations

This dissertation introduces methodologies that combine machine learning models with time-series analysis to tackle data analysis challenges in varied fields. The first study enhances the traditional cumulative sum control charts with machine learning models to leverage their predictive power for better detection of process shifts, applying this advanced control chart to monitor hospital readmission rates. The second project develops multi-layer models for predicting chemical concentrations from ultraviolet-visible spectroscopy data, specifically addressing the challenge of analyzing chemicals with a wide range of concentrations. The third study presents a new method for detecting multiple changepoints in autocorrelated ordinal time series, using the …

Paley Graphs, Prime Graphs, And Crossword Puzzles, Robert D. Jacobs Jr.

Theses and Dissertations

In this paper, we will talk about many different mathematical concepts. We will prove theorems about Paley graphs, prime graphs, and crossword puzzles. It will be very fun.

The results in the section about Paley graphs include structure theorems about the subgraph induced by the quadratic residues, the subgraph induced by the non-residues and a few related subgraphs. The main is to better understand the “independence structure” of the Paley graph itself. No good upper bound on the independence number of Paley graphs is known. Theorems about these subgraphs, and various counts aim at future improvement of upper bounds for …

Problems In Graph Theory With Applications To Topology And Modeling Rna, Rayan K. Ibrahim

Theses and Dissertations

In this thesis, we explore four projects. In the first project, we explore $r$-neighbor bootstrap percolation on a graph $G$. We establish upper bounds for the number of vertices required to percolate in the case that $r=2$ for particular classes of graphs. In the second project, we study the structure of graphs with independence number two. We prove a lower bound on the number of edges of such graphs, related to an upper bound on the number of edges in a triangle-saturated graph, and give a sufficient forbidden induced subgraph condition for independence number two graphs. In the third project, …

Torricelli's Law And The Turn-Up Number, Bianca K. Hampel

Theses and Dissertations

We investigate Torricelli's differential law for solids of revolution. Computing the ratio of times of drainage under the same circumstances (same existing requirements) but rotating the solids 180 degrees allows us to define a "Torricelli turn-up number" associated with the solid. For various solids, we calculate this turn-up number and construct solids that are not symmetric under the 180-degree rotation but with a turn-up number of 1. That allows us to construct nonsymmetric clepsydra.

Stochastic Optimal Control Of Conditional Mckean-Vlasov Equations With Jump And Markovian Switching, Charles Samuel Conly Sharp

Theses and Dissertations

This thesis obtains a number of results in stochastic optimal control for conditional McKean-Vlasov equations with jump and Markovian switching. First, we prove the uniqueness of the solutions and derive a relevant version of Itô's formula. We provide the dynamic programming principle and prove the associated verification theorem. A stochastic maximum principle is established. Further, we derive the relationship between dynamic programming and the stochastic maximum principle. Additionally, we utilize our stochastic maximum principle result for a mean-variance portfolio selection problem.

Strategies Community College Mexican American Adult College Algebra Students Use When Graphing Function Transformations, Roxana Pamela Jimenez

Theses and Dissertations

This qualitative case study pursued to describe the different strategies Mexican American adult students in a local community college used to graph function transformations. Participants in the study were purposefully selected using a criterion sampling to ensure participants were atypical, above average students between the ages 18-22, and had a final course average of 89.5-100 in College Algebra. Three research questions were examined 1) In what ways do Mexican American adult college students graph a function transformation? 2) Which strategies do students implement when graphing a function transformation? Qualitative research methods using think aloud semi-structured interviews were used in this …

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

Case Studies Of Algebra 1 Teachers Selection And Implementation Of Mathematics Tasks Toward Situated Learning, Luis Román Sauceda

Theses and Dissertations

Mathematical tasks are vital in active learning, especially in situated learning. Adequate selection and appropriate implementation of tasks are steps toward success in engaging students for active learning. This study explored how a professional development (PD) workshop influences teacher participants’ capabilities in selecting, redesigning, implementing, and reflecting on mathematical tasks to promote situated and active learning. The teacher participants were Algebra 1 teachers from a South Texas secondary school. During the workshop, participants developed and implemented activities after being shown situated learning strategies to promote student-centered learning. They were required to design hypothetical dialogues to simulate their class practice before …

Quasipolynomials And The Unimodality Of Gaussian Polynomials, Paul Marsh

Theses and Dissertations

We illustrate a method to prove the unimodality of Gaussian polynomials ${N+m \brack m}$ for $m = 5$ and $6$, building upon Dr. Brandt Kronholm's work, which proved unimodality for $m = 2,3,$ and $4$. Our approach involves viewing coefficients $p(n,m,N)$ of Gaussian polynomials $N+m \brack m$ based on how far away $n$ is from the central coefficient $p(\lfloor\frac{mN}{2}\rfloor,m,N)$ and then creating generating functions for those coefficients. We then take the difference of neighboring generating functions and change those generating functions into quasipolynomials to verify that their coefficients are non-negative. While the generalization of these generating functions for the coefficients …

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.

How An Instructor's Noticing For Equity Can Foster Students' Sense Of Belonging And Mathematical Confidence, Sthefania Espinosa

Theses and Dissertations

There are many aspects a teacher can notice inside the mathematics classroom, and the more a teacher notices, the more difficult it is to teach. In this study, I particularly focus on noticing for equity, which describes the role of the teacher in attending to students’ mathematical thinking through an equity lens that can allow the instructor to notice the aspects of classroom mathematical activity that can make students feel less or more empowered in their mathematical practices (van Es et al., 2017). There exists few research about how students perceive their instructor’s effort to promote equity and …

Machine Learning And Causality For Interpretable And Automated Decision Making, Maria Lentini

Theses and Dissertations

This abstract explores two key areas in decision science: automated and interpretable decision making. In the first part, we address challenges related to sparse user interaction data and high item turnover rates in recommender systems. We introduce a novel algorithm called Multi-View Interactive Collaborative Filtering (MV-ICTR) that integrates user-item ratings and contextual information, improving performance, particularly for cold-start scenarios. In the second part, we focus on Student Prescription Trees (SPTs), which are interpretable decision trees. These trees use a black box "teacher" model to predict counterfactuals based on observed covariates. We experiment with a Bayesian hierarchical binomial regression model as …

Leveraging Galois Theory And Computational Results In The Search For Legendre Pairs, David M. Arquette

Theses and Dissertations

With applications spanning myriad disciplines, Hadamard matrices have tremendous utility. Infinitely many have been discovered, but there is no general proof of their existence. Proving the Hadamard conjecture would provide a significant technological edge. Hadamard matrices are difficult to construct in general; however, they can be created directly from Legendre pairs (LPs). While LPs are not trivial to find, a breakthrough in this area would be pivotal in the quest to prove the Hadamard conjecture. Most recent efforts rely upon refined search algorithms, and we seek to either develop a better such algorithm or discover an altogether new theoretical construction. …

Signings Of Graphs And Sign-Symmetric Signed Graphs, Ahmad Asiri

Theses and Dissertations

In this dissertation, we investigate various aspects of signed graphs, with a particular focus on signings and sign-symmetric signed graphs. We begin by examining the complete graph on six vertices with one edge deleted ($K_6$\textbackslash e) and explore the different ways of signing this graph up to switching isomorphism. We determine the frustration index (number) of these signings and investigate the existence of sign-symmetric signed graphs. We then extend our study to the $K_6$\textbackslash 2e graph and the McGee graph with exactly two negative edges. We investigate the distinct ways of signing these graphs up to switching isomorphism and demonstrate …