This is a collection of papers dedicated to Leonid Kantorovich and his work. Kantorovich was a Russian mathematician and economist who published in the three areas covered in this book: functional analysis, optimization, and mathematical economics. Kantorovich is credited as being amongst the first inventors of linear programming, the primary technique of optimization. Linear programming consists of creating a matrix of parameters relevant to a system and maximizing the unknown variables using those constraints. Kantorovich then applied this theory to optimal macroeconomic planning in a socialist economy, for which he received the Nobel prize. The present book is dedicated to the memory of Kantorovich, who died in 1986, but is more than a Festschrift. It contains original contributions from several researchers in the USSR never before seen in the US, which enhances the value of the volume. It is organized in a logical sequence from the mathematics to the applications of the theories to concrete problems.

This contributed volume brings together the highest quality expository papers written by leaders and talented junior mathematicians in the field of Commutative Algebra. Contributions cover a very wide range of topics, including core areas in Commutative Algebra and also relations to Algebraic Geometry, Algebraic Combinatorics, Hyperplane Arrangements, Homological Algebra, and String Theory. The book aims to showcase the area, especially for the benefit of junior mathematicians and researchers who are new to the field; it will aid them in broadening their background and to gain a deeper understanding of the current research in this area. Exciting developments are surveyed and many open problems are discussed with the aspiration to inspire the readers and foster further research.

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.

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.

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.

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.

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.

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)

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

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

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.

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.

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.

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.

The monograph is devoted to the investigation of physical processes that govern the phonon transport in bulk and nanoscale single-crystal samples of cubic symmetry. Special emphasis is given to the study of phonon focusing in cubic crystals and its influence on the boundary scattering and lattice thermal conductivity of bulk materials and nanostructures.

Leibniz Algebras: Structure and Classification is designed to introduce the reader to the theory of Leibniz algebras. Leibniz algebra is the generalization of Lie algebras. These algebras preserve a unique property of Lie algebras that the right multiplication operators are derivations. They first appeared in papers of A.M Blokh in the 1960s, under the name D-algebras, emphasizing their close relationship with derivations. The theory of D-algebras did not get as thorough an examination as it deserved immediately after its introduction. Later, the same algebras were introduced in 1993 by Jean-Louis Loday , who called them Leibniz algebras due to the identity they satisfy. The main motivation for the introduction of Leibniz algebras was to study the periodicity phenomena in algebraic K-theory. Nowadays, the theory of Leibniz algebras is one of the more actively developing areas of modern algebra. Along with (co)homological, structural and classification results on Leibniz algebras, some papers with various applications of the Leibniz algebras also appear now. However, the focus of this book is mainly on the classification problems of Leibniz algebras. Particularly, the authors propose a method of classification of a subclass of Leibniz algebras based on algebraic invariants. The method is applicable in the Lie algebras case as well. Features: Provides a systematic exposition of the theory of Leibniz algebras and recent results on Leibniz algebras Suitable for final year bachelor's students, master's students and PhD students going into research in the structural theory of finite-dimensional algebras, particularly, Lie and Leibniz algebras Covers important and more general parts of the structural theory of Leibniz algebras that are not addressed in other texts

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.

In this age of technology where messages are transmitted in sequences of 0's and 1's through space, errors can occur due to noisy channels. Thus, self-correcting code is vital to eradicate these errors when the number of errors is small. It is widely used in industry for a variety of applications including e-mail, telephone, and remote sensing (for example, photographs of Mars).An expert in algebra and algebraic geometry, Tzuong-Tsieng Moh covers many essential aspects of algebraic coding theory in this book, such as elementary algebraic coding theories, the mathematical theory of vector spaces and linear algebras behind them, various rings and associated coding theories, a fast decoding method, useful parts of algebraic geometry and geometric coding theories.This book is accessible to advanced undergraduate students, graduate students, coding theorists and algebraic geometers.

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.

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

Multivariable Calculus with Mathematica is a textbook addressing the calculus of several variables. Instead of just using Mathematica to directly solve problems, the students are encouraged to learn the syntax and to write their own code to solve problems. This not only encourages scientific computing skills but at the same time stresses the complete understanding of the mathematics. Questions are provided at the end of the chapters to test the student's theoretical understanding of the mathematics, and there are also computer algebra questions which test the student's ability to apply their knowledge in non-trivial ways. Features Ensures that students are not just using the package to directly solve problems, but learning the syntax to write their own code to solve problems Suitable as a main textbook for a Calculus III course, and as a supplementary text for topics scientific computing, engineering, and mathematical physics Written in a style that engages the students' interest and encourages the understanding of the mathematical ideas