![]() |
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
||
|
Books > Science & Mathematics > Mathematics > Algebra > General
This is the first monograph devoted to clean ring and matrix theory. It aims to study a theory of expressing an element in a ring as the sum of some special ones, such as idempotents, units, nilpotents, tripotents, involutions, etc. A matrix over such rings is thereby expressed as the sum of some special matrices. Also another topics on the behaviors of topological properties and *-properties of such rings are investigated.The book is based on the results of various published papers, particularly, by the authors'. It is accessible for students familiar with general abstract algebra, while the topics are interesting for researchers in the field of ring, matrix and operator theory.
New to the Fourth Edition Reorganised and revised chapter seven and thirteen New exercises and examples Expanded, updated references Further historical material on figures besides Galois: Omar Khayyam, Vandermonde, Ruffini, and Abel A new final chapter discussing other directions in which Galois Theory has developed: the inverse Galois problem, differential Galois theory, and a (very) brief introduction to p-adic Galois representations.
An increasing complexity of models used to predict real-world systems leads to the need for algorithms to replace complex models with far simpler ones, while preserving the accuracy of the predictions. This two-volume handbook covers methods as well as applications. This second volume focuses on applications in engineering, biomedical engineering, computational physics and computer science.
Tilting theory originates in the representation theory of finite dimensional algebras. Today the subject is of much interest in various areas of mathematics, such as finite and algebraic group theory, commutative and non-commutative algebraic geometry, and algebraic topology. The aim of this book is to present the basic concepts of tilting theory as well as the variety of applications. It contains a collection of key articles, which together form a handbook of the subject, and provide both an introduction and reference for newcomers and experts alike.
Capturing the state of the art of the interplay between positivity, noncommutative analysis, and related areas including partial differential equations, harmonic analysis, and operator theory, this volume was initiated on the occasion of the Delft conference in honour of Ben de Pagter's 65th birthday. It will be of interest to researchers in positivity, noncommutative analysis, and related fields. Contributions by Shavkat Ayupov, Amine Ben Amor, Karim Boulabiar, Qingying Bu, Gerard Buskes, Martijn Caspers, Jurie Conradie, Garth Dales, Marcel de Jeu, Peter Dodds, Theresa Dodds, Julio Flores, Jochen Gluck, Jacobus Grobler, Wolter Groenevelt, Markus Haase, Klaas Pieter Hart, Francisco Hernandez, Jamel Jaber, Rien Kaashoek, Turabay Kalandarov, Anke Kalauch, Arkady Kitover, Erik Koelink, Karimbergen Kudaybergenov, Louis Labuschagne, Yongjin Li, Nick Lindemulder, Emiel Lorist, Qi Lu, Miek Messerschmidt, Susumu Okada, Mehmet Orhon, Denis Potapov, Werner Ricker, Stephan Roberts, Pablo Roman, Anton Schep, Claud Steyn, Fedor Sukochev, James Sweeney, Guido Sweers, Pedro Tradacete, Jan Harm van der Walt, Onno van Gaans, Jan van Neerven, Arnoud van Rooij, Freek van Schagen, Dominic Vella, Mark Veraar, Anthony Wickstead, Marten Wortel, Ivan Yaroslavtsev, and Dmitriy Zanin.
Working out solutions to polynomial equations is a mathematical problem that dates from antiquity. Galois developed a theory in which the obstacle to solving a polynomial equation is an associated collection of symmetries. Obtaining a root requires "breaking" that symmetry. When the degree of an equation is at least five, Galois Theory established that there is no formula for the solutions like those found in lower degree cases. However, this negative result doesn't mean that the practice of equation-solving ends. In a recent breakthrough, Doyle and McMullen devised a solution to the fifth-degree equation that uses geometry, algebra, and dynamics to exploit icosahedral symmetry. Polynomials, Dynamics, and Choice: The Price We Pay for Symmetry is organized in two parts, the first of which develops an account of polynomial symmetry that relies on considerations of algebra and geometry. The second explores beyond polynomials to spaces consisting of choices ranging from mundane decisions to evolutionary algorithms that search for optimal outcomes. The two algorithms in Part I provide frameworks that capture structural issues that can arise in deliberative settings. While decision-making has been approached in mathematical terms, the novelty here is in the use of equation-solving algorithms to illuminate such problems. Features Treats the topic-familiar to many-of solving polynomial equations in a way that's dramatically different from what they saw in school Accessible to a general audience with limited mathematical background Abundant diagrams and graphics.
Working out solutions to polynomial equations is a mathematical problem that dates from antiquity. Galois developed a theory in which the obstacle to solving a polynomial equation is an associated collection of symmetries. Obtaining a root requires "breaking" that symmetry. When the degree of an equation is at least five, Galois Theory established that there is no formula for the solutions like those found in lower degree cases. However, this negative result doesn't mean that the practice of equation-solving ends. In a recent breakthrough, Doyle and McMullen devised a solution to the fifth-degree equation that uses geometry, algebra, and dynamics to exploit icosahedral symmetry. Polynomials, Dynamics, and Choice: The Price We Pay for Symmetry is organized in two parts, the first of which develops an account of polynomial symmetry that relies on considerations of algebra and geometry. The second explores beyond polynomials to spaces consisting of choices ranging from mundane decisions to evolutionary algorithms that search for optimal outcomes. The two algorithms in Part I provide frameworks that capture structural issues that can arise in deliberative settings. While decision-making has been approached in mathematical terms, the novelty here is in the use of equation-solving algorithms to illuminate such problems. Features Treats the topic-familiar to many-of solving polynomial equations in a way that's dramatically different from what they saw in school Accessible to a general audience with limited mathematical background Abundant diagrams and graphics.
The once esoteric idea of embedding scientific computing into a probabilistic framework, mostly along the lines of the Bayesian paradigm, has recently enjoyed wide popularity and found its way into numerous applications. This book provides an insider's view of how to combine two mature fields, scientific computing and Bayesian inference, into a powerful language leveraging the capabilities of both components for computational efficiency, high resolution power and uncertainty quantification ability. The impact of Bayesian scientific computing has been particularly significant in the area of computational inverse problems where the data are often scarce or of low quality, but some characteristics of the unknown solution may be available a priori. The ability to combine the flexibility of the Bayesian probabilistic framework with efficient numerical methods has contributed to the popularity of Bayesian inversion, with the prior distribution being the counterpart of classical regularization. However, the interplay between Bayesian inference and numerical analysis is much richer than providing an alternative way to regularize inverse problems, as demonstrated by the discussion of time dependent problems, iterative methods, and sparsity promoting priors in this book. The quantification of uncertainty in computed solutions and model predictions is another area where Bayesian scientific computing plays a critical role. This book demonstrates that Bayesian inference and scientific computing have much more in common than what one may expect, and gradually builds a natural interface between these two areas.
This book offers an introduction to applications prompted by tensor analysis, especially by the spectral tensor theory developed in recent years. It covers applications of tensor eigenvalues in multilinear systems, exponential data fitting, tensor complementarity problems, and tensor eigenvalue complementarity problems. It also addresses higher-order diffusion tensor imaging, third-order symmetric and traceless tensors in liquid crystals, piezoelectric tensors, strong ellipticity for elasticity tensors, and higher-order tensors in quantum physics. This book is a valuable reference resource for researchers and graduate students who are interested in applications of tensor eigenvalues.
Primarily concerned with the study of cohomology theories of general topological spaces with "general coefficient systems", the parts of sheaf theory covered here are those areas important to algebraic topology. Among the many innovations in this book, the concept of the "tautness" of a subspace is introduced and exploited; the fact that sheaf theoretic cohomology satisfies the homotopy property is proved for general topological spaces; and relative cohomology is introduced into sheaf theory. A list of exercises at the end of each chapter helps students to learn the material, and solutions to many of the exercises are given in an appendix. This new edition of a classic has been substantially rewritten and now includes some 80 additional examples and further explanatory material, as well as new sections on Cech cohomology, the Oliver transfer, intersection theory, generalised manifolds, locally homogeneous spaces, homological fibrations and p- adic transformation groups. Readers should have a thorough background in elementary homological algebra and in algebraic topology.
This book provides a systematic, rigorous and self-contained treatment of positive dynamical systems. A dynamical system is positive when all relevant variables of a system are nonnegative in a natural way. This is in biology, demography or economics, where the levels of populations or prices of goods are positive. The principle also finds application in electrical engineering, physics and computer sciences. "The author has greatly expanded the field of positive systems in surprising ways." - Prof. Dr. David G. Luenberger, Stanford University(USA)
Loop groups, the simplest class of infinite dimensional Lie groups, have recently been the subject of intense study. This book gives a complete and self-contained account of what is known about them from a geometrical and analytical point of view, drawing together the many branches of mathematics from which current theory developed--algebra, geometry, analysis, combinatorics, and the mathematics of quantum field theory. The authors discuss Loop groups' applications to simple particle physics and explain how the mathematics used in connection with Loop groups is itself interesting and valuable, thereby making this work accessible to mathematicians in many fields.
Features Written to be self-contained. Ideal as a primary textbook for an undergraduate course in linear algebra. Applications of the general theory which are of interest to disciplines outside of mathematics, such as engineering.
Features Written to be self-contained. Ideal as a primary textbook for an undergraduate course in linear algebra. Applications of the general theory which are of interest to disciplines outside of mathematics, such as engineering.
This work deals with the matrix methods of continuous signal and image processing according to which strip-transformation is used. The authors suggest ways to solve a problem of evaluating potential noise immunity and synthesis of an optimal filter for the case of pulse noises, of applying the two-dimensional strip-transformation for storage and noise immune transmission of images. The strip-transformation of images is illustrated by examples and classes of images invariant relative to symmetrical orthogonal transformations. The monograph is intended for scientists and specialists whose activities are connected with computer signals and images processing, instrumentation and metrology. It can also be used by undergraduates, as well as by post-graduates for studying computer methods of signal and image processing.
Linear algebra is one of the most important branches of mathematics - important because of its many applications to other areas of mathematics, and important because it contains a wealth of ideas and results which are basic to pure mathematics. This book gives an introduction to linear algebra, and develops and proves its fundamental properties and theorems taking a pure mathematical approach - linear algebra contains some fine pure mathematics. Its main topics include: vector spaces and algebras, dimension, linear maps, direct sums, and (briefly) exact sequences; matrices and their connections with linear maps, determinants (properties proved using some elementary group theory), and linear equations; Cayley-Hamilton and Jordan theorems leading to the spectrum of a linear map - this provides a geometric-type description of these maps; Hermitian and inner product spaces introducing some metric properties (distance, perpendicularity etc.) into the theory, also unitary and orthogonal maps and matrices; applications to finite fields, mathematical coding theory, finite matrix groups, the geometry of quadratic forms, quaternions and Cayley numbers, and some basic group representation theory; and, a large number of examples, exercises and problems are provided. It gives answers and/or sketch solutions to all of the problems in an appendix -some of these are theoretical and some numerical, both types are important. No particular computer algebra package is discussed but a number of the exercises are intended to be solved using one of these packages chosen by the reader. The approach is pure-mathematical, and the intended readership is undergraduate mathematicians, also anyone who requires a more than basic understanding of the subject. This book will be most useful for a 'second course' in linear algebra, that is for students that have seen some elementary matrix algebra. But as all terms are defined from scratch, this book can be used for a 'first course' for more advanced students.
This book is a textbook for a semester-long or year-long introductory course in abstract algebra at the upper undergraduate or beginning graduate level.It treats set theory, group theory, ring and ideal theory, and field theory (including Galois theory), and culminates with a treatment of Dedekind rings, including rings of algebraic integers.In addition to treating standard topics, it contains material not often dealt with in books at this level. It provides a fresh perspective on the subjects it covers, with, in particular, distinctive treatments of factorization theory in integral domains and of Galois theory.As an introduction, it presupposes no prior knowledge of abstract algebra, but provides a well-motivated, clear, and rigorous treatment of the subject, illustrated by many examples. Written with an eye toward number theory, it contains numerous applications to number theory (including proofs of Fermat's theorem on sums of two squares and of the Law of Quadratic Reciprocity) and serves as an excellent basis for further study in algebra in general and number theory in particular.Each of its chapters concludes with a variety of exercises ranging from the straightforward to the challenging in order to reinforce students' knowledge of the subject. Some of these are particular examples that illustrate the theory while others are general results that develop the theory further.
Exact Finite-Difference Schemes is a first overview of the topic also describing the state-of-the-art in this field of numerical analysis. Construction of exact difference schemes for various parabolic and elliptic partial differential equations are discussed, including vibrations and transport problems. After this, applications are discussed, such as the discretisation of ODEs and PDEs and numerical methods for stochastic differential equations. Contents: Basic notation Preliminary results Hyperbolic equations Parabolic equations Use of exact difference schemes to construct NSFD discretizations of differential equations Exact and truncated difference schemes for boundary-value problem Exact difference schemes for stochastic differential equations Numerical blow-up time Bibliography
Descriptor linear systems theory is an important part in the general field of control systems theory, and has attracted much attention in the last two decades. In spite of the fact that descriptor linear systems theory has been a topic very rich in content, there have been only a few books on this topic. This book provides a systematic introduction to the theory of continuous-time descriptor linear systems and aims to provide a relatively systematic introduction to the basic results in descriptor linear systems theory. The clear representation of materials and a large number of examples make this book easy to understand by a large audience. General readers will find in this book a comprehensive introduction to the theory of descriptive linear systems. Researchers will find a comprehensive description of the most recent results in this theory and students will find a good introduction to some important problems in linear systems theory.
This monograph provides a modern introduction to the theory of quantales. First coined by C.J. Mulvey in 1986, quantales have since developed into a significant topic at the crossroads of algebra and logic, of notable interest to theoretical computer science. This book recasts the subject within the powerful framework of categorical algebra, showcasing its versatility through applications to C*- and MV-algebras, fuzzy sets and automata. With exercises and historical remarks at the end of each chapter, this self-contained book provides readers with a valuable source of references and hints for future research. This book will appeal to researchers across mathematics and computer science with an interest in category theory, lattice theory, and many-valued logic.
This book is mainly intended for first-year University students who undertake a basic abstract algebra course, as well as instructors. It contains the basic notions of abstract algebra through solved exercises as well as a 'True or False' section in each chapter. Each chapter also contains an essential background section, which makes the book easier to use.
The De Gruyter Studies in Mathematical Physics are devoted to the publication of monographs and high-level texts in mathematical physics. They cover topics and methods in fields of current interest, with an emphasis on didactical presentation. The series will enable readers to understand, apply and develop further, with sufficient rigor, mathematical methods to given problems in physics. For this reason, works with a few authors are preferred over edited volumes. The works in this series are aimed at advanced students and researchers in mathematical and theoretical physics. They can also serve as secondary reading for lectures and seminars at advanced levels.
In several proofs from the theory of finite-dimensional Lie algebras, an essential contribution comes from the Jordan canonical structure of linear maps acting on finite-dimensional vector spaces. On the other hand, there exist classical results concerning Lie algebras which advise us to use infinite-dimensional vector spaces as well. For example, the classical Lie Theorem asserts that all finite-dimensional irreducible representations of solvable Lie algebras are one-dimensional. Hence, from this point of view, the solvable Lie algebras cannot be distinguished from one another, that is, they cannot be classified. Even this example alone urges the infinite-dimensional vector spaces to appear on the stage. But the structure of linear maps on such a space is too little understood; for these linear maps one cannot speak about something like the Jordan canonical structure of matrices. Fortunately there exists a large class of linear maps on vector spaces of arbi trary dimension, having some common features with the matrices. We mean the bounded linear operators on a complex Banach space. Certain types of bounded operators (such as the Dunford spectral, Foia decomposable, scalar generalized or Colojoara spectral generalized operators) actually even enjoy a kind of Jordan decomposition theorem. One of the aims of the present book is to expound the most important results obtained until now by using bounded operators in the study of Lie algebras."
Key problems and conjectures have played an important role in promoting the development of Ramsey theory, a field where great progress has been made during the past two decades, with some old problems solved and many new problems proposed. The present book will be helpful to readers who wish to learn about interesting problems in Ramsey theory, to see how they are interconnected, and then to study them in depth. This book is the first problem book of such scope in Ramsey theory. Many unsolved problems, conjectures and related partial results in Ramsey theory are presented, in areas such as extremal graph theory, additive number theory, discrete geometry, functional analysis, algorithm design, and in other areas. Most presented problems are easy to understand, but they may be difficult to solve. They can be appreciated on many levels and by a wide readership, ranging from undergraduate students majoring in mathematics to research mathematicians. This collection is an essential reference for mathematicians working in combinatorics and number theory, as well as for computer scientists studying algorithms. Contents Some definitions and notations Ramsey theory Bi-color diagonal classical Ramsey numbers Paley graphs and lower bounds for R(k, k) Bi-color off-diagonal classical Ramsey numbers Multicolor classical Ramsey numbers Generalized Ramsey numbers Folkman numbers The Erdos-Hajnal conjecture Other Ramsey-type problems in graph theory On van der Waerden numbers and Szemeredi's theorem More problems of Ramsey type in additive number theory Sidon-Ramsey numbers Games in Ramsey theory Local Ramsey theory Set-coloring Ramsey theory Other problems and conjectures
This book is intended as a textbook for a one-term senior undergraduate (or graduate) course in Ring and Field Theory, or Galois theory. The book is ready for an instructor to pick up to teach without making any preparations.The book is written in a way that is easy to understand, simple and concise with simple historic remarks to show the beauty of algebraic results and algebraic methods. The book contains 240 carefully selected exercise questions of varying difficulty which will allow students to practice their own computational and proof-writing skills. Sample solutions to some exercise questions are provided, from which students can learn to approach and write their own solutions and proofs. Besides standard ones, some of the exercises are new and very interesting. The book contains several simple-to-use irreducibility criteria for rational polynomials which are not in any such textbook.This book can also serve as a reference for professional mathematicians. In particular, it will be a nice book for PhD students to prepare their qualification exams. |
You may like...
Additive Number Theory of Polynomials…
Gove W. Effinger, David R. Hayes
Hardcover
R1,326
Discovery Miles 13 260
Theory and Applications of Ordered Fuzzy…
Piotr Prokopowicz, Jacek Czerniak, …
Hardcover
R1,497
Discovery Miles 14 970
Algebra for Beginners - With Numerous…
I. (Isaac) 1820-1884 Todhunter
Hardcover
R889
Discovery Miles 8 890
|