Digital Commons Network^™

An Application Of The Pagerank Algorithm To Ncaa Football Team Rankings, Morgan Majors

Honors Theses

We investigate the use of Google’s PageRank algorithm to rank sports teams. The PageRank algorithm is used in web searches to return a list of the websites that are of most interest to the user. The structure of the NCAA FBS football schedule is used to construct a network with a similar structure to the world wide web. Parallels are drawn between pages that are linked in the world wide web with the results of a contest between two sports teams. The teams under consideration here are the members of the 2021 Football Bowl Subdivision. We achieve a total ordering …

On Loop Commutators, Quaternionic Automorphic Loops, And Related Topics, Mariah Kathleen Barnes

Electronic Theses and Dissertations

This dissertation deals with three topics inside loop and quasigroup theory. First, as a continuation of the project started by David Stanovský and Petr Vojtĕchovský, we study the commutator of congruences defined by Freese and McKenzie in order to create a more pleasing, equivalent definition of the commutator inside of loops. Moreover, we show that the commutator can be characterized by the generators of the inner mapping group of the loop. We then translate these results to characterize the commutator of two normal subloops of any loop.

Second, we study automorphic loops with the desire to find more examples of …

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 …

Matrix Product Structure Of A Permuted Quasi Cyclic Code And Its Dual, Perian Perdhiku

Dissertations

In my Dissertation I will work mostly with Permuted Quasi Cyclic Codes. They are a generalization of Cyclic Codes, one of the most important families of Linear Codes in Coding Theory. Linear Codes are very useful in error detection and correction. Error Detection and Correction is a technique that first detects the corrupted data sent from some transmitter over unreliable communication channels and then corrects the errors and reconstructs the original data. Unlike linear codes, cyclic codes are used to correct errors where the pattern is not clear and the error occurs in a short segment of …

Zn Orbifolds Of Vertex Operator Algebras, Daniel Graybill

Electronic Theses and Dissertations

Given a vertex algebra V and a group of automorphisms of V, the invariant subalgebra V^G is called an orbifold of V. This construction appeared first in physics and was also fundamental to the construction of the Moonshine module in the work of Borcherds. It is expected that nice properties of V such as C2-cofiniteness and rationality will be inherited by V^G if G is a finite group. It is also expected that under reasonable hypotheses, if V is strongly finitely generated and G is reductive, V^G will also be strongly finitely generated. This is an analogue …

Sum Of Cubes Of The First N Integers, Obiamaka L. Agu

Electronic Theses, Projects, and Dissertations

In Calculus we learned that 􏰅Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{􏰅n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. …

Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok

Theses and Dissertations--Mathematics

This dissertation is devoted to the study of the geometric properties of subspace configurations, with an emphasis on configurations of points. One distinguishing feature is the widespread use of techniques from Matroid Theory and Combinatorial Optimization. In part we generalize a theorem of Edmond's about partitions of matroids in independent subsets. We then apply this to establish a conjectured bound on the Castelnuovo-Mumford regularity of a set of fat points.

We then study how the dimension of an ideal of point changes when intersected with a generic fat subspace. In particular we introduce the concept of a ``very unexpected hypersurface'' …

Algebraic Topics In The Classroom – Gauss And Beyond, Lisa Krance

Masters Essays

No abstract provided.

Decidability For Residuated Lattices And Substructural Logics, Gavin St. John

Electronic Theses and Dissertations

We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of substructural logics by simple structural rules, with the aim of classifying simple equations by the decidability properties shared by their extensions. We also prove a number of relationships among simple extensions by showing the equational theory of their idempotent semiring reducts coincides with simple extensions of idempotent semirings. On the decidability front, we develop both semantical and syntactical …

Categories Of Residuated Lattices, Daniel Wesley Fussner

Electronic Theses and Dissertations

We present dual variants of two algebraic constructions of certain classes of residuated lattices: The Galatos-Raftery construction of Sugihara monoids and their bounded expansions, and the Aguzzoli-Flaminio-Ugolini quadruples construction of srDL-algebras. Our dual presentation of these constructions is facilitated by both new algebraic results, and new duality-theoretic tools. On the algebraic front, we provide a complete description of implications among nontrivial distribution properties in the context of lattice-ordered structures equipped with a residuated binary operation. We also offer some new results about forbidden configurations in lattices endowed with an order-reversing involution. On the duality-theoretic front, we present new results on …

Ancient Cultures + High School Algebra = A Diverse Mathematical Approach, Laryssa Byndas

Masters Essays

No abstract provided.

Group Rings, Christopher Wrenn

Masters Essays

No abstract provided.

Logic -> Proof -> Rest, Maxwell Taylor

Senior Independent Study Theses

REST is a common architecture for networked applications. Applications that adhere to the REST constraints enjoy significant scaling advantages over other architectures. But REST is not a panacea for the task of building correct software. Algebraic models of computation, particularly CSP, prove useful to describe the composition of applications using REST. CSP enables us to describe and verify the behavior of RESTful systems. The descriptions of each component can be used independently to verify that a system behaves as expected. This thesis demonstrates and develops CSP methodology to verify the behavior of RESTful applications.

On Degree Bound For Syzygies Of Polynomial Invariants, Zhao Gao

Senior Independent Study Theses

Suppose G is a finite linearly reductive group. The degree bound for the syzygy ideal of the invariant ring of G is given in [2]. We develop the theory of commutative algebra and give the proof from [2] that the ideal of relations of the minimal set of generators of invariant ring of a finite linearly reductive group G is generated in degree at most 2|G|.

Subgroups Of Finite Wreath Product Groups For P=3, Jessica L. Gonda

Williams Honors College, Honors Research Projects

Let M be the additive abelian group of 3-by-3 matrices whose entries are from the ring of integers modulo 9. The problem of determining all the normal subgroups of the regular wreath product group P=Z₉≀(Z₃ × Z₃) that are contained in its base subgroup is equivalent to the problem of determining the subgroups of M that are invariant under two particular endomorphisms of M. In this thesis we give a partial solution to the latter problem by implementing a systematic approach using concepts from group theory and linear algebra.

Teaching Algebra: A Comparison Of Scottish And American Perspectives, Brittany Munro

Undergraduate Honors Theses

A variety of factors influence what teaching strategies an educator uses. I analyze survey responses from algebra teachers in Scotland and Appalachia America to discover how a teacher's perception of these factors, particularly their view of mathematics itself, determines the pedagogical strategies employed in the classroom.

Hurwitz's Theorem, Marianna Malek

Masters Essays

No abstract provided.

Convexity Properties Of The Diestel-Leader Group Γ_3(2), Peter J. Davids

Honors Projects

The Diestel-Leader groups are a family of groups first introduced in 2001 by Diestel and Leader in [7]. In this paper, we demonstrate that the Diestel-Leader group Γ₃(2) is not almost convex with respect to a particular generating set S. Almost convexity is a geometric property that has been shown by Cannon [3] to guarantee a solvable word problem (that is, in any almost convex group there is a finite-step algorithm to determine if two strings of generators, or “words”, represent the same group element). Our proof relies on the word length formula given by Stein and Taback …

Calculator Usage In Secondary Level Classrooms: The Ongoing Debate, Nicole Plummer

Honors College Theses

With technology becoming more prevalent every day, it is imperative that students gain enough experience with different technological tools in order to be successful in the “real-world”. This thesis will discuss the debate and overall support for an increased usage of calculators as tools in the secondary level classroom. When the idea of calculators in the classroom first came to life, many educators were very apprehensive and quite hesitant of this change. Unfortunately, more than 40 years later, there is still hesitation for their usage; and rightfully so. While there are plenty of advantages of calculator use in the classroom, …

Analyzing Common Algebra-Related Misconceptions And Errors Of Middle School Students., Sarah B. Bush

Electronic Theses and Dissertations

The purpose of this study was to examine common algebra-related misconceptions and errors of middle school students. In recent years, success in Algebra I is often considered the mathematics gateway to graduation from high school and success beyond. Therefore, preparation for algebra in the middle grades is essential to student success in Algebra I and high school. This study examines the following research question: What common algebra-related misconceptions and errors exist among students in grades six and eight as identified on student responses on an annual statewide standardized assessment? In this study, qualitative document analysis of existing data was used …

Algebraic And Combinatorial Properties Of Certain Toric Ideals In Theory And Applications, Sonja Petrovic

University of Kentucky Doctoral Dissertations

This work focuses on commutative algebra, its combinatorial and computational aspects, and its interactions with statistics. The main objects of interest are projective varieties in Pⁿ, algebraic properties of their coordinate rings, and the combinatorial invariants, such as Hilbert series and Gröbner fans, of their defining ideals. Specifically, the ideals in this work are all toric ideals, and they come in three flavors: they are defining ideals of a family of classical varieties called rational normal scrolls, cut ideals that can be associated to a graph, and phylogenetic ideals arising in a new and increasingly popular area of …

Fundamental Theorem Of Algebra, Paul Shibalovich

Theses Digitization Project

The fundamental theorem of algebra (FTA) is an important theorem in algebra. This theorem asserts that the complex field is algebracially closed. This thesis will include historical research of proofs of the fundamental theorem of algebra and provide information about the first proof given by Gauss of the theorem and the time when it was proved.

A Comparative Investigation Of The Effects Of Frequent Testing Upon Achievement In Secondary Advanced Algebra, John Thomas Fullerton

All Master's Theses

Relatively speaking, few studies have concerned themselves with the problem of frequent testing, and as Keys pointed out, empirical evidence, uncomplicated by differences in the amount of testing material employed, on the effects of frequent testing is, at best, scarce (14:427). Also many studies used tests and test results for direct instruction, thus introducing additional variables. Furthermore, the choice of subjects and disciplines has been limited, the better part being taken from college psychology and sociology classes or high school science classes. This investigation was not an attempt to modify previous experiments, nor was it an attempt to identify which …

On Semigroup Rings, Lawrence Paul Runyan

All Master's Theses

Some of the properties of semigroup rings are described, illustrated and proved in this study. In particular, the central problem focuses on how various properties of the semigroup and ring are reflected in the resulting semigroup ring.