Mathematics Commons^™

How To Make A Neural Network Learn From A Small Number Of Examples -- And Learn Fast: An Idea, Chitta Baral, Vladik Kreinovich

Departmental Technical Reports (CS)

Current deep learning techniques have led to spectacular results, but they still have limitations. One of them is that, in contrast to humans who can learn from a few examples and learn fast, modern deep learning techniques require a large amount of data to learn, and they take a long time to train. In this paper, we show that neural networks do have a potential to learn from a small number of examples -- and learn fast. We speculate that the corresponding idea may already be implicitly implemented in Large Language Models -- which may partially explain their (somewhat mysterious) …

Counting Hamming-Graceful Labelings Of Paths, Ashka Dalal

Mathematical Sciences Technical Reports (MSTR)

Let Γ be a graph of m edges and n vertices. A Hamming-graceful labeling of Γ labels vertices with binary strings of length m and the edge labels are induced by the Hamming distance between vertex labels. It is known that all paths have Hamming-graceful labelings, thus the question arises, how many possible labelings exist for a path of a given size. We develop an algebraic way to generate labelings, conjecture a method for counting, prove this for small examples, and verify larger examples using a Python program.

Statistical Modeling Of Right-Censored Spatial Data Using Gaussian Random Fields, Fathima Z. Sainul Abdeen, Akim Adekpedjou, Sophie Dabo Niang

Mathematics and Statistics Faculty Research & Creative Works

Consider a Fixed Number of Clustered Areas Identified by their Geographical Coordinates that Are Monitored for the Occurrences of an Event Such as a Pandemic, Epidemic, or Migration. Data Collected on Units at All Areas Include Covariates and Environmental Factors. We Apply a Probit Transformation to the Time to Event and Embed an Isotropic Spatial Correlation Function into Our Models for Better Modeling as Compared to Existing Methodologies that Use Frailty or Copula. Composite Likelihood Technique is Employed for the Construction of a Multivariate Gaussian Random Field that Preserves the Spatial Correlation Function. the Data Are Analyzed using Counting Process …

Key Benefits Of Small Group Instruction For Diverse Learners, Lydia Mcevoy

Master's Theses

Utilizing a mixed method approach this research study investigated the effects of small group instruction on the learning of diverse learners. Informed by a preliminary literature review that supports the use of small-group instruction, the researcher conducted a small-scale action research project to focus on three diverse learners in a 1st-grade classroom over four weeks. One of the findings of this project shows that small group instruction helps promote social and emotional skills as students feel more comfortable interacting with peers in a small group rather than in a whole group. Another finding indicates that students feel more encouraged by …

Fundamental 2-Quandles Of The M(1/2, 1/3, 1/3; K) Montesino Knots, Alex Abrams

Mathematics Theses

Every oriented knot has an associated fundamental quandle. Except in two simple cases, these quandles have infinite order. For every integer n>1, there is a quotient of the fundamental quandle called the n-quandle of the knot. In some cases, these n-quandles may be finite. In the case of the M(1/2,1/3,1/3; k) Montesino knot family, the 2-quandle is finite. In this paper, we investigate the structure of the 2-quandle and prove its size.

Murmurations And Root Numbers, Alexey Pozdnyakov

University Scholar Projects

We report on a machine learning investigation of large datasets of elliptic curves and L-functions. This leads to the discovery of murmurations, an unexpected correlation between the root numbers and Dirichlet coefficients of L-functions. We provide a formal definition of murmurations, describe the connection with 1-level density, and provide three examples for which the murmuration phenomenon has been rigorously proven. Using our understanding of murmurations, we then build new machine learning models in search of a polynomial time algorithm for predicting root numbers. Based on our models and several heuristic arguments, we conclude that it is unlikely for …

How Can We Explain Empirical Formulas For Shrinkage Cracking Of Cement-Stabilized Pavement Layers, Edgar Daniel Rodriguez Velasquez, Vladik Kreinovich

Departmental Technical Reports (CS)

In pavement construction, one of the frequent defects is shrinkage cracking of the cement-stabilized pavement layer. To minimize this defect, it is important to be able to predict how this cracking depends on the quantities describing the pavement layer and the corresponding environment. Cracking is usually described by two parameters: the average width of the crack and the crack spacing. Empirical analysis shows that the dependence of the width on all related quantities is described by a power law. Power laws are ubiquitous in physics, they describe a frequent case when the dependence is scale-invariant -- i.e., does not change …

Understanding Perspectives Of Power In A College Mathematics Classroom, Laura Seeberger

Honors College Theses

Power is embedded in teacher and student actions within mathematics classrooms, whether that power is known or not. Incorporating equity and inclusiveness requires a deeper understanding of this power behind actions. In this study, we developed and administered a three part survey questioning college faculty and college students how they perceive power related to common actions within a college mathematics classroom. For example, participants were asked whether a college math teacher assigning homework increased, decreased, or did both to the teacher’s power; then whether this action increased, decreased, or did both to a student’s power. Analysis of 16 faculty and …

On Distortion Of Surface Groups In Right-Angled Artin Groups, Lucas Bridges

Mathematical Sciences Undergraduate Honors Theses

Surfaces have long been a topic of interest for scholars inside and outside of mathe- matics. In a topological sense, surfaces are spaces which appear flat on a local scale. Surfaces in this sense have a restricted set of properties, including the behavior of loops around a surface, codified in the fundamental group.

All but 3 surface groups have been shown to embed into a class of groups called right-angled Artin groups. The method through which these embeddings are created places large restrictions on all homomorphisms from surface groups to right-angled Artin groups.

One such restriction on these homomorphisms is …

Tasks For Learning Trigonometry, Sydnee Andreasen

All Graduate Reports and Creative Projects, Fall 2023 to Present

Many studies have been done using task-based learning within different mathematics courses. Within the field of trigonometry, task-based learning is lacking. The following research aimed to create engaging, mathematically rich tasks that meet the standards for the current trigonometry course at Utah State University and align with the State of Utah Core Standards for 7th through 12th grades. Four lessons were selected and developed based on the alignment of standards, the relevance to the remainder of the trigonometry course, and the relevance to courses beyond trigonometry. The four lessons that were chosen and developed were related to trigonometric ratios, graphing …

Geometric Principles In Architecture Aesthetics, Vincent Gemmiti

Architecture Undergraduate Honors Theses

This study focuses on geometric formalism in three major monuments across different architectural eras in time. The use of three distinct geometric principles to outline the use of pure or manufactured shapes and figures helps to discover and isolate an aesthetic component of architecture within which it is contained. A collection of studies are implemented and are focused on orthographic drawings from each monument in horizontality and verticality, consisting of a dual set of overlay and interpretative drawings for each type of orthographic representation for each monument. A discussion follows and highlights the changes or similarities over time the role …

Modeling Prices In Limit Order Book Using Univariate Hawkes Point Process, Wenqing Jiang

LSU New Orleans Theses and Dissertations

This thesis presents a time-changed geometric Brownian price model with the univariate Hawkes processes to trace the price changes in a limit order book. Limit order books are the core mechanism for trading in modern financial markets, continuously collecting outstanding buy and sell orders from market participants. The arrival of orders causes fluctuations in prices over time. A Hawkes process is a type of point process that exhibits self-exciting behavior, where the occurrence of one event increases the probability of other events happening in the near future. This makes Hawkes processes well-suited for capturing the clustered arrival patterns of orders …

Multicolor Bipartite Ramsey Numbers Of Balanced Double Stars, Ella Oren-Dahan

Theses, Dissertations and Culminating Projects

Given an integer n ≥ 1, the balanced double star Sn,n is a tree consisting of two vertex disjoint stars with n leaves each, connected at their central vertices by an edge. Given r ≥ 2, we consider the problem of finding the smallest integer N such that every r-colored complete bipartite graph KN,N contains a monochromatic copy of the balanced double star Sn,n. This question is an instance of a problem within Ramsey theory. In this thesis, we cover the history of Ramsey theory and our problem in general, provide an alternative approach to prove the two colored case, …

On The Number Of Strong Dominating Sets In A Graph, Frankie Mennicucci

Theses, Dissertations and Culminating Projects

This thesis investigates various problems related to the number of strong dominating sets in a graph. Given a graph G, a set of vertices D is said to be dominating if every vertex outside of D has a neighbor in D. Bród and Skupién proved that the number of dominating sets in a tree T on n vertices is at most 2ⁿ⁻¹ + 1. A set S of vertices in a graph G is a strong dominating set if every vertex x outside of S has a neighbor y ∈ S with d(y) ≥ d(x). We investigate the number of …

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 …

A Central Limit Theorem For The Number Of Excursion Set Components Of Gaussian Fields, Dmitry Beliaev, Michael Mcauley, Stephen Muirhead

Articles

For a smooth stationary Gaussian field f on R^d and level ℓ ∈ R, we consider the number of connected components of the excursion set {f ≥ ℓ} (or level set {f = ℓ}) contained in large domains. The mean of this quantity is known to scale like the volume of the domain under general assumptions on the field. We prove that, assuming sufficient decay of correlations (e.g. the Bargmann-Fock field), a central limit theorem holds with volume-order scaling. Previously such a result had only been established for ‘additive’ geometric functionals of the excursion/level sets (e.g. the volume or …

A Statistical Look Into How Common Soccer Metrics Influence Expected Goal Measures In The Professional Game, Tristan George Rumsey

Undergraduate Honors Thesis Collection

The advent of sports analytics has ignited a fervor across all sporting disciplines, particularly soccer, where clubs are sprinting to harness vast data reserves to elevate team performance, spearhead effective marketing endeavors, and bolster financial gains crucial for club expansion. Much like Billy Beane's transformative "Moneyball" approach, soccer clubs are in pursuit of innovative strategies to transcend financial limitations and achieve triumph. In soccer, where goals are scarce commodities, heightened offensive efficacy becomes imperative. Presently, one metric stands out as pivotal in gauging a team's goal-scoring success: expected goals (xG). This metric quantifies the likelihood of a given shot or …

New Algorithms For The Multiplication Table Problem, Evan Blom

Undergraduate Honors Thesis Collection

In 1955, Paul Erdős initiated the study of a function that counts the number of distinct integers in an (n × n) multiplication table. That is, he studied M(n) = |{i · j, 1 ≤ i, j ≤ n}|. Much research has been done in regards to both asymptotic and exact approximations of M(n) for increasingly large values of n. Recently, Brent et. al. investigated the algorithmic cost in computing this function. Instead of computing M(n) directly, their approach was to compute it incrementally. That is, given M(n−1), they could quickly compute M(n) using another function δ(n) to count the …

The Nature Of Undergraduate Calculus I Students' Participation In The Parallel Spaces Of Coursework And Peer-Led, Cooperative, Inquiry-Oriented Complementary Instruction, Karmen T. Yu

Theses, Dissertations and Culminating Projects

Calculus has long been known as a “gateway course” to STEM fields in postsecondary education. To moderate this gatekeeping effect, Montclair State University researchers developed a peer-led, inquiry-based instructional support (IBIS) to run parallel to Calculus classes. The design of the IBIS model was informed by an instructional approach called Complex Instruction (CI) and two other peer-led, cooperative learning models, Peer-Led Team Learning (PLTL) and Supplemental Instruction (SI). While the literature on peer-led models of cooperative learning confirms their effectiveness on undergraduate students’ academic outcomes in mathematics, this multiple-case study set out to address the following: What is the nature …

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 …