Other Mathematics Commons^™

Varieties Of Nonassociative Rings Of Bol-Moufang Type, Ronald E. White

All NMU Master's Theses

In this paper we investigate Bol-Moufang identities in a more general and very natural setting, \textit{nonassociative rings}.

We first introduce and define common algebras. We then explore the varieties of nonassociative rings of Bol-Moufang type. We explore two separate cases, the first where we consider binary rings, rings in which we make no assumption of it's structure. The second case we explore are rings in which, $2x=0$ implies $x=0$.

Counting The Moduli Space Of Pentagons On Finite Projective Planes, Maxwell Hosler

Senior Independent Study Theses

Finite projective planes are finite incidence structures which generalize the concept of the real projective plane. In this paper, we consider structures of points embedded in these planes. In particular, we investigate pentagons in general position, meaning no three vertices are colinear. We are interested in properties of these pentagons that are preserved by collineation of the plane, and so can be conceived as properties of the equivalence class of polygons up to collineation as a whole. Amongst these are the symmetries of a pentagon and the periodicity of the pentagon under the pentagram map, and a generalization of …

An Analysis And Comparison Of Knot Polynomials, Hannah Steinhauer

Senior Honors Projects, 2020-current

Knot polynomials are polynomial equations that are assigned to knot projections based on the mathematical properties of the knots. They are also invariants, or properties of knots that do not change under ambient isotopy. In other words, given an invariant α for a knot K, α is the same for any projection of K. We will define these knot polynomials and explain the processes by which one finds them for a given knot projection. We will also compare the relative usefulness of these polynomials.

The Automorphism Group Of The Halved Cube, Benjamin B. Mackinnon

Theses and Dissertations

An n-dimensional halved cube is a graph whose vertices are the binary strings of length n, where two vertices are adjacent if and only if they differ in exactly two positions. It can be regarded as the graph whose vertex set is one partite set of the n-dimensional hypercube, with an edge joining vertices at hamming distance two. In this thesis we compute the automorphism groups of the halved cubes by embedding them in R n and realizing the automorphism group as a subgroup of GLn(R). As an application we show that a halved cube is a circulant graph if …