Physical Sciences and Mathematics Commons^™

Representation Theory And Its Applications In Physics, Max Varverakis

Master's Theses

Representation theory, which encodes the elements of a group as linear operators on a vector space, has far-reaching implications in physics. Fundamental results in quantum physics emerge directly from the representations describing physical symmetries. We first examine the connections between specific representations and the principles of quantum mechanics. Then, we shift our focus to the braid group, which describes the algebraic structure of braids. We apply representations of the braid group to physical systems in order to investigate quasiparticles known as anyons. Finally, we obtain governing equations of anyonic systems to highlight the differences between braiding statistics and conventional Bose-Einstein/Fermi-Dirac …

Hyperbolic Groups And The Word Problem, David Wu

Master's Theses

Mikhail Gromov’s work on hyperbolic groups in the late 1980s contributed to the formation of geometric group theory as a distinct branch of mathematics. The creation of hyperbolic metric spaces showed it was possible to define a large class of hyperbolic groups entirely geometrically yet still be able to derive significant algebraic properties. The objectives of this thesis are to provide an introduction to geometric group theory through the lens of quasi-isometry and show how hyperbolic groups have solvable word problem. Also included is the Stability Theorem as an intermediary result for quasi-isometry invariance of hyperbolicity.

Dehn's Problems And Geometric Group Theory, Noelle Labrie

Master's Theses

In 1911, mathematician Max Dehn posed three decision problems for finitely

presented groups that have remained central to the study of combinatorial

group theory. His work provided the foundation for geometric group theory,

which aims to analyze groups using the topological and geometric properties

of the spaces they act on. In this thesis, we study group actions on Cayley

graphs and the Farey tree. We prove that a group has a solvable word problem

if and only if its associated Cayley graph is constructible. Moreover, we prove

that a group is finitely generated if and only if it acts geometrically …

Matrix Approximation And Image Compression, Isabella R. Padavana

Master's Theses

This thesis concerns the mathematics and application of various methods for approximating matrices, with a particular eye towards the role that such methods play in image compression. An image is stored as a matrix of values with each entry containing a value recording the intensity of a corresponding pixel, so image compression is essentially equivalent to matrix approximation. First, we look at the singular value decomposition, one of the central tools for analyzing a matrix. We show that, in a sense, the singular value decomposition is the best low-rank approximation of any matrix. However, the singular value decomposition has some …

The Mathematics Of Financial Portfolio Optimization Incorporating Environmental, Social, And Governance Score Information, Ian Driskill

Master's Theses

We numerically investigate the effects that Environmental, Social, and Governance (ESG) scores have on portfolio optimization with Modern Portfolio Theory assumptions and how ESG scores correlate with the market returns of a rated company's stock. Additionally, we review and analyze a research paper published in the Journal of Financial Economics regarding ESG investing titled “Responsible investing: The ESG-efficient frontier” by Pedersen, Fitzgibbons, and Lukasz. Our overall goal is provide insight for socially responsible inclined investors, to help them understand what ESG scores tell us and how those scores may effect their overall investment returns."

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 …

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.

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.

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 …

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 …

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 …

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.

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.

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 …

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 …

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 …

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 …

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 …

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

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 …

Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ

Master's Theses

View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.

In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft Development Training, suggested …