The interdisciplinary field of machine learning studies algorithms in which functionality is dependent on data sets. This data is often treated as a matrix, and a variety of mathematical methods have been developed to glean information from this data structure such as matrix decomposition. The Laplacian matrix, for example, is commonly used to reconstruct networks, and the eigenpairs of this matrix are used in matrix decomposition. Moreover, concepts such as SVD matrix factorization are closely connected to manifold learning, a subfield of machine learning that assumes the observed data lie on a low-dimensional manifold embedded in a higher-dimensional space. Since many data sets have natural higher dimensions, tensor methods are being developed to deal with big data more efficiently. This thesis builds on these ideas by exploring how matrix methods can be extended to data presented as tensors rather than simply as ordinary vectors.

John Horton Conway was a British mathematician in the twentieth century. He made notable achievements in fields such as algebra, number theory, and knot theory. He was a renowned professor at Cambridge University and later Princeton. His contributions to algebra include his discovery of the Conway group, a group in twenty-four dimensions, and the Conway Constellation. He contributed to number theory with his development of the surreal numbers. His Game of Life earned him long-lasting fame. He contributed to knot theory with his developments of the Conway polynomial, Conway sphere, and Conway notation.

The quaternions are an extension of the complex numbers which were first described by Sir William Rowan Hamilton in 1843. In his description, he gave the equation of the multiplication of the imaginary component similar to that of complex numbers. Many mathematicians have studied the zeros of quaternionic polynomials. Prominent of these, Ivan Niven pioneered a root-finding algorithm in 1941, Gentili and Struppa proved the Fundamental Theorem of Algebra (FTA) for quaternions in 2007. This thesis finds the zeros of quaternionic polynomials using the Fundamental Theorem of Algebra. There are isolated zeros and spheres of zeros. In this thesis, we also find the automorphisms of the zeros of the polynomials and the automorphism group.

Research has shown that a frame for an n-dimensional real Hilbert space offers phase retrieval if and only if it has the complement property. There is a geometric characterization of general frames, the Han-Larson-Naimark Dilation Theorem, which gives us the necessary and sufficient conditions required to dilate a frame for an n-dimensional Hilbert space to a frame for a Hilbert space of higher dimension k. However, a frame having the complement property in an n-dimensional real Hilbert space does not ensure that its dilation will offer phase retrieval. In this thesis, we will explore and provide what necessary and sufficient conditions must be satisfied to dilate a phase retrieval frame for an n-dimensional real Hilbert space to a phase retrieval frame for a k-dimensional real Hilbert.

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.

<p>In this thesis, we discuss some results on the distribution of points on the sphere, asymptotically when both the number of points and the dimension of the sphere tend to infinity. We then give some applications of these results to some statistical problems and especially to hypothesis testing.</p> / Master of Science (MSc)

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 evidence that tortuosity can be used to detect differentiation in stem cell colonies over time and discusses the accuracy of computer simulations of such colonies.

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 on a proper path-connected metric space. As an example, we show that SL(2, Z) is finitely generated by proving that it acts geometrically on the Farey tree.

We define and study the fundamental pro-finite 2-groupoid of varieties X defined over a field k. This is a higher algebraic invariant of a scheme X, analogous to the higher fundamental path 2-groupoids as defined for topological spaces. This invariant is related to previously defined invariants, for example the absolute Galois group of a field, and Grothendieck’s étale fundamental group. The special case of Brauer-Severi varieties is considered, in which case a “sections conjecture” type theorem is proved. It is shown that a Brauer-Severi variety X has a rational point if and only if its étale fundamental 2-groupoid has a special sort of section.

Lattices are an easy and clean class of periodic arrangements that are not only discrete but associated with algebraic structures. We will specifically discuss applying lattices theory to computing the area of polygons in the plane and some optimization problems. This thesis will details information about Pick's Theorem and the higher-dimensional cases of Ehrhart Theory. Closely related to Pick's Theorem and Ehrhart Theory is the Frobenius Problem and Integer Knapsack Problem. Both of these problems have higher-dimension applications, where the difficulties are similar to those of Pick's Theorem and Ehrhart Theory. We will directly relate these problems to optimization problems and operations research.