This book examines the notions of dimension and decomposition for module categories. It discusses some basic properties of quasidecomposition functions and the complete lattice of all quasidecomposition functions taking values in a fixed given lattice.

This book examines the notions of dimension and decomposition for module categories. It discusses some basic properties of quasidecomposition functions and the complete lattice of all quasidecomposition functions taking values in a fixed given lattice.

Semiring theory stands with a foot in each of two mathematical domains. The first being abstract algebra and the other the fields of applied mathematics such as optimization theory, the theory of discrete-event dynamical systems, automata theory, and formal language theory, as well as from the allied areas of theoretical computer science and theoretical physics. Most important applications of semiring theory in these areas turn out to revolve around the problem of finding the equalizer of a pair of affine maps between two semimodules. In this volume, we chart the state of the art on solving this problem, and present many specific cases of applications.

This book is essentially the third part of a trilogy, along with Semirings and their Applications, and Power Algebras over Semirings, both written by the same author and published by Kluwer Academic Publishers in 1999. While each book can be read independently of the others, to get the full force of the theory and applications one should have access to all three.

This work will be of interest to academic and industrial researchers and graduate students. The intent of the book is to bring the applications to the attention of the abstract mathematicians and to make the abstract mathematics available to those who are using these tools in an ad-hoc manner without realizing the full force of the theory.

This book is an extensively revised version of my textbook "Yesodot HaAlgebra HaLiniarit" (The Foundations of Linear Algebra) used at many universities in Israel. It is designed for a comprehensive one-year course in linear algebra (112 lecture hours) for mathematics majors. Therefore, I assume that the student already has a certain amount of mathematical background - including set theory, mathematical induction, basic analytic geometry, and elementary calculus - as wellas a modicum of mathematical sophistication. My intention is to provide not only a solid basis in the abstract theory of linear algebra, but also to provide examples of the application of this theory to other branches ofmathematics and computer science. Thus, for example, the introduction of finite fields is dictated by the needs of students studying algebraic coding theory as an immediate followup to their linear algebra studies. Many of the students studying linear algebra either are familiar with the care and feeding of computers before they begin their studies or are simultaneously en rolled in an introductory computer science course. Therefore, consideration of the more computational aspects of linear algebra - such as the solution of systems of linear equations and the calculation of eigenvalues - is delayed until all students are assumed able to write computer programs for this purpose. Beginning with Chap ter VII, there is an implicit assumption that the student has access to a personal computer and knows how to use it."

This monograph is a continuation of several themes presented in my previous books [146, 149]. In those volumes, I was concerned primarily with the properties of semirings. Here, the objects of investigation are sets of the form RA, where R is a semiring and A is a set having a certain structure. The problem is one of translating that structure to RA in some "natural" way. As such, it tries to find a unified way of dealing with diverse topics in mathematics and theoretical com puter science as formal language theory, the theory of fuzzy algebraic structures, models of optimal control, and many others. Another special case is the creation of "idempotent analysis" and similar work in optimization theory. Unlike the case of the previous work, which rested on a fairly established mathematical foundation, the approach here is much more tentative and docimastic. This is an introduction to, not a definitative presentation of, an area of mathematics still very much in the making. The basic philosphical problem lurking in the background is one stated suc cinctly by Hahle and Sostak [185]: ". . . to what extent basic fields of mathematics like algebra and topology are dependent on the underlying set theory?" The conflicting definitions proposed by various researchers in search of a resolution to this conundrum show just how difficult this problem is to see in a proper light.

There is no branch of mathematics, however abstract, which may not some day be applied to phenomena of the real world. - Nikolai Ivanovich Lobatchevsky This book is an extensively-revised and expanded version of "The Theory of Semirings, with Applicationsin Mathematics and Theoretical Computer Science" [Golan, 1992], first published by Longman. When that book went out of print, it became clear - in light of the significant advances in semiring theory over the past years and its new important applications in such areas as idempotent analysis and the theory of discrete-event dynamical systems - that a second edition incorporating minor changes would not be sufficient and that a major revision of the book was in order. Therefore, though the structure of the first "dition was preserved, the text was extensively rewritten and substantially expanded. In particular, references to many interesting and applications of semiring theory, developed in the past few years, had to be added. Unfortunately, I find that it is best not to go into these applications in detail, for that would entail long digressions into various domains of pure and applied mathematics which would only detract from the unity of the volume and increase its length considerably. However, I have tried to provide an extensive collection of examples to arouse the reader's interest in applications, as well as sufficient citations to allow the interested reader to locate them. For the reader's convenience, an index to these citations is given at the end of the book .

Semiring theory stands with a foot in each of two mathematical domains. The first being abstract algebra and the other the fields of applied mathematics such as optimization theory, the theory of discrete-event dynamical systems, automata theory, and formal language theory, as well as from the allied areas of theoretical computer science and theoretical physics. Most important applications of semiring theory in these areas turn out to revolve around the problem of finding the equalizer of a pair of affine maps between two semimodules. In this volume, we chart the state of the art on solving this problem, and present many specific cases of applications.

This book is essentially the third part of a trilogy, along with Semirings and their Applications, and Power Algebras over Semirings, both written by the same author and published by Kluwer Academic Publishers in 1999. While each book can be read independently of the others, to get the full force of the theory and applications one should have access to all three.

This work will be of interest to academic and industrial researchers and graduate students. The intent of the book is to bring the applications to the attention of the abstract mathematicians and to make the abstract mathematics available to those who are using these tools in an ad-hoc manner without realizing the full force of the theory.

There is no branch of mathematics, however abstract, which may not some day be applied to phenomena of the real world. - Nikolai Ivanovich Lobatchevsky This book is an extensively-revised and expanded version of "The Theory of Semirings, with Applicationsin Mathematics and Theoretical Computer Science" [Golan, 1992], first published by Longman. When that book went out of print, it became clear - in light of the significant advances in semiring theory over the past years and its new important applications in such areas as idempotent analysis and the theory of discrete-event dynamical systems - that a second edition incorporating minor changes would not be sufficient and that a major revision of the book was in order. Therefore, though the structure of the first "dition was preserved, the text was extensively rewritten and substantially expanded. In particular, references to many interesting and applications of semiring theory, developed in the past few years, had to be added. Unfortunately, I find that it is best not to go into these applications in detail, for that would entail long digressions into various domains of pure and applied mathematics which would only detract from the unity of the volume and increase its length considerably. However, I have tried to provide an extensive collection of examples to arouse the reader's interest in applications, as well as sufficient citations to allow the interested reader to locate them. For the reader's convenience, an index to these citations is given at the end of the book .

This monograph is a continuation of several themes presented in my previous books [146, 149]. In those volumes, I was concerned primarily with the properties of semirings. Here, the objects of investigation are sets of the form RA, where R is a semiring and A is a set having a certain structure. The problem is one of translating that structure to RA in some "natural" way. As such, it tries to find a unified way of dealing with diverse topics in mathematics and theoretical com puter science as formal language theory, the theory of fuzzy algebraic structures, models of optimal control, and many others. Another special case is the creation of "idempotent analysis" and similar work in optimization theory. Unlike the case of the previous work, which rested on a fairly established mathematical foundation, the approach here is much more tentative and docimastic. This is an introduction to, not a definitative presentation of, an area of mathematics still very much in the making. The basic philosphical problem lurking in the background is one stated suc cinctly by Hahle and Sostak [185]: ". . . to what extent basic fields of mathematics like algebra and topology are dependent on the underlying set theory?" The conflicting definitions proposed by various researchers in search of a resolution to this conundrum show just how difficult this problem is to see in a proper light.

This book is an extensively revised version of my textbook "Yesodot HaAlgebra HaLiniarit" (The Foundations of Linear Algebra) used at many universities in Israel. It is designed for a comprehensive one-year course in linear algebra (112 lecture hours) for mathematics majors. Therefore, I assume that the student already has a certain amount of mathematical background - including set theory, mathematical induction, basic analytic geometry, and elementary calculus - as wellas a modicum of mathematical sophistication. My intention is to provide not only a solid basis in the abstract theory of linear algebra, but also to provide examples of the application of this theory to other branches ofmathematics and computer science. Thus, for example, the introduction of finite fields is dictated by the needs of students studying algebraic coding theory as an immediate followup to their linear algebra studies. Many of the students studying linear algebra either are familiar with the care and feeding of computers before they begin their studies or are simultaneously en rolled in an introductory computer science course. Therefore, consideration of the more computational aspects of linear algebra - such as the solution of systems of linear equations and the calculation of eigenvalues - is delayed until all students are assumed able to write computer programs for this purpose. Beginning with Chap ter VII, there is an implicit assumption that the student has access to a personal computer and knows how to use it."

Linear algebra is a living, active branch of mathematics which is central to almost all other areas of mathematics, both pure and applied, as well as to computer science, to the physical, biological, and social sciences, and to engineering. It encompasses an extensive corpus of theoretical results as well as a large and rapidly-growing body of computational techniques. Unfortunately, in the past decade, the content of linear algebra courses required to complete an undergraduate degree in mathematics has been depleted to the extent that they fail to provide a sufficient theoretical or computational background. Students are not only less able to formulate or even follow mathematical proofs, they are also less able to understand the mathematics of the numerical algorithms they need for applications. Certainly, the material presented in the average undergraduate course is insufficient for graduate study. This book is intended to fill the gap which has developed by providing enough theoretical and computational material to allow the advanced undergraduate or beginning graduate student to overcome this deficiency and be able to work independently or in advanced courses. The book is intended to be used either as a self-study guide, a textbook for a course in advanced linear algebra, or as a reference book. It is also designed to prepare a student for the linear algebra portion of prelim exams or PhD qualifying exams. The volume is self-contained to the extent that it does not assume any previous formal knowledge of linear algebra, though the reader is assumed to have been exposed, at least informally, to some of the basic ideas and techniques, such as manipulation of small matrices and the solution of small systems of linear equations over the real numbers. More importantly, it assumes a seriousness of purpose, considerable motivation, and a modicum of mathematical sophistication on the part of the reader. In the latest edition, new major theorems have been added, as well as many new examples. There are over 130 additional exercises and many of the previous exercises have been revised or rewritten. In addition, a large number of additional biographical notes and thumbnail portraits of mathematicians have been included.