Algebraic Geometry Commons^™

Principal Quandles, Jesse Parrish

Electronic Theses and Dissertations

This thesis concerns principal quandles and, as a special case, Alexander quandles. A principal quandle is a coset quandle, Q(G,H, f), in which the subgroup H is trivial. If in addition the group G is abelian, then the coset quandle is called an Alexander quandle. The isomorphism types of Alexander quandles were classified [16], and some progress was made on describing the isomorphism types of principal quandles in [14] and [13]. The first part of this thesis applies the ideas used in Holmes’ paper to give a classification of the isomorphism types of principal quandles. The second …

Topics In Moufang Loops, Riley Britten

Electronic Theses and Dissertations

We will begin by discussing power graphs of Moufang loops. We are able to show that as in groups the directed power graph of a Moufang loop is uniquely determined by the undirected power graph. In the process of proving this result we define the generalized octonion loops, a variety of Moufang loops which behave analogously to the generalized quaternion groups. We proceed to investigate para-F quasigroups, a variety of quasigroups which we show are antilinear over Moufang loops. We briefly depart from the context of Moufang loops to discuss solvability in general loops. We then prove some results on …

Dihedral-Like Constructions Of Automorphic Loops, Mouna Ramadan Aboras

Electronic Theses and Dissertations

In this dissertation we study dihedral-like constructions of automorphic loops. Automorphic loops are loops in which all inner mappings are automorphisms. We start by describing a generalization of the dihedral construction for groups. Namely, if (G , +) is an abelian group, m > 1 and α ∈2 Aut(G ), let Dih(m, G, α) on Z_m × G be defined by

(i, u )(j, v ) = (i + j , ((-1)^j u + v )α^ij ).

We prove that the resulting loop is automorphic if and only if m = 2 …

Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster

Electronic Theses and Dissertations

This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e., by an x-monotone orthogonal polyline ℜ with k < n horizontal segments. We use the vertical distance to measure the quality of the approximation, i.e., the maximum distance from a point in S to the horizontal segment directly above or below it. We consider two types of problems: min-ε, where the goal is to minimize the error for a …

History Of Applied Geometry, Evelyn Jackson

Electronic Theses and Dissertations

Mathematics: Just what does the word mean to us? After a moment of thought many different meanings may present themselves to our minds. At first we are inclined to say that the word mathematics covers a vast field. We are justified in so thinking because mathematics embraces a wide scope of study. Were we to say that it is a science we should place it in its proper genius, for it is truly a science of numbers and space. However, could not the science be the art of calculation or the art of computation?