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 book is the first volume of an intensive "Russian-style" two-year graduate course in abstract algebra, and introduces readers to the basic algebraic structures - fields, rings, modules, algebras, groups, and categories - and explains the main principles of and methods for working with them. The course covers substantial areas of advanced combinatorics, geometry, linear and multilinear algebra, representation theory, category theory, commutative algebra, Galois theory, and algebraic geometry - topics that are often overlooked in standard undergraduate courses. This textbook is based on courses the author has conducted at the Independent University of Moscow and at the Faculty of Mathematics in the Higher School of Economics. The main content is complemented by a wealth of exercises for class discussion, some of which include comments and hints, as well as problems for independent study.
Based on their research experience, the authors propose a reference textbook in two volumes on the theory of generalized locally Toeplitz sequences and their applications. This first volume focuses on the univariate version of the theory and the related applications in the unidimensional setting, while the second volume, which addresses the multivariate case, is mainly devoted to concrete PDE applications. This book systematically develops the theory of generalized locally Toeplitz (GLT) sequences and presents some of its main applications, with a particular focus on the numerical discretization of differential equations (DEs). It is the first book to address the relatively new field of GLT sequences, which occur in numerous scientific applications and are especially dominant in the context of DE discretizations. Written for applied mathematicians, engineers, physicists, and scientists who (perhaps unknowingly) encounter GLT sequences in their research, it is also of interest to those working in the fields of Fourier and functional analysis, spectral analysis of DE discretization matrices, matrix analysis, measure and operator theory, numerical analysis and linear algebra. Further, it can be used as a textbook for a graduate or advanced undergraduate course in numerical analysis.
This book presents a collection of expository and research papers on various topics in matrix and operator theory, contributed by several experts on the occasion of Albrecht Boettcher's 60th birthday. Albrecht Boettcher himself has made substantial contributions to the subject in the past. The book also includes a biographical essay, a complete bibliography of Albrecht Boettcher's work and brief informal notes on personal encounters with him. The book is of interest to graduate and advanced undergraduate students majoring in mathematics, researchers in matrix and operator theory as well as engineers and applied mathematicians.
The topics covered in this book, written by researchers at the forefront of their field, represent some of the most relevant research areas in modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography. The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker, as well as 37 cutting-edge research communications presented at the 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), held at the Castle of Palmela in September 2014. The event's scientific program consisted of four invited talks and 39 regular talks by authors from 24 different countries. This conference provided an ideal opportunity for communicating new results, exchanging ideas, strengthening international cooperation, and introducing young researchers into the coding theory community.
This volume arose from the Third Annual Workshop on Inverse Problems, held in Stockholm on May 2-6, 2012. The proceedings present new analytical developments and numerical methods for solutions of inverse and ill-posed problems, which consistently pose complex challenges to the development of effective numerical methods. The book highlights recent research focusing on reliable numerical techniques for the solution of inverse problems, with relevance to a range of fields including acoustics, electromagnetics, optics, medical imaging, and geophysics.
This two-volume work introduces the theory and applications of Schur-convex functions. The second volume mainly focuses on the application of Schur-convex functions in sequences inequalities, integral inequalities, mean value inequalities for two variables, mean value inequalities for multi-variables, and in geometric inequalities.
Affine algebraic geometry has progressed remarkably in the last half a century, and its central topics are affine spaces and affine space fibrations. This authoritative book is aimed at graduate students and researchers alike, and studies the geometry and topology of morphisms of algebraic varieties whose general fibers are isomorphic to the affine space while describing structures of algebraic varieties with such affine space fibrations.
This lecture notes volume presents significant contributions from the "Algebraic Geometry and Number Theory" Summer School, held at Galatasaray University, Istanbul, June 2-13, 2014. It addresses subjects ranging from Arakelov geometry and Iwasawa theory to classical projective geometry, birational geometry and equivariant cohomology. Its main aim is to introduce these contemporary research topics to graduate students who plan to specialize in the area of algebraic geometry and/or number theory. All contributions combine main concepts and techniques with motivating examples and illustrative problems for the covered subjects. Naturally, the book will also be of interest to researchers working in algebraic geometry, number theory and related fields.
This unique collection of research papers offers a comprehensive and up-to-date guide to algebraic approaches to rough sets and reasoning with vagueness. It bridges important gaps, outlines intriguing future research directions, and connects algebraic approaches to rough sets with those for other forms of approximate reasoning. In addition, the book reworks algebraic approaches to axiomatic granularity. Given its scope, the book offers a valuable resource for researchers and teachers in the areas of rough sets and algebras of rough sets, algebraic logic, non classical logic, fuzzy sets, possibility theory, formal concept analysis, computational learning theory, category theory, and other formal approaches to vagueness and approximate reasoning. Consultants in AI and allied fields will also find the book to be of great practical value.
This volume presents a collection of articles highlighting recent developments in commutative algebra and related non-commutative generalizations. It also includes an extensive bibliography and lists a substantial number of open problems that point to future directions of research in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics and research methods include Noetherian and non-Noetherian ring theory, module theory and integer-valued polynomials along with connections to algebraic number theory, algebraic geometry, topology and homological algebra. Most of the eighteen contributions are authored by attendees of the two conferences in commutative algebra that were held in the summer of 2016: "Recent Advances in Commutative Ring and Module Theory," Bressanone, Italy; "Conference on Rings and Polynomials" Graz, Austria. There is also a small collection of invited articles authored by experts in the area who could not attend either of the conferences. Following the model of the talks given at these conferences, the volume contains a number of comprehensive survey papers along with related research articles featuring recent results that have not yet been published elsewhere.
Quaternionic and Clifford analysis are an extension of complex analysis into higher dimensions. The unique starting point of Wolfgang Sproessig's work was the application of quaternionic analysis to elliptic differential equations and boundary value problems. Over the years, Clifford analysis has become a broad-based theory with a variety of applications both inside and outside of mathematics, such as higher-dimensional function theory, algebraic structures, generalized polynomials, applications of elliptic boundary value problems, wavelets, image processing, numerical and discrete analysis. The aim of this volume is to provide an essential overview of modern topics in Clifford analysis, presented by specialists in the field, and to honor the valued contributions to Clifford analysis made by Wolfgang Sproessig throughout his career.
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. Being a summary of the author's original work on graph embeddings, this book is an essential reference for researchers in graph theory. Contents Abstract Graphs Abstract Maps Duality Orientability Orientable Maps Nonorientable Maps Isomorphisms of Maps Asymmetrization Asymmetrized Petal Bundles Asymmetrized Maps Maps within Symmetry Genus Polynomials Census with Partitions Equations with Partitions Upper Maps of a Graph Genera of a Graph Isogemial Graphs Surface Embeddability
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.
The second edition of this highly praised textbook provides an introduction to tensors, group theory, and their applications in classical and quantum physics. Both intuitive and rigorous, it aims to demystify tensors by giving the slightly more abstract but conceptually much clearer definition found in the math literature, and then connects this formulation to the component formalism of physics calculations. New pedagogical features, such as new illustrations, tables, and boxed sections, as well as additional "invitation" sections that provide accessible introductions to new material, offer increased visual engagement, clarity, and motivation for students. Part I begins with linear algebraic foundations, follows with the modern component-free definition of tensors, and concludes with applications to physics through the use of tensor products. Part II introduces group theory, including abstract groups and Lie groups and their associated Lie algebras, then intertwines this material with that of Part I by introducing representation theory. Examples and exercises are provided in each chapter for good practice in applying the presented material and techniques. Prerequisites for this text include the standard lower-division mathematics and physics courses, though extensive references are provided for the motivated student who has not yet had these. Advanced undergraduate and beginning graduate students in physics and applied mathematics will find this textbook to be a clear, concise, and engaging introduction to tensors and groups. Reviews of the First Edition "[P]hysicist Nadir Jeevanjee has produced a masterly book that will help other physicists understand those subjects [tensors and groups] as mathematicians understand them... From the first pages, Jeevanjee shows amazing skill in finding fresh, compelling words to bring forward the insight that animates the modern mathematical view...[W]ith compelling force and clarity, he provides many carefully worked-out examples and well-chosen specific problems... Jeevanjee's clear and forceful writing presents familiar cases with a freshness that will draw in and reassure even a fearful student. [This] is a masterpiece of exposition and explanation that would win credit for even a seasoned author." -Physics Today "Jeevanjee's [text] is a valuable piece of work on several counts, including its express pedagogical service rendered to fledgling physicists and the fact that it does indeed give pure mathematicians a way to come to terms with what physicists are saying with the same words we use, but with an ostensibly different meaning. The book is very easy to read, very user-friendly, full of examples...and exercises, and will do the job the author wants it to do with style." -MAA Reviews
In this book the authors present an alternative set theory dealing with a more relaxed notion of infiniteness, called finitely supported mathematics (FSM). It has strong connections to the Fraenkel-Mostowski (FM) permutative model of Zermelo-Fraenkel (ZF) set theory with atoms and to the theory of (generalized) nominal sets. More exactly, FSM is ZF mathematics rephrased in terms of finitely supported structures, where the set of atoms is infinite (not necessarily countable as for nominal sets). In FSM, 'sets' are replaced either by `invariant sets' (sets endowed with some group actions satisfying a finite support requirement) or by `finitely supported sets' (finitely supported elements in the powerset of an invariant set). It is a theory of `invariant algebraic structures' in which infinite algebraic structures are characterized by using their finite supports. After explaining the motivation for using invariant sets in the experimental sciences as well as the connections with the nominal approach, admissible sets and Gandy machines (Chapter 1), the authors present in Chapter 2 the basics of invariant sets and show that the principles of constructing FSM have historical roots both in the definition of Tarski `logical notions' and in the Erlangen Program of Klein for the classification of various geometries according to invariants under suitable groups of transformations. Furthermore, the consistency of various choice principles is analyzed in FSM. Chapter 3 examines whether it is possible to obtain valid results by replacing the notion of infinite sets with the notion of invariant sets in the classical ZF results. The authors present techniques for reformulating ZF properties of algebraic structures in FSM. In Chapter 4 they generalize FM set theory by providing a new set of axioms inspired by the theory of amorphous sets, and so defining the extended Fraenkel-Mostowski (EFM) set theory. In Chapter 5 they define FSM semantics for certain process calculi (e.g., fusion calculus), and emphasize the links to the nominal techniques used in computer science. They demonstrate a complete equivalence between the new FSM semantics (defined by using binding operators instead of side conditions for presenting the transition rules) and the known semantics of these process calculi. The book is useful for researchers and graduate students in computer science and mathematics, particularly those engaged with logic and set theory.
This text seeks to generate interest in abstract algebra by introducing each new structure and topic via a real-world application. The down-to-earth presentation is accessible to a readership with no prior knowledge of abstract algebra. Students are led to algebraic concepts and questions in a natural way through their everyday experiences. Applications include: Identification numbers and modular arithmetic(linear) error-correcting codes, including cyclic codesruler and compass constructionscryptographysymmetry of patterns in the real plane "Abstract Algebra: Structure and Application" is suitable as a text for a first course on abstract algebra whose main purpose is to generate interest in the subject or as a supplementary text for more advanced courses. The material paves the way to subsequent courses that further develop the theory of abstract algebra and will appeal to students of mathematics, mathematics education, computer science, and engineering interested in applications of algebraic concepts.
In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.
This book addresses the mathematical aspects of modern image processing methods, with a special emphasis on the underlying ideas and concepts. It discusses a range of modern mathematical methods used to accomplish basic imaging tasks such as denoising, deblurring, enhancing, edge detection and inpainting. In addition to elementary methods like point operations, linear and morphological methods, and methods based on multiscale representations, the book also covers more recent methods based on partial differential equations and variational methods. Review of the German Edition: The overwhelming impression of the book is that of a very professional presentation of an appropriately developed and motivated textbook for a course like an introduction to fundamentals and modern theory of mathematical image processing. Additionally, it belongs to the bookcase of any office where someone is doing research/application in image processing. It has the virtues of a good and handy reference manual. (zbMATH, reviewer: Carl H. Rohwer, Stellenbosch)
For one- or two-semester junior orsenior level courses in Advanced Calculus, Analysis I, or Real Analysis. This title is part of the Pearson Modern Classicsseries. This text prepares students for future coursesthat use analytic ideas, such as real and complex analysis, partial andordinary differential equations, numerical analysis, fluid mechanics, anddifferential geometry. This book is designed to challenge advanced studentswhile encouraging and helping weaker students. Offering readability,practicality and flexibility, Wade presents fundamental theorems and ideas froma practical viewpoint, showing students the motivation behind the mathematicsand enabling them to construct their own proofs.
This monograph covers the theory of finite and infinite matrices over the fields of real numbers, complex numbers and over quaternions. Emphasizing topics such as sections or truncations and their relationship to the linear operator theory on certain specific separable and sequence spaces, the authors explore techniques like conformal mapping, iterations and truncations that are used to derive precise estimates in some cases and explicit lower and upper bounds for solutions in the other cases. Most of the matrices considered in this monograph have typically special structures like being diagonally dominated or tridiagonal, possess certain sign distributions and are frequently nonsingular. Such matrices arise, for instance, from solution methods for elliptic partial differential equations. The authors focus on both theoretical and computational aspects concerning infinite linear algebraic equations, differential systems and infinite linear programming, among others. Additionally, the authors cover topics such as Bessel's and Mathieu's equations, viscous fluid flow in doubly connected regions, digital circuit dynamics and eigenvalues of the Laplacian.
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of parallel iterative linear system solvers with emphasis on scalable preconditioners, (b) parallel schemes for obtaining a few of the extreme eigenpairs or those contained in a given interval in the spectrum of a standard or generalized symmetric eigenvalue problem, and (c) parallel methods for computing a few of the extreme singular triplets. Part IV focuses on the development of parallel algorithms for matrix functions and special characteristics such as the matrix pseudospectrum and the determinant. The book also reviews the theoretical and practical background necessary when designing these algorithms and includes an extensive bibliography that will be useful to researchers and students alike. The book brings together many existing algorithms for the fundamental matrix computations that have a proven track record of efficient implementation in terms of data locality and data transfer on state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.
This book discusses recent developments in semigroup theory and its applications in areas such as operator algebras, operator approximations and category theory. All contributing authors are eminent researchers in their respective fields, from across the world. Their papers, presented at the 2014 International Conference on Semigroups, Algebras and Operator Theory in Cochin, India, focus on recent developments in semigroup theory and operator algebras. They highlight current research activities on the structure theory of semigroups as well as the role of semigroup theoretic approaches to other areas such as rings and algebras. The deliberations and discussions at the conference point to future research directions in these areas. This book presents 16 unpublished, high-quality and peer-reviewed research papers on areas such as structure theory of semigroups, decidability vs. undecidability of word problems, regular von Neumann algebras, operator theory and operator approximations. Interested researchers will find several avenues for exploring the connections between semigroup theory and the theory of operator algebras. |
You may like...
Differential Equations and Linear…
C. Edwards, David Penney, …
Paperback
R2,385
Discovery Miles 23 850
Linear Algebra and Its Applications…
David Lay, Steven Lay, …
Paperback
Linear Algebra with Applications, Global…
Steven Leon, Lisette de Pillis
Paperback
R2,178
Discovery Miles 21 780
A Commentary On Newton's Principia…
John Martin Frederick Wright
Hardcover
R1,025
Discovery Miles 10 250
|