Mathematics Commons^™

Reducing Generalization Error In Multiclass Classification Through Factorized Cross Entropy Loss, Oleksandr Horban

CMC Senior Theses

This paper introduces Factorized Cross Entropy Loss, a novel approach to multiclass classification which modifies the standard cross entropy loss by decomposing its weight matrix W into two smaller matrices, U and V, where UV is a low rank approximation of W. Factorized Cross Entropy Loss reduces generalization error from the conventional O( sqrt(k / n) ) to O( sqrt(r / n) ), where k is the number of classes, n is the sample size, and r is the reduced inner dimension of U and V.

Unveiling The Power Of Shor's Algorithm: Cryptography In A Post Quantum World, Dylan Phares

CMC Senior Theses

Shor's Algorithm is an extremely powerful tool, in utilizing this tool it is important to understand how it works and why it works. As well as the vast implications it could have for cryptography

Bridging Theory And Application: A Journey From Minkowski's Theorem To Ggh Cryptosystems In Lattice Theory, Danzhe Chen

CMC Senior Theses

This thesis provides a comprehensive exploration of lattice theory, emphasizing its dual significance in both theoretical mathematics and practical applications, particularly within computational complexity and cryptography. The study begins with an in-depth examination of the fundamental properties of lattices and progresses to intricate lattice-based problems such as the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). These problems are analyzed for their computational depth and linked to the Subset Sum Problem (SSP) to highlight their critical roles in understanding computational hardness. The narrative then transitions to the practical applications of these theories in cryptography, evaluating the shift from …

Maximizing The Number Of H-Colorings Of Graphs With A Fixed Minimum Degree, John Engbers

Mathematical and Statistical Science Faculty Research and Publications

For graphs G and H, an H-coloring of G is an adjacency-preserving map from the vertex set of G to the vertex set of H.

On Cyclically 4-Connected Cubic Graphs, R. J. Kingan, S. R. Kingan

Publications and Research

A 3-connected cubic graph is cyclically 4-connected if it has at least n ≥ 8 vertices and when removal of a set of three edges results in a disconnected graph, only one component has cycles. By introducing the notion of cycle spread to quantify the distance between pairs of edges, we get a new characterization of cyclically 4-connected graphs. Let Q_n and V_n denote the ladder and Möbius ladder on n ≥ 8 vertices, respectively. We prove that a 3-connected cubic graph G is cyclically 4-connected if and only if G is either the Petersen graph, Q …

Time-Efficient Filtering Of Imaging Polarimetric Data By Checking Physical Realizability Of Experimental Mueller Matrices, Tatiana Novikova, Alexey Ovchinnikov, Gleb Pogudin, Jessica C. Ramella-Roman

Publications and Research

Motivation: Imaging Mueller polarimetry has already proved its potential for biomedicine, remote sensing, and metrology. The real-time applications of this modality require both video rate image acquisition and fast data post-processing algorithms. First, one must check the physical realizability of the experimental Mueller matrices in order to filter out non-physical data, i.e. to test the positive semi-definiteness of the 4 × 4 Hermitian coherency matrix calculated from the elements of corresponding Mueller matrix pixel-wise. For this purpose, we compared the execution time for the calculations of (i) eigenvalues, (ii) Cholesky decomposition, (iii) Sylvester’s criterion, and (iv) coefficients of the characteristic …

Legendrian Torus And Cable Links, Jennifer Dalton,, John B. Etnyre, Lisa Traynor

Mathematics Faculty Research and Scholarship

We give a classification of Legendrian torus links. Along the way, we give the first classification of infinite families of Legendrian links where some smooth symmetries of the link cannot be realized by Legendrian isotopies. We also give the first family of links that are non-destabilizable but do not have maximal Thurston-Bennequin invariant and observe a curious distribution of Legendrian torus knots that can be realized as the components of a Legendrian torus link. This classification of Legendrian torus links leads to a classification of transversal torus links.

We also give a classification of Legendrian and transversal cable links of …

Improveing F-Beta Score In Classifying Shark Data Into Shark Behaviors, Ibrahim M. Ali

CGU Theses & Dissertations

One metric used to measure classification performance in machine learning is F-beta score. The objective in this thesis is to improve the average F-b score computed in classifying shark data into shark behaviors, namely; Resting, Swimming, Feeding, and Non-Directed Motion (NDM). Synthetic Minority Oversampling Technique (SMOTE) and Adaptive Synthetic Sampling (ADASYN) are utilized to balance the data, from which pre-processed Fast Fourier Transform (FFT), Walsh-Hadamard Transform (WHT), and Autocorrelation (AC) features are extracted then classified using Convolutional Neural Network (CNN) and K-Nearest Neighbors (K-NN). All the combinations of the two balancing techniques, the three feature types, and the two machine …

On Stratified Single-Valued Soft Topogenous Structures, Fahad Alsharari, Yaser Saber, Hanan Alohali, Mesfer H. Alqahtani, Mubarak Ebodey, Tawfik Elmasry, Jafar Alsharif, Amal F. Soliman, Florentin Smarandache, Fahad Sikander

Branch Mathematics and Statistics Faculty and Staff Publications

This paper presents novel concepts including stratified single-valued neutrosophic soft topogenous (stratified svns-topogenous), stratified single-valued neutrosophic soft filter (stratified svns-filter), stratified single-valued neutrosophic soft quasi uniformity (stratified svnsq-uniformity) and stratified single-valued neutrosophic soft quasi proximity (stratified svnsq-proximity). Additionally, we present the idea of single-valued neutrosophic soft topogenous structures, formed by integrating svns-topogenous with svns-filter, and discuss their properties. Furthermore, we explore the connections between these single-valued neutrosophic soft topological structures and their corresponding stratifications.

A Compact Exploration Of Turiyam Neutrosophic Competition Graphs, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Graph theory, a branch of mathematics, examines relationships between entities using vertices and edges. Within this field, Uncertain Graph Theory has emerged to model uncertainties in real-world networks. A notable concept in this area is the competition graph, which captures interactions by connecting vertices that “compete” for the same neighbor, represented by directed edges indicating common neighbors in a digraph. This brief paper introduces the concept of the Generalized Turiyam Neutrosophic Competition Graph and explores its relationships with other graph classes.

Numerical Investigation And Statistical Analysis Of The Flow Patterns Behind Square Cylinders Arranged In A Staggered Configuration Utilizing The Lattice Boltzmann Method, M. Abid, N. Yasin, M. Saqlain, S. Ul-Islam, S. Ahmad

Mathematics & Statistics Faculty Publications

Flow past bluff bodies like square cylinders is important in engineering applications, but flow patterns behind staggered cylinder arrangements remain poorly understood. Existing studies have focused on tandem or side-by-side configurations, while offset orientations have received less attention. The aim of this paper is to numerically investigate flow dynamics and force characteristics behind two offset square cylinders using the single relaxation time lattice Boltzmann method. The effects of changing both the Reynolds number (Re = 1-150) and gap spacing ratio (g* = 0.5-5) between the cylinders are analyzed. Instantaneous vorticity contours, time histories of drag and lift coefficients, power spectra …

Shadow Hands: Solutions For Fermi Questions, September 2024, John Adam

Mathematics & Statistics Faculty Publications

The article titled "Shadow hands: Solutions for Fermi Questions, September 2024" discusses the enigmatic statement made by authors Dave Lynch and Bill Livingston in their book "Color and Light in Nature." The statement explains that the fuzzy outer edge of a shadow, known as the penumbra, is always a constant fraction of about 1/112 of its width divided by its distance from the object casting the shadow. The article provides a solution to Question 1, which asks for an explanation of this statement using elementary geometry. It also offers a solution to Question 2, which asks why the shadow of …

Numerical Solution Of Hybrid Nanofluid And Its Stability Over Permeable Wedge Sheet With Heat Transfer Analysis, Aisha M. Alqahtani, Zeeshan, Waris Khan, Florentin Smarandache, Nidhal Becheikh, Roobaea Alroobaea, Taseer Muhammad

Branch Mathematics and Statistics Faculty and Staff Publications

The inclusion of nanoparticles has the potential to improve the thermal efficiency of the base fluid. The field of nanofluid (NF) dynamics has attracted important attention due to its extensive range of practical uses like fuel cells, solar energy, medication administration, heat transfer, microfabrication, coolant applications, and other related domains. The aim of this study is to scrutinize the impact of Lorentz force, thermal energy, joule heating, heat source and injection parameters, and Brownian and thermoporetic diffusions on the hybrid nanofluid over the moving wedge. The stability inquiry is reported for the existing work in order to confirm the stable …

Note On The Spectra Of Steiner Distance Hypermatrices, Joshua Cooper, Zhibin Du

Faculty Publications

The Steiner distance of a set of vertices in a graph is the fewest number of edges in any connected subgraph containing those vertices. The order-k Steiner distance hypermatrix of a graph is the n-dimensional array indexed by vertices, whose entries are the Steiner distances of their corresponding indices. In the case of k = 2, this reduces to the classical distance matrix of a graph. Graham and Pollak showed in 1971 that the determinant of the distance matrix of a tree only depends on its number n of vertices. Here, we show that the hyperdeterminant of the Steiner distance …

The Direct And Inverse Scattering Problems For The Third-Order Operator, Ivan Toledo

Mathematics Dissertations - Archive

We consider the full-line direct and inverse scattering problems for the third-order ordinary differential equation containing two potentials decaying sufficiently fast at infinity. The direct scattering problem consists of the determination of the scattering data set when the two potentials are known. The scattering data set is made up of the corresponding scattering coefficients and the bound-state information. On the other hand, the inverse scattering problem involves the recovery of the two potentials when the scattering data set is available. We formulate the inverse scattering problem via a related Riemann--Hilbert problem on the complex plane. We describe the recovery of …

Bicategorical Character Theory, Travis Wheeler

Theses and Dissertations--Mathematics

In 2007, Nora Ganter and Mikhail Kapranov defined the categorical trace, which they used to define the categorical character of a 2-representation. In 2008, Kate Ponto defined a shadow functor for bicategories. With the shadow functor, Dr. Ponto defined the bicategorical trace, which is a generalization of the symmetric monoidal trace for bicategories. How are these two notions of trace related to one another? We’ve used bicategorical traces to define a character theory for 2-representations, and the categorical character is an example.

Properties Of Skew-Polynomial Rings And Skew-Cyclic Codes, Kathryn Hechtel

Theses and Dissertations--Mathematics

A skew-polynomial ring is a polynomial ring over a field, with one indeterminate x, where one must apply an automorphism to commute coefficients with x. It was first introduced by Ore in 1933 and since the 1980s has been used to study skew-cyclic codes. In this thesis, we present some properties of skew-polynomial rings and some new constructions of skew-cyclic codes. The dimension of a skew-cyclic code depends on the degree of its generating skew polynomial. However, due to the skew-multiplication rule, the degree of a skew polynomial can be smaller than its number of roots and hence tricky to …

Adams Operations On The Burnside Ring From Power Operations, Lewis Dominguez

Theses and Dissertations--Mathematics

Topology furnishes us with many commutative rings associated to finite groups. These include the complex representation ring, the Burnside ring, and the G-equivariant K-theory of a space. Often, these admit additional structure in the form of natural operations on the ring, such as power operations, symmetric powers, and Adams operations. We will discuss two ways of constructing Adams operations. The goal of this work is to understand these in the case of the Burnside ring.

Pairs Of Quadratic Forms Over P-Adic Fields, John Hall

Theses and Dissertations--Mathematics

Given two quadratic forms $Q_1, Q_2$ over a $p$-adic field $K$ in $n$ variables, we consider the pencil $\mathcal{P}_K(Q_1, Q_2)$, which contains all nontrivial $K$-linear combinations of $Q_1$ and $Q_2$. We define $D$ to be the maximal dimension of a subspace in $K^n$ on which $Q_1$ and $Q_2$ both vanish. We define $H$ to be the maximal number of hyperbolic planes that a form in $\mathcal{P}_K(Q_1, Q_2)$ splits off over $K$. We will determine which values for $(D, H)$ are possible for a nonsingular pair of quadratic forms over a $p$-adic field $K$.

Dirichlet Problems In Perforated Domains, Robert Righi

Theses and Dissertations--Mathematics

We establish W^1,p estimates for solutions u_ε to the Laplace equation with Dirichlet boundary conditions in a bounded C¹ domain Ω_{ε, η} perforated by small holes in ℝ^d. The bounding constants will depend explicitly on epsilon and eta, where epsilon is the order of the minimal distance between holes, and eta denotes the ratio between the size of the holes and epsilon. The proof relies on a large-scale L^p estimate for ∇u_ε, whose proof is divided into two main parts. First, we show that solutions of an intermediate problem for a …

Slₖ-Tilings And Paths In ℤᵏ, Zachery T. Peterson

Theses and Dissertations--Mathematics

An SLₖ-frieze is a bi-infinite array of integers where adjacent entries satisfy a certain diamond rule. SL₂-friezes were introduced and studied by Conway and Coxeter. Later, these were generalized to infinite matrix-like structures called tilings as well as higher values of k. A recent paper by Short showed a bijection between bi-infinite paths of reduced rationals in the Farey graph and SL₂-tilings. We extend this result to higher k by constructing a bijection between SLₖ-tilings and certain pairs of bi-infinite strips of vectors in ℤᵏ called paths. The key ingredient in the proof is the relation to Plucker friezes and …

A Multiple-Case Study On The Impact Of An Introductory Real Analysis Course On Undergraduate Students' Understanding Of Function Continuity, Ryan Joseph Rogers

Theses and Dissertations--Mathematics

Undergraduate students' understanding of function continuity has not been explored broadly in previous research. The relevant findings in the literature are predominantly concerned with calculus students' understanding and misconceptions of continuity. Many of these misunderstandings are tied to the relationships which continuity has with limits and differentiability. This multiple-case study explores how, if at all, an introductory real analysis course impacts undergraduate students' understanding of function continuity and its connections to the notions of limits and differentiability. We embed our findings within the theoretical framework of Tall's three worlds of mathematics, namely, the embodied, symbolic, and formal worlds.

The cases …

Advanced Mathematical Graph-Based Machine Learning And Deep Learning Models For Drug Design, Farjana Tasnim Mukta

Theses and Dissertations--Mathematics

Drug discovery is a highly complicated and time-consuming process. One of the main challenges in drug development is predicting whether a drug-like molecule will interact with a specific target protein. This prediction accelerates target validation and drug development. Recent research in biomolecular sciences has shown significant interest in algebraic graph-based models for representing molecular complexes and predicting drug-target binding affinity. In this thesis, we present algebraic graph-based molecular representations to create data-driven scoring functions (SF) using extended atom types to capture wide-range interactions between targets and drug candidates. Our model employs multiscale weighted colored subgraphs for the protein-ligand complex, colored …

Neural Correlates Of Audiovisual Narrative Speech Perception In Children And Adults On The Autism Spectrum: A Functional Magnetic Resonance Imaging Study, Lars A. Ross, Sophie Molholm, John S. Butler, Victor A. Del Bene, Tufikameni Brima, John J. Foxe

Articles

Autistic individuals show substantially reduced benefit from observing visual articulations during audiovisual speech perception, a multisensory integration deficit that is particularly relevant to social communication. This has mostly been studied using simple syllabic or word-level stimuli and it remains unclear how altered lower-level multisensory integration translates to the processing of more complex natural multisensory stimulus environments in autism. Here, functional neuroimaging was used to examine neural correlates of audiovisual gain (AV-gain) in 41 autistic individuals to those of 41 age-matched non-autistic controls when presented with a complex audiovisual narrative. Participants were presented with continuous narration of a story in auditory-alone, …

Modeling Inflation Using A Fast Fourier Transform (Fft), Blake Smith

Williams Honors College, Honors Research Projects

This paper utilizes a Fast Fourier Transform (FFT) algorithm to construct a trigonometric interpolant for the Consumer Price Index (CPI), which is then differentiated and used to obtain a continuous function for “instantaneous” (i.e., month-wise) inflation, as opposed to a 12-month percent-change. Fourier coefficients are analyzed to investigate underlying periodicities in the newly constructed function. This metric does not hold significant predictive value but it may prove helpful in retroactive analysis of inflation trends.

Multiple Imputation For Robust Cluster Analysis To Address Missingness In Medical Data, Arnold Harder, Gayla R. Olbricht, Godwin Ekuma, Daniel B. Hier, Tayo Obafemi-Ajayi

Mathematics and Statistics Faculty Research & Creative Works

Cluster Analysis Has Been Applied To A Wide Range Of Problems As An Exploratory Tool To Enhance Knowledge Discovery. Clustering Aids Disease Subtyping, I.e. Identifying Homogeneous Patient Subgroups, In Medical Data. Missing Data Is A Common Problem In Medical Research And Could Bias Clustering Results If Not Properly Handled. Yet, Multiple Imputation Has Been Under-Utilized To Address Missingness, When Clustering Medical Data. Its Limited Integration In Clustering Of Medical Data, Despite The Known Advantages And Benefits Of Multiple Imputation, Could Be Attributed To Many Factors. This Includes Methodological Complexity, Difficulties In Pooling Results To Obtain A Consensus Clustering, Uncertainty Regarding …

Centers Of N-Degree Poncelet Circles, Georgia Corbett

Honors Theses

Given a circle inscribed in a polygon inscribed in the unit circle, if one connects all the vertices with line segments we get a family of circles called a package of Poncelet circles, due to its connection to a theorem of Poncelet. We are interested in where the centers of the Poncelet circles can be. Specifically, we have shown that if one of the circles in the Poncelet package is centered at 0, then all of the circles must be centered at 0 as well. This was proven by Spitkovsky and Wegert in 2021 using elliptic integrals but we …

Applications And Analysis Of Nlp Deep Learning Models For Antibiotic's Side Effects Classifications, An Ly

CGU Theses & Dissertations

I introduce a novel recursive modification to the classical Goemans-Williamson MaxCut algorithm, offering improved performance in vectorized data clustering tasks. Focusing on the clustering of medical publications, I suggest to employ recursive iterations in conjunction with a dimension relaxation method to enhance density of clustering results. Furthermore, I propose a new vectorization technique for articles, leveraging conditional probabilities for more effective clustering. I believe that these methods will provide advantages in both computational efficiency and clustering accuracy. I will analyze the effectiveness of recursive iterations and higher-dimensional generalizations of the GWA in the hopes of achieving more accurate dissimilarity-based clustering. …

Berglund–Hübsch Transpose Rule And Sasakian Geometry, Ralph R. Gomez

Mathematics & Statistics Faculty Works

We apply the Berglund–Hübsch transpose rule from BHK mirror symmetry to show that to an n−1-dimensional Calabi–Yau orbifold in weighted projective space defined by an invertible polynomial, we can associate four (possibly) distinct Sasaki manifolds of dimension 2n+1 which are n−1-connected and admit a metric of positive Ricci curvature. We apply this theorem to show that for a given K3 orbifold, there exist four seven-dimensional Sasakian manifolds of positive Ricci curvature, two of which are actually Sasaki–Einstein.

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 …