Algebra Commons^™

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.

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.

Determining Quantum Symmetry In Graphs Using Planar Algebras, Akshata Pisharody

Undergraduate Honors Theses

A graph has quantum symmetry if the algebra associated with its quantum automorphism group is non-commutative. We study what quantum symmetry means and outline one specific method for determining whether a graph has quantum symmetry, a method that involves studying planar algebras and manipulating planar tangles. Modifying a previously used method, we prove that the 5-cycle has no quantum symmetry by showing it has the generating property.

Frobenius And Homological Dimensions Of Complexes, Taran Funk

Department of Mathematics: Dissertations, Theses, and Student Research

Much work has been done showing how one can use a commutative Noetherian local ring R of prime characteristic, viewed as algebra over itself via the Frobenius endomorphism, as a test for flatness or projectivity of a finitely generated module M over R. Work on this dates back to the famous results of Peskine and Szpiro and also that of Kunz. Here I discuss what work has been done to push this theory into modules which are not necessarily finitely generated, and display my work done to weaken the assumptions needed to obtain these results.

Adviser: Tom Marley

A Survey Of Methods To Determine Quantum Symmetry Of Graphs, Samantha Phillips

Undergraduate Honors Theses

We introduce the theory of quantum symmetry of a graph by starting with quantum permutation groups and classical automorphism groups. We study graphs with and without quantum symmetry to provide a comprehensive view of current techniques used to determine whether a graph has quantum symmetry. Methods provided include specific tools to show commutativity of generators of algebras of quantum automorphism groups of distance-transitive graphs; a theorem that describes why nontrivial, disjoint automorphisms in the automorphism group implies quantum symmetry; and a planar algebra approach to studying symmetry.

Symmetric Presentation Of Finite Groups, And Related Topics, Marina Michelle Duchesne

Electronic Theses, Projects, and Dissertations

We have discovered original symmetric presentations for several finite groups, including 2²:^.(2⁴:(2^.S₃)), M₁₁, 3:(PSL(3,3):2), S₈, and 2^.M₁₂. We have found homomorphic images of several progenitors, including 2^*18:((6x2):6), 2^*24:(2^.S₄), 2^*105:A₇, 3^*3:_m(2³:3), 7^*8:_m(PSL(2,7):2), 3^*4:_m(4²:2²), 7^*5:(2xA₅), and 5^*6:_mS₅. We have provided the isomorphism type of …

On The Hamiltonicity Of Subgroup Lattices, Nicholas Charles Fleece

MSU Graduate Theses

In this paper we discuss the Hamiltonicity of the subgroup lattices of

different classes of groups. We provide sufficient conditions for the

Hamiltonicity of the subgroup lattices of cube-free abelian groups. We also

prove the non-Hamiltonicity of the subgroup lattices of dihedral and

dicyclic groups. We disprove a conjecture on non-abelian p-groups by

producing an infinite family of non-abelian p-groups with Hamiltonian

subgroup lattices. Finally, we provide a list of the Hamiltonicity of the

subgroup lattices of every finite group up to order 35 barring two groups.

On Elliptic Curves, Montana S. Miller

MSU Graduate Theses

An elliptic curve over the rational numbers is given by the equation y² = x³+Ax+B. In our thesis, we study elliptic curves. It is known that the set of rational points on the elliptic curve form a finitely generated abelian group induced by the secant-tangent addition law. We present an elementary proof of associativity using Maple. We also present a relatively concise proof of the Mordell-Weil Theorem.

Proper Sum Graphs, Austin Nicholas Beard

MSU Graduate Theses

The Proper Sum Graph of a commutative ring with identity has the prime ideals as vertices, with two ideals adjacent if their sum is a proper ideal. This thesis expands upon the research of Dhorajia. We will cover the groundwork to understanding the basics of these graphs, and gradually narrow our efforts into the minimal prime ideals of the ring.

Classification Of Cayley Rose Window Graphs, Angsuman Das, Arnab Mandal

Theory and Applications of Graphs

Rose window graphs are a family of tetravalent graphs, introduced by Steve Wilson. Following it, Kovacs, Kutnar and Marusic classified the edge-transitive rose window graphs and Dobson, Kovacs and Miklavic characterized the vertex transitive rose window graphs. In this paper, we classify the Cayley rose window graphs.

Normality Properties Of Composition Operators, Grace Weeks, Hallie Kaiser, Katy O'Malley

Celebration of Scholarship 2021

We explore two main concepts in relation to truncated composition matrices: the conditions required for the binormal and commutative properties. Both of these topics are important in linear algebra due to their connection with diagonalization.

We begin with the normal solution before moving onto the more complex binormal solutions. Then we cover conditions for the composition matrix to commute with the general matrix. Finally, we end with ongoing questions for future work.

Factoring: Difference Of Squares, Thomas Lauria

Open Educational Resources

This lesson plan will explain how to factor basic difference of squares problems

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 …

Lecture 09: Hierarchically Low Rank And Kronecker Methods, Rio Yokota

Mathematical Sciences Spring Lecture Series

Exploiting structures of matrices goes beyond identifying their non-zero patterns. In many cases, dense full-rank matrices have low-rank submatrices that can be exploited to construct fast approximate algorithms. In other cases, dense matrices can be decomposed into Kronecker factors that are much smaller than the original matrix. Sparsity is a consequence of the connectivity of the underlying geometry (mesh, graph, interaction list, etc.), whereas the rank-deficiency of submatrices is closely related to the distance within this underlying geometry. For high dimensional geometry encountered in data science applications, the curse of dimensionality poses a challenge for rank-structured approaches. On the other …

Lecture 14: Randomized Algorithms For Least Squares Problems, Ilse C.F. Ipsen

Mathematical Sciences Spring Lecture Series

The emergence of massive data sets, over the past twenty or so years, has lead to the development of Randomized Numerical Linear Algebra. Randomized matrix algorithms perform random sketching and sampling of rows or columns, in order to reduce the problem dimension or compute low-rank approximations. We review randomized algorithms for the solution of least squares/regression problems, based on row sketching from the left, or column sketching from the right. These algorithms tend to be efficient and accurate on matrices that have many more rows than columns. We present probabilistic bounds for the amount of sampling required to achieve a …

Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li

Mathematical Sciences Spring Lecture Series

Factorization based preconditioning algorithms, most notably incomplete LU (ILU) factorization, have been shown to be robust and applicable to wide ranges of problems. However, traditional ILU algorithms are not amenable to scalable implementation. In recent years, we have seen a lot of investigations using low-rank compression techniques to build approximate factorizations.
A key to achieving lower complexity is the use of hierarchical matrix algebra, stemming from the H-matrix research. In addition, the multilevel algorithm paradigm provides a good vehicle for a scalable implementation. The goal of this lecture is to give an overview of the various hierarchical matrix formats, such …

Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes

Mathematical Sciences Spring Lecture Series

As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …