Explore the vast range of titles available.

This computationally oriented book describes and explains the mathematical relationships among matrices, moments, orthogonal polynomials, quadrature rules, and the Lanczos and conjugate gradient algorithms. The book bridges different mathematical areas to obtain algorithms to estimate bilinear forms involving two vectors and a function of the matrix. The first part of the book provides the necessary mathematical background and explains the theory. The second part describes the applications and gives numerical examples of the algorithms and techniques developed in the first part. Applications addressed in the book include computing elements of functions of matrices; obtaining estimates of the error norm in iterative methods for solving linear systems and computing parameters in least squares and total least squares; and solving ill-posed problems using Tikhonov regularization. This book will interest researchers in numerical linear algebra and matrix computations, as well as scientists and engineers working on problems involving computation of bilinear forms.

The first two chapters of this book offer a modern, self-contained exposition of the elementary theory of triangulated categories and their quotients. The simple, elegant presentation of these known results makes these chapters eminently suitable as a text for graduate students. The remainder of the book is devoted to new research, providing, among other material, some remarkable improvements on Brown's classical representability theorem. In addition, the author introduces a class of triangulated categories\"--the \"well generated triangulated categories\"--and studies their properties. This exercise is particularly worthwhile in that many examples of triangulated categories are well generated, and the book proves several powerful theorems for this broad class. These chapters will interest researchers in the fields of algebra, algebraic geometry, homotopy theory, and mathematical physics.

This book introduces the study of algebra induced by combinatorial objects called directed graphs. These graphs are used as tools in the analysis of graph-theoretic problems and in the characterization and solution of analytic problems. The book presents recent research in operator algebra theory connected with discrete and combinatorial mathematic

This book studies algebraic representations of graphs in order to investigate combinatorial structures via local symmetries.Topological, combinatorial and algebraic classifications are distinguished by invariants of polynomial type and algorithms are designed to determine all such classifications with complexity analysis.

This book teaches what is known as higher mathematics - in other words, mathematics that extends beyond simple calculation, which is generally taught in the last years of high school and extended and learned in greater depth in the first semester of college study. It begins with an introduction to the language of mathematics and then covers the themes of arithmetic, algebra, geometry, and infinitesimal calculus.

This book provides an accessible and self-contained introduction to the theory of algebraic curves over a finite field, a subject that has been of fundamental importance to mathematics for many years and that has essential applications in areas such as finite geometry, number theory, error-correcting codes, and cryptology. Unlike other books, this one emphasizes the algebraic geometry rather than the function field approach to algebraic curves. The authors begin by developing the general theory of curves over any field, highlighting peculiarities occurring for positive characteristic and requiring of the reader only basic knowledge of algebra and geometry. The special properties that a curve over a finite field can have are then discussed. The geometrical theory of linear series is used to find estimates for the number of rational points on a curve, following the theory of Stöhr and Voloch. The approach of Hasse and Weil via zeta functions is explained, and then attention turns to more advanced results: a state-of-the-art introduction to maximal curves over finite fields is provided; a comprehensive account is given of the automorphism group of a curve; and some applications to coding theory and finite geometry are described. The book includes many examples and exercises. It is an indispensable resource for researchers and the ideal textbook for graduate students.

Higher category theory is generally regarded as technical and forbidding, but part of it is considerably more tractable: the theory of infinity-categories, higher categories in which all higher morphisms are assumed to be invertible. InHigher Topos Theory, Jacob Lurie presents the foundations of this theory, using the language of weak Kan complexes introduced by Boardman and Vogt, and shows how existing theorems in algebraic topology can be reformulated and generalized in the theory's new language. The result is a powerful theory with applications in many areas of mathematics. The book's first five chapters give an exposition of the theory of infinity-categories that emphasizes their role as a generalization of ordinary categories. Many of the fundamental ideas from classical category theory are generalized to the infinity-categorical setting, such as limits and colimits, adjoint functors, ind-objects and pro-objects, locally accessible and presentable categories, Grothendieck fibrations, presheaves, and Yoneda's lemma. A sixth chapter presents an infinity-categorical version of the theory of Grothendieck topoi, introducing the notion of an infinity-topos, an infinity-category that resembles the infinity-category of topological spaces in the sense that it satisfies certain axioms that codify some of the basic principles of algebraic topology. A seventh and final chapter presents applications that illustrate connections between the theory of higher topoi and ideas from classical topology.

This unique book’s subject is meanders (connected, oriented, non-self-intersecting planar curves intersecting the horizontal line transversely) in the context of dynamical systems. By interpreting the transverse intersection points as vertices and the arches arising from these curves as directed edges, meanders are introduced from the graphtheoretical perspective. Supplementing the rigorous results, mathematical methods, constructions, and examples of meanders with a large number of insightful figures, issues such as connectivity and the number of connected components of meanders are studied in detail with the aid of collapse and multiple collapse, forks, and chambers. Moreover, the author introduces a large class of Morse meanders by utilizing the right and left one-shift maps, and presents connections to Sturm global attractors, seaweed and Frobenius Lie algebras, and the classical Yang-Baxter equation. Contents Seaweed Meanders Meanders Morse Meanders and Sturm Global Attractors Right and Left One-Shifts Connection Graphs of Type I, II, III and IV Meanders and the Temperley-Lieb Algebra Representations of Seaweed Lie Algebras CYBE and Seaweed Meanders

The category of all modules over a general associative ring is too complex to admit any reasonable classification. Thus, unless the ring is of finite representation type, one must limit attempts at classification to some restricted subcategories of modules. The wild character of the category of all modules, or of one of its subcategories C is often indicated by the presence of a realization theorem, that is, by the fact that any reasonable algebra is isomorphic to the endomorphism algebra of a module from C. This results in the existence of pathological direct sum decompositions and these are generally viewed as obstacles to the classification. Realization theorems have thus become important indicators of the non-classification theory of modules. In order to overcome this problem, approximation theory of modules has been developed over the past few decades. The idea here is to select suitable subcategories C whose modules can be classified, and then to approximate arbitrary modules by ones from C. These approximations are neither unique nor functorial in general, but there is always a rich supply available appropriate to the requirements of various particular applications. Thus approximation theory has developed into an important part of the classification theory of modules. In this monograph the two methods are brought together. First the approximation theory of modules is developed and some of its recent applications, notably to infinite dimensional tilting theory, are presented. Then some prediction principles from set theory are introduced and these become the principal tools in the establishment of appropriate realization theorems. The monograph starts from basic facts and gradually develops the theory towards its present frontiers. It is suitable both for graduate students interested in algebra and for experts in module and representation theory.

\"The book provides an introduction to modern abstract algebra and its applications. It covers all major topics of classical theory of numbers, groups, rings, fields and finite dimensional algebras. The book also provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. In particular, it considers algorithm RSA, secret sharing algorithms, Diffie-Hellman Scheme and ElGamal cryptosystem based on discrete logarithm problem. It also presents Buchberger’s algorithm which is one of the important algorithms for constructing Gröbner basis. Key Features: Covers all major topics of classical theory of modern abstract algebra such as groups, rings and fields and their applications. In addition it provides the introduction to the number theory, theory of finite fields, finite dimensional algebras and their applications. Provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. Presents numerous examples illustrating the theory and applications. It is also filled with a number of exercises of various difficulty. Describes in detail the construction of the Cayley-Dickson construction for finite dimensional algebras, in particular, algebras of quaternions and octonions and gives their applications in the number theory and computer graphics.\"