Other Mathematics Commons^™

Waiting For The Magic: A Historical And Mathematical Study Of Queues In Disney Theme Parks, Nina E. Becket

Journal of Humanistic Mathematics

This paper, written as part of an honors research project in high school, provides an introduction to the line and queuing systems at Disney theme parks. We begin with a brief history of Disney World and its creators. We then introduce the basics of queuing theory and queuing notation. Finally, we examine modern line systems at Disney (as of 2023) and the future of its different queue systems.

Bias, Structure, And Inference In Applied Network Analysis, Anna Vasenina

Dartmouth College Ph.D Dissertations

This dissertation develops mathematical and statistical methods for extracting reliable information from network data across biological applications, with an emphasis on understanding what observed network structure can and cannot resolve. The first study leverages protein–protein interaction network topology in the c-di-GMP signaling system of Pseudomonas fluorescens, showing that node centrality measures accurately classify protein domain types and that physical interaction structure contributes statistically significant predictive power for biofilm formation phenotypes across nearly 200 environments, while gene expression does not. The second study examines sampling bias in lemur-plant trophic interaction networks in Madagascar, demonstrating that differential detection of diurnal versus …

A Two-Phase Perspective On A Related-Rates Paradox, Charlie Vazquez Acosta

Honors Capstones

Related-rates problems are a standard topic in first-year calculus and have appeared in textbooks for over 150 years. These problems are used to teach implicit differentiation and the relationship between changing quantities. Common examples include the falling ladder, the fishing bobber, the melting snowball, and the leaking conical tank. In each of these problems, a quantity is changing at a constant rate, and students are asked to find the rate of change of another related quantity. While the computations themselves are usually straightforward, the standard models lead to unrealistic results near the end of the motion. For example, the falling …

A New Approach To Generate Combinatorial Patterns In Logical Analysis Of Data And Its Application To Predict College Retention, Salihah Ahmed E. Jaafari

Theses and Dissertations

Student retention and degree completion remain central challenges for higher-education institutions, with significant implications for student success, institutional effectiveness, and public accountability. While advances in predictive analytics have enabled earlier identification of students at risk of withdrawal, many commonly used machine learning approaches suffer from limited interpretability, constraining their practical usefulness for advising, intervention, and policy decision making. This dissertation addresses the problem of predicting student persistence by developing and evaluating optimization based, interpretable classification models within the Logical Analysis of Data (LAD) framework. Building on existing LAD formulations, this research introduces two novel pattern generation models, the Best Term …

Decision Making For Large-Scale Problems Under Uncertainty And Conflict, Benjamin J. Hamlin

All Dissertations

Large-scale decision-making problems appear in many areas including long-range forecasting such as energy generation forecasting. Many such problems are subject to conflicting objectives and uncertain data, and can be modeled as linear optimization problems. We study novel theoretical results and algorithms for large-scale linear decision problems under conflict and uncertainty. First, we propose a parametric Benders decomposition algorithm for solving large-scale linear optimization problems with multiple objectives or deterministically uncertain objectives. Second, we extend the parametric Benders decomposition to a multi-stage setting, developing a parametric stochastic dual dynamic programming algorithm, which enables decision-making when conflicts and uncertainty have planning impacts …

Fractsynth: Exploring Glitch Timbres With Chaos Theory, Aidan Roach

The Transdisciplinary STEAM+ Journal

In this paper, I explore how chaos theory can be used to design a new kind of synthesizer with the primary focus of producing glitchy, unpredictable sounds. Glitch music embraces abstract sound design, malfunctioning electronics, and randomness as the main compositional elements. However, most synthesizers rely on stable, repetitive oscillators that often sound too controlled. To challenge this, I developed FractSynth, a real-time synthesizer that uses chaotic attractors–including the Logistic Map, Henon Map, and Lorenz System–as modulation sources for frequency, amplitude, and tone. The software also features real-time Lyapunov Exponent Tracking, which gives users a direct visual of how …

Arrangements Of N Planes Resulting In One Bounded Tetrahedral Chamber, Ava Knight

Williams Honors College, Honors Research Projects

This paper investigates the combinatorial geometry of plane arrangements in three-dimensional space, focusing on configurations that produce exactly one bounded tetrahedral chamber. We define T(n) as the number of face-combinatorial equivalence classes of arrangements of n planes in ℝ³ containing exactly one bounded tetrahedral chamber. Known values — T(3) = 0, T(4) = 1, and T(5) = 2 — are established through direct construction, while T(6) remains an open problem. This paper contributes experimental evidence toward resolving T(6) by systematically extending the two valid 5-plane arrangements and verifying, through a plane removal argument, that each yields a valid plane configuration …

Applications Of The Mathieu Groups And Information Theory In Dna Encoding Functions, Juan C. Nava Jr

Theses and Dissertations

A foundational idea in mathematics lies in breaking down existing components into their bare fundamentals. As evidenced by prime numbers and composites, we learn this idea at an early age. Categorizing these broken-down components into their simplest form allows mathematicians to construct proofs from emergent patterns. John Conway’s Atlas of Finite Groups in the 1990s was particularly concerned with the categorization of structures known as groups. There are certain axioms a group must adhere to, which amount to the retention of symmetry; ultimately a group helps us to better understand symmetric actions performed on a set with a binary operation. …

Learning With Errors Parameter Analysis, Archana Parameswaran

Cybersecurity Undergraduate Research Showcase

We implement a systematic approach for generating, evaluating, and benchmarking Learning with Errors implementations in Sage Math by varying lattice dimensions, moduli, error standard deviations, and multiple error distributions to observe concrete security-efficiency tradeoffs. The security estimator maps parameter sets to concrete security levels and bits, while performance metrics measured computational efficiency and memory requirements. Results indicate that various distribution types do not significantly impact security, though binomial distributions require more computational overhead than discrete gaussian or uniform. Memory requirements increased when modulus q increased from 12289 to 65537. Larger dimensions have an exponentially growing requirement for memory, but this …

Novel Generative And Language Model Architectures With Applications, Edison Mucllari

Theses and Dissertations--Mathematics

This dissertation investigates novel architectures to address fundamental challenges in machine learning, particularly focusing on transformer models, recurrent neural networks, GAN and continual learning and their applications in natural language processing and computer vision. We propose the Neumann-Cayley Gated Recurrent Unit (NC-GRU), which leverages a Neumann series-based Scaled Cayley transformation to maintain orthogonal weight matrices, effectively mitigating exploding gradients problems while improving long-term memory retention across prediction tasks. We demonstrate the practical applications of NC-GRU by implementing our proposed architecture into an autoencoder to derive neural molecular fingerprints. Building upon these advancements, we turn our attention to the transformer architecture, …

Integrating Sentiment Analysis In Predictive Models: A Comparative Study On Game Popularity On Steam, Khaleefa Alhemeiri

CMC Senior Theses

Over the past decades, the gaming industry has managed to evolve into a multi-billion-dollar enterprise. Gaming platforms such as Steam foster unprecedented amounts of engagement among players worldwide daily. In this thesis, we investigate the effect of incorporating sentiment-driven metrics, specifically YouTube view counts and positive reviews, into predictive models for game popularity. In addition, by comparing our linear regression sentiment-based approach to the Bayesian hierarchical folded normal model used by De Luisa et al. (2021), we can understand the many differences, strengths, and limitations of each methodology. In our thesis, we focus on three games. Each is of varying …

Solvability Of Stochastic Linear-Quadratic Optimal Control Problems Under Partial Stabilizability Conditions, Al-Sadh Rahman Imadh

Honors Undergraduate Theses

Optimal Control Theory, a branch of Control Theory, is applicable in fields such as engineering, operations research, and economics. Stochastic Optimal Control deals with noisy systems and data using Ito’s formulation. Given a noisy system and a cost functional, the goal is to find a control that will minimize the cost. This thesis focuses on linear quadratic stochastic optimal control, and we explore state equations that are not stabilizable. We first address measurability concerns arising from the semigroup property of the state trajectory. The notions of partial stability and partial stabilizability are introduced, and we formulate their corresponding Lyapunov and …

Mathematics In Amusement Parks, Kacey Laumann

Honors Projects

This project focuses specifically on the Walt Disney World Park, Magic Kingdom. I started by collecting data through the MyDisneyExperience app. By recording the data, I was then able to create polynomial functions to the fifth the degree. Each attraction received a function which allowed me to predict the wait times for that attraction. Then, by graphing the functions and analyzing the graph using calculus the “best time” and “worst time” to go to the attraction were found. After the analysis the information is used to build a unique schedule for a guest. Then the guest receives this schedule after …

Bounding The Convex Hull Relaxation Of The Unit Commitment Problem With The Shapley-Folkman Theorem, Lauren Henderson

All Theses

The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical experiments to study the tightness of this threshold, …

(Si13-07) Optimal Range For Value Of Two-Person Zero-Sum Game Models With Uncertain Payoffs, Sana Afreen, Ajay Kumar Bhurjee

Applications and Applied Mathematics: An International Journal (AAM)

Game theory deals with the decision-making of individuals in conflicting situations with known payoffs. However, these payoffs are imprecisely known, which means they have uncertainty due to vagueness in the data set of most real-world problems. Therefore, we consider a two-person zero-sum game model on a larger scale where the payoffs are imprecise and lie within a closed interval. We define the pure and mixed strategy as well as value for the game models. The proposed method computes the optimal range for the value of the game model using interval analysis. To derive some important results, we establish some lemmas …

Nidus Idearum. Scilogs, Xiv: Superhyperalgebra, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this fourteenth book of scilogs – one may find topics on examples where neutrosophics works and others don’t, law of included infinitely-many-middles, decision making in games and real life through neutrosophic lens, sociology by neutrosophic methods, Smarandache multispace, algebraic structures using natural class of intervals, continuous linguistic set, cyclic neutrosophic graph, graph of neutrosophic triplet group , how to convert the crisp data to neutrosophic data, n-refined neutrosophic set ranking, adjoint of a square neutrosophic matrix, neutrosophic optimization, de-neutrosophication, the n-ary soft set relationship, hypersoft set, extending the hypergroupoid to the superhypergroupoid, alternative ranking, Dezert-Smarandache Theory (DSmT), reconciliation between …

Pt-Symmetry And Eigenmodes, Tamara Gratcheva

University Honors Theses

Spectra of systems with balanced gain and loss, described by Hamiltonians with parity and time-reversal (PT) symmetry is a rich area of research. This work studies by means of numerical techniques, how eigenvalues and eigenfunctions of a Schrodinger operator change as a gain-loss parameter changes. Two cases on a disk with zero boundary conditions are considered. In the first case, within the enclosing disk, we place a parity (P) symmetric configuration of three smaller disks containing gain and loss media, which does not have PT-symmetry. In the second case, we study a PT-symmetric configuration …

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 …

Rsa Algorithm, Evalisbeth Garcia Diazbarriga

ATU Scholars Symposium

I will be presenting about the RSA method in cryptology which is the coding and decoding of messages. My research will focus on proving that the method works and how it is used to communicate secretly.

Fundamental Computational Problems And Algorithms For Superhypergraphs, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Hypergraphs extend traditional graphs by allowing edges (known as hyperedges) to connect more than two vertices, rather than just pairs. This paper explores fundamental problems and algorithms in the context of SuperHypergraphs, an advanced extension of hypergraphs enabling modeling of hierarchical and complex relationships. Topics covered include constructing SuperHyperGraphs, recognizing SuperHyperTrees, and computing SuperHyperTree-width. We address a range of optimization problems, such as the SuperHy-pergraph Partition Problem, Reachability, Minimum Spanning SuperHypertree, and Single-Source Shortest Path. Furthermore, adaptations of classical problems like the Traveling Salesman Problem, Chinese Postman Problem, and Longest Simple Path Problem are presented in the SuperHypergraph framework.

The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It is vital in celestial mechanics, such as planning collision-free satellite orbit trajectories. When beginning to understand the N-body problem, we can start by looking at equal masses of these particles or celestial bodies. As particles move, their position and velocity change, both energy and angular momentum are conserved. Sets of constant energy and angular momentum, known as integral manifolds, are higher-dimensional figures that represent constraints of movement to a system. Integral manifolds are described …

A Reconsideration Of Advanced Concepts In Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, And Chemical Graphs, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

One of the most powerful tools in graph theory is the classification of graphs into distinct classes based on shared properties or structural features. Over time, many graph classes have been introduced, each aimed at capturing specific behaviors or characteristics of a graph. Neutrosophic Set Theory, a method for handling uncertainty, extends fuzzy logic by incorporating degrees of truth, indeterminacy, and falsity. Building on this framework, Neutrosophic Graphs [9,84,135] have emerged as significant generalizations of fuzzy graphs. In this paper, we extend several classes of fuzzy graphs to Neutrosophic graphs and analyze their properties.

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …

Applications Of Survival Estimation Under Stochastic Order To Cancer: The Three Sample Problem, Sage Vantine

Honors Program Theses and Research Projects

Stochastic ordering of probability distributions holds various practical applications. However, in real-world scenarios, the empirical survival functions extracted from actual data often fail to meet the requirements of stochastic ordering. Consequently, we must devise methods to estimate these distribution curves in order to satisfy the constraint. In practical applications, such as the investigation of the time of death or the progression of diseases like cancer, we frequently observe that patients with one condition are expected to exhibit a higher likelihood of survival at all time points compared to those with a different condition. Nevertheless, when we attempt to fit a …

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 …

An Exposition Of The Curvature Of Warped Product Manifolds, Angelina Bisson

Electronic Theses, Projects, and Dissertations

The field of differential geometry is brimming with compelling objects, among which are warped products. These objects hold a prominent place in differential geometry and have been widely studied, as is evident in the literature. Warped products are topologically the same as the Cartesian product of two manifolds, but with distances in one of the factors in skewed. Our goal is to introduce warped product manifolds and to compute their curvature at any point. We follow recent literature and present a previously known result that classifies all flat warped products to find that there are flat examples of warped products …

Rigid Body Constrained Motion Optimization And Control On Lie Groups And Their Tangent Bundles, Brennan S. Mccann

Doctoral Dissertations and Master's Theses

Rigid body motion requires formulations where rotational and translational motion are accounted for appropriately. Two Lie groups, the special orthogonal group SO(3) and the space of quaternions H, are commonly used to represent attitude. When considering rigid body pose, that is spacecraft position and attitude, the special Euclidean group SE(3) and the space of dual quaternions DH are frequently utilized. All these groups are Lie groups and Riemannian manifolds, and these identifications have profound implications for dynamics and controls. The trajectory optimization and optimal control problem on Riemannian manifolds presents significant opportunities for theoretical development. Riemannian optimization is an attractive …

Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim

Electronic Theses, Projects, and Dissertations

Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …

Invariants Of 3-Braid And 4-Braid Links, Mark Essa Sukaiti

Theses

In this study, we established a connection between the Chebyshev polynomial of the first kind and the Jones polynomial of generalized weaving knots of type W(3,n,m).
Through our analysis, we demonstrated that the coefficients of the Jones polynomial of weaving knots are essentially the Whitney numbers of Lucas lattices which allowed us to find an explicit formula for the Alexander polynomial of weaving knots of typeW(3,n).
In addition to confirming Fox’s trapezoidal conjecture, we also discussed the zeroes of the Alexander Polynomial of weaving knots of type W(3,n) as they relate to Hoste’s conjecture. In addition, …

Project Based Learning, Christopher Imm

Sabbatical Projects

Project-based learning (PBL) is a pedagogy which encourages students to be actively involved in their learning process through gaining information to solve real-world problems with projects. In areas of STEM education, PBL can supplement the traditional classroom lecture, where students have a predominantly passive role in the learning process. Through practical activities, interactive discussions, independent reflection and/or team cooperation, students achieve the desired learning outcomes.