Algebra Commons^™

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 …

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.

Linear Algebra For Computer Science, M. Thulasidas

Research Collection School Of Computing and Information Systems

This book has its origin in my experience teaching Linear Algebra to Computer Science students at Singapore Management University. Traditionally, Linear Algebra is taught as a pure mathematics course, almost as an afterthought, not fully integrated with any other applied curriculum. It certainly was taught that way to me. The course I was teaching, however, had a definite pedagogical objective of bringing out the applicability and the usefulness of Linear Algebra in Computer Science, which is nothing but applied mathematics. In today’s age of machine learning and artificial intelligence, Linear Algebra is the branch of mathematics that holds the most …

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 …

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 …

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. …

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 …

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

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

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 …

Lecture 02: Tile Low-Rank Methods And Applications (W/Review), 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 …

Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra

Mathematical Sciences Spring Lecture Series

In this talk, we will look at the current state of high performance computing and look at the next stage of extreme computing. With extreme computing, there will be fundamental changes in the character of floating point arithmetic and data movement. In this talk, we will look at how extreme-scale computing has caused algorithm and software developers to change their way of thinking on implementing and program-specific applications.

Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman

Mathematical Sciences Spring Lecture Series

Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.

Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang

Mathematical Sciences Spring Lecture Series

Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …

On Leibniz Cohomology, Jorg Feldvoss, Friedrich Wagemann

University Faculty and Staff Publications

In this paper we prove the Leibniz analogue of Whitehead's vanishing theorem for the Chevalley-Eilenberg cohomology of Lie algebras. As a consequence, we obtain the second Whitehead lemma for Leibniz algebras. Moreover, we compute the cohomology of several Leibniz algebras with ad joint or irreducible coefficients. Our main tool is a Leibniz analogue of the Hochschild-Serre spectral sequence, which is an extension of the dual of a spectral sequence of Pirashvili for Leibniz homology from symmetric bimodules to arbitrary bimodules.

Total Differentiability And Monogenicity For Functions In Algebras Of Order 4, I. Sabadini, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we discuss some notions of analyticity in associative algebras with unit. We also recall some basic tool in algebraic analysis and we use them to study the properties of analytic functions in two algebras of dimension four that played a relevant role in some work of the Italian school, but that have never been fully investigated.

Lattice-Ordered Pregroups Are Semi-Distributive, Nikolaos Galatos, Peter Jipsen, Michael Kinyon, Adam Přenosil

Mathematics, Physics, and Computer Science Faculty Articles and Research

We prove that the lattice reduct of every lattice-ordered pregroup is semidistributive. This is a consequence of a certain weak form of the distributive law which holds in lattice-ordered pregroups.

Interdisciplinary Thinking: Financial Literacy Crosses Disciplinary Boundaries, Marla A. Sole

Publications and Research

Financial literacy is ideally suited to be integrated into mathematics courses and taught in an interdisciplinary manner. Students learn best and are motivated when tackling real-world meaningful questions. This article shares how elementary mathematics was applied to better understand the debate about raising the minimum wage and the United States National Debt. To serve as a guide for other teachers who wish to incorporate financial literacy into their mathematics courses and take an interdisciplinary approach, this article suggests readings, data sets, and pedagogical practices. Students were engaged and enthusiastic to work on problems that challenged their thinking about financial issues.

On The Ranks Of String C-Group Representations For Symplectic And Orthogonal Groups, Peter A. Brooksbank

Faculty Journal Articles

We determine the ranks of string C-group representations of the groups PSp(4,q)=Ω(5,q), and comment on those of higher-dimensional symplectic and orthogonal groups.

Formal Power Series Approach To Nonlinear Systems With Static Output Feedback, G.S. Venkatesh, W. Steven Gray

Electrical & Computer Engineering Faculty Publications

The goal of this paper is to compute the generating series of a closed-loop system when the plant is described in terms of a Chen-Fliess series and static output feedback is applied. The first step is to reconsider the so called Wiener-Fliess connection consisting of a Chen-Fliess series followed by a memoryless function. Of particular importance will be the contractive nature of this map, which is needed to show that the closed-loop system has a Chen-Fliess series representation. To explicitly compute the generating series, two Hopf algebras are needed, the existing output feedback Hopf algebra used to describe dynamic output …