Algebra Commons^™

Winning Strategy For Multiplayer And Multialliance Geometric Game, Jingkai Ye

Rose-Hulman Undergraduate Mathematics Journal

The Geometric Sequence with common ratio 2 is one of the most well-known geometric sequences. Every term is a nonnegative power of 2. Using this popular sequence, we can create a Geometric Game which contains combining moves (combining two copies of the same terms into the one copy of next term) and splitting moves (splitting three copies of the same term into two copies of previous terms and one copy of the next term). For this Geometric Game, we are able to prove that the game is finite and the final game state is unique. Furthermore, we are able to …

A Proof Of A Generalization Of Niven's Theorem Using Algebraic Number Theory, Caroline Nunn

Rose-Hulman Undergraduate Mathematics Journal

Niven’s theorem states that the sine, cosine, and tangent functions are rational for only a few rational multiples of π. Specifically, for angles θ that are rational multiples of π, the only rational values of sin(θ) and cos(θ) are 0, ±½, and ±1. For tangent, the only rational values are 0 and ±1. We present a proof of this fact, along with a generalization, using the structure of ideals in imaginary quadratic rings. We first show that the theorem holds for the tangent function using elementary properties of Gaussian integers, before extending the approach to other imaginary quadratic rings. We …

(R1466) Ideals And Filters On A Lattice In Neutrosophic Setting, Lemnaouar Zedam, Soheyb Milles, Abdelhamid Bennoui

Applications and Applied Mathematics: An International Journal (AAM)

The notions of ideals and filters have studied in many algebraic (crisp) fuzzy structures and used to study their various properties, representations and characterizations. In addition to their theoretical roles, they have used in some areas of applied mathematics. In a recent paper, Arockiarani and Antony Crispin Sweety have generalized and studied these notions with respect to the concept of neutrosophic sets introduced by Smarandache to represent imprecise, incomplete and inconsistent information. In this article, we aim to deepen the study of these important notions on a given lattice in the neutrosophic setting. We show their various properties and characterizations, …

Finite Groups In Which The Number Of Cyclic Subgroups Is 3/4 The Order Of The Group, James Alexander Cayley

Graduate Theses/Dissertations

Let $G$ be a finite group, c(G) denotes the number of cyclic subgroups of G and α(G) = c(G)/|G|. In this thesis we go over some basic properties of alpha, calculate alpha for some families of groups, with an emphasis on groups with α(G) = 3/4, as all groups with α(G) > 3/4 have been classified by Garonzi and Lima (2018). We find all Dihedral group with this property, show all groups with α(G) = 3/4 have at least |G|/2-1 involutions, and discuss existing work by Wall (1970) and Miller (1919) classifying all such groups.

A Study In Applications Of Continued Fractions, Karen Lynn Parrish

Electronic Theses, Projects, and Dissertations

This is an expository study of continued fractions collecting ideas from several different sources including textbooks and journal articles. This study focuses on several applications of continued fractions from a variety of levels and fields of mathematics. Studies begin with looking at a number of properties that pertain to continued fractions and then move on to show how applications of continued fractions is relevant to high school level mathematics including approximating irrational numbers and developing new ideas for understanding and solving quadratics equations. Focus then continues to more advanced applications such as those used in the studies of number theory …

Symmetric Representations Of Finite Groups And Related Topics, Connie Corona

Electronic Theses, Projects, and Dissertations

In this thesis, we have presented our discovery of original symmetric presentations of a number of non-abelian simple groups, including several sporatic groups, linear groups, and classical groups.

We have constructed, using our technique of double coset enumeration, J2, M₁₂, J₁, PSU(3, 3):2, M₁₁, A₁₀, S(4,3), M₂₂:2, PSL(3, 4), S₆, 2:S₅, 2:PSL(3, 4) as homomorphic images of the involutory progenitors 2^*32:(2⁵:A₅), 2^*110: PSL(2, 11), 2^*5:A₅, 3^*4:D₈, 2^*110:PSL(2, 11), …

Linear Algebra For Computer Science, M. Thulasidas

Research Collection School Of Computing and Information Systems

This textbook introduces the essential concepts and practice of Linear Algebra to the undergraduate student of computer science. The focus of this book is on the elegance and beauty of the numerical techniques and algorithms originating from Linear Algebra. As a practical handbook for computer and data scientists, LA4CS restricts itself mostly to real fields and tractable discourses, rather than deep and theoretical mathematics.

Algorithmic Correspondence For Relevance Logics, Bunched Implication Logics, And Relation Algebras Via An Implementation Of The Algorithm Pearl, Willem Conradie, Valentin Goranko, Peter Jipsen

Mathematics, Physics, and Computer Science Faculty Articles and Research

The non-deterministic algorithmic procedure PEARL (acronym for ‘Propositional variables Elimination Algorithm for Relevance Logic’) has been recently developed for computing first-order equivalents of formulas of the language of relevance logics LR in terms of the standard Routley-Meyer relational semantics. It succeeds on a large class of axioms of relevance logics, including all so called inductive formulas. In the present work we re-interpret PEARL from an algebraic perspective, with its rewrite rules seen as manipulating quasi-inequalities interpreted over Urquhart’s relevant algebras, and report on its recent Python implementation. We also show that all formulae on which PEARL succeeds are canonical, i.e., …

Unary-Determined Distributive ℓ -Magmas And Bunched Implication Algebras, Natanael Alpay, Peter Jipsen, Melissa Sugimoto

Mathematics, Physics, and Computer Science Faculty Articles and Research

A distributive lattice-ordered magma (dℓ-magma) (A,∧,∨,⋅) is a distributive lattice with a binary operation ⋅ that preserves joins in both arguments, and when ⋅ is associative then (A,∨,⋅) is an idempotent semiring. A dℓ-magma with a top ⊤ is unary-determined if x⋅y=(x⋅⊤∧y)∨(x∧⊤⋅y). These algebras are term-equivalent to a subvariety of distributive lattices with ⊤ and two join-preserving unary operations p, q. We obtain simple conditions on p, q such that x⋅y=(px∧y)∨(x∧qy) is associative, commutative, idempotent and/or has an identity element. This generalizes previous results on the structure of doubly idempotent semirings and, in the case when the …

Generalized Grassmann Algebras And Applications To Stochastic Processes, Daniel Alpay, Paula Cerejeiras, Uwe Kaehler

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper, we present the groundwork for an Itô/Malliavin stochastic calculus and Hida's white noise analysis in the context of a supersymmetry with Z₃-graded algebras. To this end, we establish a ternary Fock space and the corresponding strong algebra of stochastic distributions and present its application in the study of stochastic processes in this context.

The Structure Of Finite Commutative Idempotent Involutive Residuated Lattices, Peter Jipsen, Olim Tuyt, Diego Valota

Mathematics, Physics, and Computer Science Faculty Articles and Research

We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to build new members of this variety from other ones. In particular, all finite members can be constructed in this way from Boolean algebras. Finally, we apply our construction to prove that the fusion reduct of any finite member is a distributive semilattice, and to show that this variety is not locally finite.

Conjunctive Join-Semilattices, Charles N. Delzell, Oghenetega Ighedo, James J. Madden

Mathematics, Physics, and Computer Science Faculty Articles and Research

A join-semilattice L with top is said to be conjunctive if every principal ideal is an intersection of maximal ideals. (This is equivalent to a first-order condition in the language of semilattices.) In this paper, we explore the consequences of the conjunctivity hypothesis for L, and we define and study a related property, called “ideal conjunctivity,” which is applicable to join-semilattices without top. Results include the following: (a) Every conjunctive join-semilattice is isomorphic to a join-closed subbase for a compact T₁-topology on max L, the set of maximal ideals of L, and under weak hypotheses …

Rigid Connections On The Projective Line With Elliptic Toral Singularities, Alisina Azhang

LSU Doctoral Dissertations

We generalize two studies of rigid $G$-connections on $\pp$ which have an irregular singularity at origin and a regular singularity at infinity with unipotent monodromy: one is the work of Kamgarpour-Sage which classifies rigid homogeneous Coxeter $G$-connections with slope $\frac{r}{h}$, where $h$ is the Coxeter number of $G$, and the other is the work of Chen, which proves the existence of rigid homogeneous elliptic regular $G$-connections with slope $\frac{1}{m}$, where $m$ is an elliptic number for $G$. In our work, similar to Chen, we look for rigid homogeneous elliptic regular $G$-connections, but we allow the slope to have a numerator …

College Algebra Through Problem Solving (2021 Edition), Danielle Cifone, Karan Puri, Debra Maslanko, Ewa Stelmach

Open Educational Resources

This is a self-contained, open educational resource (OER) textbook for college algebra. Students can use the book to learn concepts and work in the book themselves. Instructors can adapt the book for use in any college algebra course to facilitate active learning through problem solving. Additional resources such as classroom assessments and online/printable homework is available from the authors.

Beurling-Lax Type Theorems And Cuntz Relations, Daniel Alpay, Fabrizio Colombo, Irene Sabadini, Baruch Schneider

Mathematics, Physics, and Computer Science Faculty Articles and Research

We prove various Beurling-Lax type theorems, when the classical backward-shift operator is replaced by a general resolvent operator associated with a rational function. We also study connections to the Cuntz relations. An important tool is a new representation result for analytic functions, in terms of composition and multiplication operators associated with a given rational function. Applications to the theory of de Branges-Rovnyak spaces, also in the indefinite metric setting, are given.

Free Complexes Over The Exterior Algebra With Small Homology, Erica Hopkins

Department of Mathematics: Dissertations, Theses, and Student Research

Let M be a graded module over a standard graded polynomial ring S. The Total Rank Conjecture by Avramov-Buchweitz predicts the total Betti number of M should be at least the total Betti number of the residue field. Walker proved this is indeed true in a large number of cases. One could then try to push this result further by generalizing this conjecture to finite free complexes which is known as the Generalized Total Rank Conjecture. However, Iyengar and Walker constructed examples to show this generalized conjecture is not always true.

In this thesis, we investigate other counterexamples of …

Algorithms Related To Triangle Groups, Bao The Pham

LSU Doctoral Dissertations

Given a finite index subgroup of $\PSL_2(\Z)$, one can talk about the different properties of this subgroup. These properties have been studied extensively in an attempt to classify these subgroups. Tim Hsu created an algorithm to determine whether a subgroup is a congruence subgroup by using permutations \cite{hsu}. Lang, Lim, and Tan also created an algorithm to determine if a subgroup is a congruence subgroup by using Farey Symbols \cite{llt}. Sebbar classified torsion-free congruence subgroups of genus 0 \cite{sebbar}. Pauli and Cummins computed and tabulated all congruence subgroups of genus less than 24 \cite{ps}. However, there are still some problems …

Injective And Projective Semimodules Over Involutive Semirings, Peter Jipsen, Sara Vanucci

Mathematics, Physics, and Computer Science Faculty Articles and Research

We show that the term equivalence between MV-algebras and MV-semirings lifts to involutive residuated lattices and a class of semirings called involutive semirings. The semiring perspective leads to a necessary and sufficient condition for the interval [d,1] to be a subalgebra of an involutive residuated lattice, where d is the dualizing element. We also import some results and techniques of semimodule theory in the study of this class of semirings, generalizing results about injective and projective MV-semimodules. Indeed, we note that the involution plays a crucial role and that the results for MV-semirings are still true for …

Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern

Rose-Hulman Undergraduate Mathematics Journal

In 2015, I. Rivin introduced an effective method to bound the number of irreducible integral polynomials with fixed degree d and height at most N. In this paper, we give a brief summary of this result and discuss the precision of Rivin's arguments for special classes of polynomials. We also give elementary proofs of classic results on Galois groups of cubic trinomials.

Disjointness Of Linear Fractional Actions On Serre Trees, Henry W. Talbott

Rose-Hulman Undergraduate Mathematics Journal

Serre showed that, for a discrete valuation field, the group of linear fractional transformations acts on an infinite regular tree with vertex degree determined by the residue degree of the field. Since the p-adics and the polynomials over the finite field of order p act on isomorphic trees, we may ask whether pairs of actions from these two groups are ever conjugate as tree automorphisms. We analyze permutations induced on finite vertex sets, and show a permutation classification result for actions by these linear fractional transformation groups. We prove that actions by specific subgroups of these groups are conjugate only …

Directed Graphs Of The Finite Tropical Semiring, Caden G. Zonnefeld

Rose-Hulman Undergraduate Mathematics Journal

The focus of this paper lies at the intersection of the fields of tropical algebra and graph theory. In particular the interaction between tropical semirings and directed graphs is investigated. Originally studied by Lipvoski, the directed graph of a ring is useful in identifying properties within the algebraic structure of a ring. This work builds off research completed by Beyer and Fields, Hausken and Skinner, and Ang and Shulte in constructing directed graphs from rings. However, we will investigate the relationship (x, y)→(min(x, y), x+y) as defined by the operations of tropical algebra and applied to tropical semirings.

Computable Model Theory On Loops, Josiah Schmidt

All NMU Master's Theses

We give an introduction to the problem of computable algebras. Specifically, the algebras of loops and groups. We start by defining a loop and group, then give some of their properties. We then give an overview of comptability theory, and apply it to loops and groups. We conclude by showing that a finitely presented residually finite algebra has a solvable word problem.

Modernization Of Scienttific Mathematics Formula In Technology, Iwasan D. Kejawa Ed.D, Prof. Iwasan D. Kejawa Ed.D

Department of Mathematics: Faculty Publications

Abstract
Is it true that we solve problem using techniques in form of formula? Mathematical formulas can be derived through thinking of a problem or situation. Research has shown that we can create formulas by applying theoretical, technical, and applied knowledge. The knowledge derives from brainstorming and actual experience can be represented by formulas. It is intended that this research article is geared by an audience of average knowledge level of solving mathematics and scientific intricacies. This work details an introductory level of simple, at times complex problems in a mathematical epidermis and computability and solvability in a Computer Science. …

Noncommutative Tensor Triangular Geometry And Its Applications To Representation Theory, Kent Barton Vashaw

LSU Doctoral Dissertations

One of the cornerstones of the representation theory of Hopf algebras and finite tensor categories is the theory of support varieties. Balmer introduced tensor triangular geometry for symmetric monoidal triangulated categories, which united various support variety theories coming from disparate areas such as homotopy theory, algebraic geometry, and representation theory. In this thesis a noncommutative version will be introduced and developed. We show that this noncommutative analogue of Balmer's theory can be determined in many concrete situations via the theory of abstract support data, and can be used to classify thick tensor ideals. We prove an analogue of prime ideal …

On The Generalization Of Interval Valued Fuzzy Generalized Bi-Ideals In Ordered Semigroups, Muhammad S. Ali Khan, Saleem Abdullah, Kostaq Hila

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, a new general form than interval valued fuzzy generalized bi-ideals in ordered semigroups is introduced. The concept of interval valued fuzzy generalized bi-ideals is initiated and several properties and characterizations are provided. A condition for an interval valued fuzzy generalized bi-ideal to be an interval valued fuzzy generalized bi-ideal is obtained. Using implication operators and the notion of implication-based an interval valued fuzzy generalized bi-ideal, characterizations of an interval valued fuzzy generalized bi-ideal and an interval valued fuzzy generalized bi-ideal are considered.

Hamacher Operations Of Fermatean Fuzzy Matrices, I. Silambarasan

Applications and Applied Mathematics: An International Journal (AAM)

The purpose of this study is to extend the Fermatean fuzzy matrices to the theory of Hamacher operations. In this paper, the concept of Hamacher operations of Fermatean fuzzy matrices are introduced and some desirable properties of these operations, such as commutativity, idempotency, and monotonicity are discussed. Further, we prove DeMorgan’s laws over complement for these operations. Furthermore, the scalar multiplication and exponentiation operations of Fermatean fuzzy matrices are constructed and their algebraic properties are investigated. Finally, some properties of necessity and possibility operators of Fermatean fuzzy matrices are proved.

On The Representation Of Boolean Magmas And Boolean Semilattices, Peter Jipsen, M. Eyad Kurd-Misto, James Wimberley

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

A magma is an algebra with a binary operation ·, and a Boolean magma is a Boolean algebra with an additional binary operation · that distributes over all finite Boolean joins. We prove that all square-increasing (x ≤ x²) Boolean magmas are embedded in complex algebras of idempotent (x = x²) magmas. This solves a problem in a recent paper [3] by C. Bergman. Similar results are shown to hold for commutative Boolean magmas with an identity element and a unary inverse operation, or with any combination of these properties.

A Boolean semilattice is …

N-Fold Matrix Factorizations, Eric Hopkins

Department of Mathematics: Dissertations, Theses, and Student Research

The study of matrix factorizations began when they were introduced by Eisenbud; they have since been an important topic in commutative algebra. Results by Eisenbud, Buchweitz, and Yoshino relate matrix factorizations to maximal Cohen-Macaulay modules over hypersurface rings. There are many important properties of the category of matrix factorizations, as well as tensor product and hom constructions. More recently, Backelin, Herzog, Sanders, and Ulrich used a generalization of matrix factorizations -- so called N-fold matrix factorizations -- to construct Ulrich modules over arbitrary hypersurface rings. In this dissertation we build up the theory of N-fold matrix factorizations, proving analogues of …

Streaming Down The Stern-Brocot Tree: Finding And Expressing Solutions To Pell's Equation In Sl(2,Z), Marcus L. Shell

Theses

This paper explores and elaborates on a method of solving Pell’s equation as introduced by Norman Wildberger. In the first chapters of the paper, foundational topics are introduced in expository style including an explanation of Pell’s equation. An explanation of continued fractions and their ability to express quadratic irrationals is provided as well as a connection to the Stern-Brocot tree and a convenient means of representation for each in terms of 2×2 matrices with integer elements. This representation will provide a useful way of navigating the Stern-Brocot tree computationally and permit us a means of computing continued fractions without the …

Algebraic Structures And Variations: From Latin Squares To Lie Quasigroups, Erik Flinn

All NMU Master's Theses

In this Master's Thesis we give an overview of the algebraic structure of sets with a single binary operation. Specifically, we are interested in quasigroups and loops and their historical connection with Latin squares; considering them in both finite and continuous variations. We also consider various mappings between such algebraic objects and utilize matrix representations to give a negative conclusion to a question concerning isotopies in the case of quasigroups.