Digital Commons Network^™

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 …

The Construction Of Khovanov Homology, Shiaohan Liu

Master's Theses

Knot theory is a rich topic in topology that studies the how circles can be embedded in Euclidean 3-space. One of the main questions in knot theory is how to distinguish between different types of knots efficiently. One way to approach this problem is to study knot invariants, which are properties of knots that do not change under a standard set of deformations. We give a brief overview of basic knot theory, and examine a specific knot invariant known as Khovanov homology. Khovanov homology is a homological invariant that refines the Jones polynomial, another knot invariant that assigns a Laurent …

Complex Dimensions Of 100 Different Sierpinski Carpet Modifications, Gregory Parker Leathrum

Master's Theses

We used Dr. M. L. Lapidus's Fractal Zeta Functions to analyze the complex fractal dimensions of 100 different modifications of the Sierpinski Carpet fractal construction. We will showcase the theorems that made calculations easier, as well as Desmos tools that helped in classifying the different fractals and computing their complex dimensions. We will also showcase all 100 of the Sierpinski Carpet modifications and their complex dimensions.

Foundations Of Memory Capacity In Models Of Neural Cognition, Chandradeep Chowdhury

Master's Theses

A central problem in neuroscience is to understand how memories are formed as a result of the activities of neurons. Valiant’s neuroidal model attempted to address this question by modeling the brain as a random graph and memories as subgraphs within that graph. However the question of memory capacity within that model has not been explored: how many memories can the brain hold? Valiant introduced the concept of interference between memories as the defining factor for capacity; excessive interference signals the model has reached capacity. Since then, exploration of capacity has been limited, but recent investigations have delved into the …

Solving The Cable Equation, A Second-Order Time Dependent Pde For Non-Ideal Cables With Action Potentials In The Mammalian Brain Using Kss Methods, Nirmohi Charbe

Master's Theses

In this thesis we shall perform the comparisons of a Krylov Subspace Spectral method with Forward Euler, Backward Euler and Crank-Nicolson to solve the Cable Equation. The Cable Equation measures action potentials in axons in a mammalian brain treated as an ideal cable in the first part of the study. We shall subject this problem to the further assumption of a non-ideal cable. Assume a non-uniform cross section area along the longitudinal axis. At the present time, the effects of torsion, curvature and material capacitance are ignored. There is particular interest to generalize the application of the PDEs including and …

Representations From Group Actions On Words And Matrices, Joel T. Anderson

Master's Theses

We provide a combinatorial interpretation of the frequency of any irreducible representation of Sn in representations of Sn arising from group actions on words. Recognizing that representations arising from group actions naturally split across orbits yields combinatorial interpretations of the irreducible decompositions of representations from similar group actions. The generalization from group actions on words to group actions on matrices gives rise to representations that prove to be much less transparent. We share the progress made thus far on the open problem of determining the irreducible decomposition of certain representations of Sm × Sn arising from group actions on matrices.

Groups Of Non Positive Curvature And The Word Problem, Zoe Nepsa

Master's Theses

Given a group $\Gamma$ with presentation $\relgroup{\scr{\scr{A}}}{\scr{R}}$, a natural question, known as the word problem, is how does one decide whether or not two words in the free group, $F(\scr{\scr{A}})$, represent the same element in $\Gamma$. In this thesis, we study certain aspects of geometric group theory, especially ideas published by Gromov in the late 1980's. We show there exists a quasi-isometry between the group equipped with the word metric, and the space it acts on. Then, we develop the notion of a CAT(0) space and study groups which act properly and cocompactly by isometries on these spaces, such groups …

Analyzing Tortuosity In Patterns Formed By Colonies Of Embryonic Stem Cells Using Topological Data Analysis, Jackie Driscoll

Master's Theses

Pluripotent stem cells have been observed to segregate into Turing-like patterns during the early stages of Dox-inducible hiPSC differentiation. In this thesis, we de- velop a tool to quantify the tortuosity in the patterns formed by colonies of pluripo- tent stem cells using methods from topological data analysis. We use clustering techniques and the mapper algorithm to create simplicial complexes representing samples of cells and detail a method of evaluating the tortuosity of these complexes. We use the resulting persistence landscapes and their associated norms to evaluate experimental data and simulated data from an agent based model. This thesis finds …

Deep Learning Recommendations For The Acl2 Interactive Theorem Prover, Robert K. Thompson, Robert K. Thompson

Master's Theses

Due to the difficulty of obtaining formal proofs, there is increasing interest in partially or completely automating proof search in interactive theorem provers. Despite being a theorem prover with an active community and plentiful corpus of 170,000+ theorems, no deep learning system currently exists to help automate theorem proving in ACL2. We have developed a machine learning system that generates recommendations to automatically complete proofs. We show that our system benefits from the copy mechanism introduced in the context of program repair. We make our system directly accessible from within ACL2 and use this interface to evaluate our system in …

Irreducible Representations From Group Actions On Trees, Charlie Liou

Master's Theses

We study the representations of the symmetric group $S_n$ found by acting on

labeled graphs and trees with $n$ vertices. Our main results provide

combinatorial interpretations that give the number of times the irreducible

representations associated with the integer partitions $(n)$ and $(1^n)$ appear

in the representations. We describe a new sign

reversing involution with fixed points that provide a combinatorial

interpretation for the number of times the irreducible associated with the

integer partition $(n-1, 1)$ appears in the representations.

Exploring The Numerical Range Of Block Toeplitz Operators, Brooke Randell

Master's Theses

We will explore the numerical range of the block Toeplitz operator with symbol function \(\phi(z)=A_0+zA_1\), where \(A_0, A_1 \in M_2(\mathbb{C})\). A full characterization of the numerical range of this operator proves to be quite difficult and so we will focus on characterizing the boundary of the related set, \(\{W(A_0+zA_1) : z \in \partial \mathbb{D}\}\), in a specific case. We will use the theory of envelopes to explore what the boundary looks like and we will use geometric arguments to explore the number of flat portions on the boundary. We will then make a conjecture as to the number of flat …

Van Kampen Diagrams And Small Cancellation Theory, Kelsey N. Lowrey

Master's Theses

Given a presentation of G, the word problem asks whether there exists an algorithm to determine which words in the free group, F(A), represent the identity in G. In this thesis, we study small cancellation theory, developed by Lyndon, Schupp, and Greendlinger in the mid-1960s, which contributed to the resurgence of geometric group theory. We investigate the connection between Van Kampen diagrams and the small cancellation hypotheses. Groups that have a presentation satisfying the small cancellation hypotheses C'(1/6), or C'(1/4) and T(4) have a nice solution to the word problem known as Dehn’s Algorithm.

On The Numerical Range Of Compact Operators, Montserrat Dabkowski

Master's Theses

One of the many characterizations of compact operators is as linear operators which
can be closely approximated by bounded finite rank operators (theorem 25). It is
well known that the numerical range of a bounded operator on a finite dimensional
Hilbert space is closed (theorem 54). In this thesis we explore how close to being
closed the numerical range of a compact operator is (theorem 56). We also describe
how limited the difference between the closure and the numerical range of a compact
operator can be (theorem 58). To aid in our exploration of the numerical range of
a compact …

Dynamical Systems And Matching Symmetry In Beta-Expansions, Karl Zieber

Master's Theses

Symbolic dynamics, and in particular β-expansions, are a ubiquitous tool in studying more complicated dynamical systems. Applications include number theory, fractals, information theory, and data storage.

In this thesis we will explore the basics of dynamical systems with a special focus on topological dynamics. We then examine symbolic dynamics and β-transformations through the lens of sequence spaces. We discuss observations from recent literature about how matching (the property that the itinerary of 0 and 1 coincide after some number of iterations) is linked to when T_β,⍺ generates a subshift of finite type. We prove the set of ⍺ in …

An Investigation Into Crouzeix's Conjecture, Timothy T. Royston

Master's Theses

We will explore Crouzeix’s Conjecture, an upper bound on the norm of a matrix after the application of a polynomial involving the numerical range. More formally, Crouzeix’s Conjecture states that for any n × n matrix A and any polynomial p from C → C,
∥p(A)∥ ≤ 2 sup_{z∈W (A)} |p(z)|.
Where W (A) is a set in C related to A, and ∥·∥ is the matrix norm. We first discuss the conjecture, and prove the simple case when the matrix is normal. We then explore a proof for a class of matrices given by Daeshik Choi. We expand …

Unique Signed Minimal Wiring Diagrams And The Stanley-Reisner Correspondence, Vanessa Newsome-Slade

Master's Theses

Biological systems are commonly represented using networks consisting of interactions between various elements in the system. Reverse engineering, a method of mathematical modeling, is used to recover how the elements in the biological network are connected. These connections are encoded using wiring diagrams, which are directed graphs that describe how elements in a network affect one another. A signed wiring diagram provides additional information about the interactions between elements relating to activation and inhibition. Due to cost concerns, it is optimal to gain insight into biological networks with as few experiments and data as possible. Minimal wiring diagrams identify the …

An Introduction To Fröberg's Conjecture, Caroline Semmens

Master's Theses

The goal of this thesis is to make Fröberg's conjecture more accessible to the average math graduate student by building up the necessary background material to understand specific examples where Fröberg's conjecture is true.

Modeling The Spread Of Covid-19 Over Varied Contact Networks, Ryan L. Solorzano

Master's Theses

When attempting to mitigate the spread of an epidemic without the use of a vaccine, many measures may be made to dampen the spread of the disease such as physically distancing and wearing masks. The implementation of an effective test and quarantine strategy on a population has the potential to make a large impact on the spread of the disease as well. Testing and quarantining strategies become difficult when a portion of the population are asymptomatic spreaders of the disease. Additionally, a study has shown that randomly testing a portion of a population for asymptomatic individuals makes a small impact …

A Study Of The Design Of Adaptive Camber Winglets, Justin J. Rosescu

Master's Theses

A numerical study was conducted to determine the effect of changing the camber of a winglet on the efficiency of a wing in two distinct flight conditions. Camber was altered via a simple plain flap deflection in the winglet, which produced a constant camber change over the winglet span. Hinge points were located at 20%, 50% and 80% of the chord and the trailing edge was deflected between -5° and +5°. Analysis was performed using a combination of three-dimensional vortex lattice method and two-dimensional panel method to obtain aerodynamic forces for the entire wing, based on different winglet camber configurations. …

Krylov Subspace Spectral Methods With Non-Homogenous Boundary Conditions, Abbie Hendley

Master's Theses

For this thesis, Krylov Subspace Spectral (KSS) methods, developed by Dr. James Lambers, will be used to solve a one-dimensional, heat equation with non-homogenous boundary conditions. While current methods such as Finite Difference are able to carry out these computations efficiently, their accuracy and scalability can be improved. We will solve the heat equation in one-dimension with two cases to observe the behaviors of the errors using KSS methods. The first case will implement KSS methods with trigonometric initial conditions, then another case where the initial conditions are polynomial functions. We will also look at both the time-independent and time-dependent …

The Martingale Approach To Financial Mathematics, Jordan M. Rowley

Master's Theses

In this thesis, we will develop the fundamental properties of financial mathematics, with a focus on establishing meaningful connections between martingale theory, stochastic calculus, and measure-theoretic probability. We first consider a simple binomial model in discrete time, and assume the impossibility of earning a riskless profit, known as arbitrage. Under this no-arbitrage assumption alone, we stumble upon a strange new probability measure Q, according to which every risky asset is expected to grow as though it were a bond. As it turns out, this measure Q also gives the arbitrage-free pricing formula for every asset on our market. In …

The Long-Run Effects Of Tropical Cyclones On Infant Mortality, Isabel Miranda

Master's Theses

In the United States alone, each tropical cyclone causes an average of $14.6 billion worth of damages. In addition to the destruction of physical infrastructure, natural disasters also negatively impact human capital formation. These losses are often more difficult to observe, and therefore, are over looked when quantifying the true costs of natural disasters. One particular effect is an increase in infant mortality rates, an important indicator of a country’s general socioeconomic level. This paper utilizes a model created by Anttila-Hughes and Hsiang, that takes advantage of annual variation in tropical cyclones using annual spatial average maximum wind speeds and …

Lorentz Invariant Spacelike Surfaces Of Constant Mean Curvature In Anti-De Sitter 3-Space, Jamie Patrick Lambert

Master's Theses

In this thesis, I studied Lorentz invariant spacelike surfaces with constant mean curvature H = c in the anti-de Sitter 3-space H³₁(−c²) of constant curvature −c². In particular, I construct Lorentz invariant spacelike surfaces of constant mean curvature c and maximal Lorentz invariant spacelike surfaces in H³₁(−c²). I also studied the limit behavior of those constant mean curvature c surfaces in H³₁(−c²). It turns out that they approach a maximal catenoid in Minkowski 3-space E³₁ as c → …

The Integration Of Kinesthetic Learning Through The Math & Movement Program: Pilot Study 2015, Benjamin Ferder

Master's Theses

Purpose: The primary purpose of this pilot study was to verify that the use of kinesthetic learning (Math & Movement Program) in the classroom increases retention of multiplication facts at a greater rate than traditional drill and practice. The Math & Movement Program uses a kinesthetic learning-based approach for practicing, learning, and memorizing mathematics through the incorporation of bodily movement(s). Participants: The directors of the research project for the participating school district selected the sample of convenience. The population size of this study included 213 third and fourth grade students during the second half of the 2011-2012 school years. Data …

The Structure And Properties Of Clique Graphs Of Regular Graphs, Jan Burmeister

Master's Theses

In the following thesis, the structure and properties of G and its clique graph cl_t (G) are analyzed for graphs G that are non-complete, regular with degree δ , and where every edge of G is contained in a t -clique. In a clique graph cl_t (G), all cliques of order t of the original graph G become the clique graph’s vertices, and the vertices of the clique graph are adjacent if and only if the corresponding cliques in the original graph have at least 1 vertex in common. This thesis mainly investigates if …

Weierstrass Points On Families Of Graphs, William D. Lindsay Jr.

Master's Theses

No abstract provided.

Computable Linear Orders And Turing Reductions, Whitney P. Turner

Master's Theses

This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations.

Approximation Of Elements Of Exponentials Of Differential Operators With Rational Quadrature, Daniel Elwood Lanterman

Master's Theses

We explore the possibility of improving the accuracy of approximations of elements of exponentials of differential operators, by using a rational function, instead of a polynomial function, as the interpolating function. Since a rational function behaves more like a decaying exponential function, it seems logical that the approximation should be more accurate. Through the use of high accuracy rational interpolants, we experiment with a numerical integration method to determine explicitly whether the error produced by a rational type approximation will indeed be less than that produced by a polynomial type approximation.

A Comparison Of Two Boundary Methods For Biharmonic Boundary Value Problems, Jaeyoun Oh

Master's Theses

The purpose of this thesis is to solve biharmonic boundary value problems using two different boundary methods and compare their performances. The two boundary methods used are the method of fundamental solutions (MFS) and the method of approximate fundamental solutions (MAFS). The Delta-shaped basis function with the Abel regularization technique is used in the construction of the approximate fundamental solutions in MAFS. The MFS produces more accurate results but needs known fundamental solutions for the differential operator. The MAFS can provide comparable results, and is applicable to more general differential operators. The numerical results using both methods are presented.

Rapid Approximation Of Bilinear Forms Involving Matrix Functions Through Asymptotic Analysis Of Gaussian Node Placement, Elisabeth Marie Palchak

Master's Theses

Technological advancements have allowed computing power to generate high resolution model s. As a result, greater stiffness has been introduced into systems of ordinary differential equations (ODEs) that arise from spatial discreti zation of partial differential equations (PDEs). The components of the solutions to these systems are coupled and changing at widely varying rates, which present problems for time-stepping methods. Krylov Subspace Spectral methods, developed by Dr. James Lambers, bridge the gap between explicit and implicit methods for stiff problems by computing each Fouier coefficient from an individualized approximation of the solution operator. KSS methods demonstrate a high order of …