Digital Commons Network^™

Multi-Trace Matrix Models From Noncommutative Geometry, Hamed Hessam

Electronic Thesis and Dissertation Repository

Dirac ensembles are finite dimensional real spectral triples where the Dirac operator is allowed to vary within a suitable family of operators and is assumed to be random. The Dirac operator plays the role of a metric on a manifold in the noncommutative geometry context of spectral triples. Thus, integration over the set of Dirac operators within a Dirac ensemble, a crucial aspect of a theory of quantum gravity, is a noncommutative analog of integration over metrics.

Dirac ensembles are closely related to random matrix ensembles. In order to determine properties of specific Dirac ensembles, we use techniques from random …

The History Of The Enigma Machine, Jenna Siobhan Parkinson

History Publications

The history of the Enigma machine begins with the invention of the rotor-based cipher machine in 1915. Various models for rotor-based cipher machines were developed somewhat simultaneously in different parts of the world. However, the first documented rotor machine was developed by Dutch naval officers in 1915. Nonetheless, the Enigma machine was officially invented following the end of World War I by Arthur Scherbius in 1918 (Faint, 2016).

On The Spatial Modelling Of Biological Invasions, Tedi Ramaj

Electronic Thesis and Dissertation Repository

We investigate problems of biological spatial invasion through the use of spatial modelling. We begin by examining the spread of an invasive weed plant species through a forest by developing a system of partial differential equations (PDEs) involving an invasive weed and a competing native plant species. We find that extinction of the native plant species may be achieved by increasing the carrying capacity of the forest as well as the competition coefficient between the species. We also find that the boundary conditions exert long-term control on the biomass of the invasive weed and hence should be considered when implementing …

Proving Dirichlet's Theorem On Arithmetic Progressions, Owen T. Abma

Undergraduate Student Research Internships Conference

First proved by German mathematician Dirichlet in 1837, this important theorem states that for coprime integers a, m, there are an infinite number of primes p such that p = a (mod m). This is one of many extensions of Euclid’s theorem that there are infinitely many prime numbers. In this paper, we will formulate a rather elegant proof of Dirichlet’s theorem using ideas from complex analysis and group theory.

Automorphism-Preserving Color Substitutions On Profinite Graphs, Michal Cizek

Electronic Thesis and Dissertation Repository

Profinite groups are topological groups which are known to be Galois groups. Their free product was extensively studied by Luis Ribes and Pavel Zaleskii using the notion of a profinite graph and having profinite groups act freely on such graphs. This thesis explores a different approach to study profinite groups using profinite graphs and that is with the notion of automorphisms and colors. It contains a generalization to profinite graphs of the theorem of Frucht (1939) that shows that every finite group is a group of automorphisms of a finite connected graph, and establishes a profinite analog of the theorem …

Solving Partial Differential Equations Using The Finite Difference Method And The Fourier Spectral Method, Jenna Siobhan Parkinson

Undergraduate Student Research Internships Conference

This paper discusses the finite difference method and the Fourier spectral method for solving partial differential equations.

Reduction Of L-Functions Of Elliptic Curves Modulo Integers, Félix Baril Boudreau

Electronic Thesis and Dissertation Repository

Let $\mathbb{F}_q$ be a finite field of size $q$, where $q$ is a power of a prime $p \geq 5$. Let $C$ be a smooth, proper, and geometrically connected curve over $\mathbb{F}_q$. Consider an elliptic curve $E$ over the function field $K$ of $C$ with nonconstant $j$-invariant. One can attach to $E$ its $L$-function $L(T,E/K)$, which is a generating function that contains information about the reduction types of $E$ at the different places of $K$. The $L$-function of $E/K$ was proven to be a polynomial in $\mathbb{Z}[T]$.

In 1985, Schoof devised an algorithm to compute the zeta function of an …

The Design And Implementation Of A High-Performance Polynomial System Solver, Alexander Brandt

Electronic Thesis and Dissertation Repository

This thesis examines the algorithmic and practical challenges of solving systems of polynomial equations. We discuss the design and implementation of triangular decomposition to solve polynomials systems exactly by means of symbolic computation.

Incremental triangular decomposition solves one equation from the input list of polynomials at a time. Each step may produce several different components (points, curves, surfaces, etc.) of the solution set. Independent components imply that the solving process may proceed on each component concurrently. This so-called component-level parallelism is a theoretical and practical challenge characterized by irregular parallelism. Parallelism is not an algorithmic property but rather a geometrical …

Towards A Generalization Of Fulton's Intersection Multiplicity Algorithm, Ryan Sandford

Electronic Thesis and Dissertation Repository

In this manuscript we generalize Fulton's bivariate intersection multiplicity algorithm to a partial intersection multiplicity algorithm in the n-variate setting. We extend this generalization of Fulton's algorithm to work at any point, rational or not, using the theory of regular chains. We implement these algorithms in Maple and provide experimental testing. The results indicate the proposed algorithm often outperforms the existing standard basis-free intersection multiplicity algorithm in Maple, typically by one to two orders of magnitude. Moreover, we also provide some examples where the proposed algorithm outperforms intersection multiplicity algorithms which rely on standard bases, indicating the proposed algorithm is …

On The Geometry Of Multi-Affine Polynomials, Junquan Xiao

Electronic Thesis and Dissertation Repository

This work investigates several geometric properties of the solutions of the multi-affine polynomials. Chapters 1, 2 discuss two different notions of invariant circles. Chapter 3 gives several loci of polynomials of degree three. A locus of a complex polynomial p(z) is a minimal, with respect to inclusion, set that contains at least one point of every solution of the polarization of the polynomial. The study of such objects allows one to improve upon know results about the location of zeros and critical points of complex polynomials, see for example [22] and [24]. A complex polynomial has many loci. It is …

An Implementation Of Integrated Information Theory In Resting-State Fmri, Idan E. Nemirovsky

Electronic Thesis and Dissertation Repository

Integrated Information Theory (IIT) is a framework developed to explain consciousness, arguing that conscious systems consist of interacting elements that are integrated through their causal properties. In this study, we present the first application of IIT to functional magnetic resonance imaging (fMRI) data and investigate whether its principal metric, Phi, can meaningfully quantify resting-state cortical activity patterns. Data was acquired from 17 healthy subjects who underwent sedation with propofol, a short acting anesthetic. Using PyPhi, a software package developed for IIT, we thoroughly analyze how Phi varies across different networks and throughout sedation. Our findings indicate that variations in Phi …