The major purpose of this book is to present the theoretical ideas and the analytical and numerical methods to enable the reader to understand and efficiently solve these important optimizational problems.The first half of this book should serve as the major component of a classical one or two semester course in the calculus of variations and optimal control theory. The second half of the book will describe the current research of the authors which is directed to solving these problems numerically. In particular, we present new reformulations of constrained problems which leads to unconstrained problems in the calculus of variations and new general, accurate and efficient numerical methods to solve the reformulated problems. We believe that these new methods will allow the reader to solve important problems.

The history of mathematics is, to a considerable extent, connected with the study of solutions of the equation f(x)=a=const for functions f(x) of one real or complex variable. Therefore, it is surprising that we know very little about solutions of u(x,y)=A=const. for functions of two real variables. These two solutions, called level of sets, are very important with regard to applications in physics, biology and economics as they make a map of appropriate processes described by the function u(x,y) for given parameters (x,y). In the present volume we study a concept, Gamma-lines which generalizes the concept of levels of sets and, at the same time, the concept of a-points. The aim of the authors is to provide a book on Gamma-lines for the broad specialist and to show the large range of their field of applications. One can expect that the general methods proposed in this volume will be of great use to both physicists and engineers.

Decomposing an abelian group into a direct sum of its subsets leads to results that can be applied to a variety of areas, such as number theory, geometry of tilings, coding theory, cryptography, graph theory, and Fourier analysis. Focusing mainly on cyclic groups, Factoring Groups into Subsets explores the factorization theory of abelian groups. The book first shows how to construct new factorizations from old ones. The authors then discuss nonperiodic and periodic factorizations, quasiperiodicity, and the factoring of periodic subsets. They also examine how tiling plays an important role in number theory. The next several chapters cover factorizations of infinite abelian groups; combinatorics, such as Ramsey numbers, Latin squares, and complex Hadamard matrices; and connections with codes, including variable length codes, error correcting codes, and integer codes. The final chapter deals with several classical problems of Fuchs. Encompassing many of the main areas of the factorization theory, this book explores problems in which the underlying factored group is cyclic.

"This remarkable reference covers topics such as quantum groups, Hopf Galois theory, actions and coactions of Hopf algebras, smash and crossed products, and the structure of cosemisimple Hopf algebras. "

Over the past 20 years, the emergence of clone theory, hyperequational theory, commutator theory and tame congruence theory has led to a growth of universal algebra both in richness and in applications, especially in computer science. Yet most of the classic books on the subject are long out of print and, to date, no other book has integrated these theories with the long-established work that supports them.

Universal Algebra and Applications in Theoretical Computer Science introduces the basic concepts of universal algebra and surveys some of the newer developments in the field. The first half of the book provides a solid grounding in the core material. A leisurely pace, careful exposition, numerous examples, and exercises combine to form an introduction to the subject ideal for beginning graduate students or researchers from other areas. The second half of the book focuses on applications in theoretical computer science and advanced topics, including Mal'cev conditions, tame congruence theory, clones, and commutators.

The impact of the advances in universal algebra on computer science is just beginning to be realized, and the field will undoubtedly continue to grow and mature. Universal Algebra and Applications in Theoretical Computer Science forms an outstanding text and offers a unique opportunity to build the foundation needed for further developments in its theory and in its computer science applications.

With contributions derived from presentations at an international conference, Non-Associative Algebra and Its Applications explores a wide range of topics focusing on Lie algebras, nonassociative rings and algebras, quasigroups, loops, and related systems as well as applications of nonassociative algebra to geometry, physics, and natural sciences. This book covers material such as Jordan superalgebras, nonassociative deformations, nonassociative generalization of Hopf algebras, the structure of free algebras, derivations of Lie algebras, and the identities of Albert algebra. It also includes applications of smooth quasigroups and loops to differential geometry and relativity.

Concise Introduction to Linear Algebra deals with the subject of linear algebra, covering vectors and linear systems, vector spaces, orthogonality, determinants, eigenvalues and eigenvectors, singular value decomposition. It adopts an efficient approach to lead students from vectors, matrices quickly into more advanced topics including, LU decomposition, orthogonal decomposition, Least squares solutions, Gram-Schmidt process, eigenvalues and eigenvectors, diagonalizability, spectral decomposition, positive definite matrix, quadratic forms, singular value decompositions and principal component analysis. This book is designed for onesemester teaching to undergraduate students.

Today Lie group theoretical approach to differential equations has been extended to new situations and has become applicable to the majority of equations that frequently occur in applied sciences. Newly developed theoretical and computational methods are awaiting application. Students and applied scientists are expected to understand these methods. Volume 3 and the accompanying software allow readers to extend their knowledge of computational algebra. Written by the world's leading experts in the field, this up-to-date sourcebook covers topics such as Lie-B lund, conditional and non-classical symmetries, approximate symmetry groups for equations with a small parameter, group analysis of differential equations with distributions, integro-differential equations, recursions, and symbolic software packages. The text provides an ideal introduction to the modern group analysis and addresses issues to both beginners and experienced researchers in the application of Lie group methods.

Clear prose, tight organization, and a wealth of examples and computational techniques make Basic Matrix Algebra with Algorithms and Applications an outstanding introduction to linear algebra. The author designed this treatment specifically for freshman majors in mathematical subjects and upper-level students in natural resources, the social sciences, business, or any discipline that eventually requires an understanding of linear models. With extreme pedagogical clarity that avoids abstraction wherever possible, the author emphasizes minimal polynomials and their computation using a Krylov algorithm. The presentation is highly visual and relies heavily on work with a graphing calculator to allow readers to focus on concepts and techniques rather than on tedious arithmetic. Supporting materials, including test preparation Maple worksheets, are available for download from the Internet. This unassuming but insightful and remarkably original treatment is organized into bite-sized, clearly stated objectives. It goes well beyond the LACSG recommendations for a first course while still implementing their philosophy and core material. Classroom tested with great success, it prepares readers well for the more advanced studies their fields ultimately will require.

With a unique approach and presenting an array of new and intriguing topics, Mathematical Quantization offers a survey of operator algebras and related structures from the point of view that these objects are quantizations of classical mathematical structures. This approach makes possible, with minimal mathematical detail, a unified treatment of a variety of topics.

Detailed here for the first time, the fundamental idea of mathematical quantization is that sets are replaced by Hilbert spaces. Building on this idea, and most importantly on the fact that scalar-valued functions on a set correspond to operators on a Hilbert space, one can determine quantum analogs of a variety of classical structures. In particular, because topologies and measure classes on a set can be treated in terms of scalar-valued functions, we can transfer these constructions to the quantum realm, giving rise to C*- and von Neumann algebras.

In the first half of the book, the author quickly builds the operator algebra setting. He uses this as a unifying theme in the second half, in which he treats several active research topics, some for the first time in book form. These include the quantum plane and tori, operator spaces, Hilbert modules, Lipschitz algebras, and quantum groups.

For graduate students, Mathematical Quantization offers an ideal introduction to a research area of great current interest. For professionals in operator algebras and functional analysis, it provides a readable tour of the current state of the field.

Based on the fifth Mid-Atlantic Algebra Conference held recently at George Mason University, Fairfax, Virginia. Focuses on both the practical and theoretical aspects of computational algebra. Demonstrates specific computer packages, including the use of CREP to study the representation of theory for finite dimensional algebras and Axiom to study algebras of finite rank.

The study of nonunique factorizations of elements into irreducible elements in commutative rings and monoids has emerged as an independent area of research only over the last 30 years and has enjoyed a recent flurry of activity and advancement. This book presents the proceedings of two recent meetings that gathered key researchers from around the world to review recent major results. The first seven chapters demonstrate the diversity of approaches taken in studying nonunique factorizations and serve both as an introduction to factorization theory and as a survey of current trends and results. The remaining chapters reflect research motivated by arithmetical properties of commutative rings and monoids.

Packed with contributions from international experts, Commutative Algebra: Geometric, Homological, Combinatorial, and Computational Aspects features new research results that borrow methods from neighboring fields such as combinatorics, homological algebra, polyhedral geometry, symbolic computation, and topology. This book consists of articles presented during two conferences held in Spain and Portugal in June, 2003. It encompasses a variety of topics, including blowup algebras, Castelnuovo-Mumford regularity, integral closure and normality, Koszul homology, liaison theory, multiplicities, polarization, and reductions of ideals. This comprehensive volume will stimulate further research in the field.

This second edition of Compact Numerical Methods for Computers presents reliable yet compact algorithms for computational problems. As in the previous edition, the author considers specific mathematical problems of wide applicability, develops approaches to a solution and the consequent algorithm, and provides the program steps. He emphasizes useful applicable methods from various scientific research fields, ranging from mathematical physics to commodity production modeling. While the ubiquitous personal computer is the particular focus, the methods have been implemented on computers as small as a programmable pocket calculator and as large as a highly parallel supercomputer. New to the Second Edition Presents program steps as Turbo Pascal code Includes more algorithmic examples Contains an extended bibliography The accompanying software (available by coupon at no charge) includes not only the algorithm source codes, but also driver programs, example data, and several utility codes to help in the software engineering of end-user programs. The codes are designed for rapid implementation and reliable use in a wide variety of computing environments. Scientists, statisticians, engineers, and economists who prepare/modify programs for use in their work will find this resource invaluable. Moreover, since little previous training in numerical analysis is required, the book can also be used as a supplementary text for courses on numerical methods and mathematical software.

This popular textbook was thoughtfully and specifically tailored to introducing undergraduate students to linear algebra. The second edition has been carefully revised to improve upon its already successful format and approach. In particular, the author added a chapter on quadratic forms, making this one of the most comprehensive introductory texts on linear algebra.

The first and second editions of this successful textbook have been highly praised for their lucid and detailed coverage of abstract algebra. In this third edition, the author has carefully revised and extended his treatment, particularly the material on rings and fields, to provide an even more satisfying first course in abstract algebra.

Intrinsically noncommutative spaces today are considered from the perspective of several branches of modern physics, including quantum gravity, string theory, and statistical physics. From this point of view, it is ideal to devise a concept of space and its geometry that is fundamentally noncommutative. Providing a clear introduction to noncommutative topology, Virtual Topology and Functor Geometry explores new aspects of these areas as well as more established facets of noncommutative algebra. Presenting the material in an easy, colloquial style to facilitate understanding, the book begins with an introduction to category theory, followed by a chapter on noncommutative spaces. This chapter examines noncommutative lattices, noncommutative opens, sheaf theory, the generalized Stone space, and Grothendieck topology. The author then studies Grothendieck categorical representations to formulate an abstract notion of "affine open". The final chapter proposes a dynamical version of topology and sheaf theory, providing at least one solution of the problem of sheafification independent of generalizations of topos theory. By presenting new ideas for the development of an intrinsically noncommutative geometry, this book fosters the further unification of different kinds of noncommutative geometry and the expression of observations that involve natural phenomena.

This book examines some aspects of homogeneous Banach algebras and related topics to illustrate various methods used in several classes of group algebras. It guides the reader toward some of the problems in harmonic analysis such as the problems of factorizations and closed subalgebras.

This book covers topics including the Redei-Reichardt theorem, automorphs of ternary quadratic forms, facts concerning rational matrices leading to integral ternary forms representing zero, characteristics polynomials of symmetric matrices, and Gauss' theory of ternary quadratic forms.

"Integrates and summarizes the most significant developments made by Chinese mathematicians in rings, groups, and algebras since the 1950s. Presents both survey articles and recent research results. Examines important topics in Hopf algebra, representation theory, semigroups, finite groups, homology algebra, module theory, valuation theory, and more."

Written by pioneers in this exciting new field, Algebraic Statistics introduces the application of polynomial algebra to experimental design, discrete probability, and statistics.

It begins with an introduction to Gröbner bases and a thorough description of their applications to experimental design. A special chapter covers the binary case with new application to coherent systems in reliability and two level factorial designs. The work paves the way, in the last two chapters, for the application of computer algebra to discrete probability and statistical modelling through the important concept of an algebraic statistical model.

As the first book on the subject, Algebraic Statistics presents many opportunities for spin-off research and applications and should become a landmark work welcomed by both the statistical community and its relatives in mathematics and computer science.

Designed for use in a second course on linear algebra, Matrix Theory and Applications with MATLAB covers the basics of the subject-from a review of matrix algebra through vector spaces to matrix calculus and unitary similarity-in a presentation that stresses insight, understanding, and applications. Among its most outstanding features is the integration of MATLAB throughout the text. Each chapter includes a MATLAB subsection that discusses the various commands used to do the computations in that section and offers code for the graphics and some algorithms used in the text.

All of the material is presented from a matrix point of view with enough rigor for students to learn to compose arguments and proofs and adjust the material to cover other problems. The treatment includes optional subsections covering applications, and the final chapters move beyond basic matrix theory to discuss more advanced topics, such as decompositions, positive definite matrices, graphics, and topology.

Filled with illustrations, examples, and exercises that reinforce understanding, Matrix Theory and Applications with MATLAB allows readers to experiment and visualize results in a way that no other text does. Its rigor, use of MATLAB, and focus on applications better prepares them to use the material in their future work and research, to extend the material, and perhaps obtain new results of their own.

Model theory investigates mathematical structures by means of formal languages. These so-called first-order languages have proved particularly useful. The text introduces the reader to the model theory of first-order logic, avoiding syntactical issues that are not too relevant to model-theory. In this spirit, the compactness theorem is proved via the algebraically useful ultraproduct technique, rather than via the completeness theorem of first-order logic. This leads fairly quickly to algebraic applications, like Malcev's local theorems (of group theory) and, after a little more preparation, also to Hilbert's Nullstellensatz (of field theory). Steinitz' dimension theory for field extensions is obtained as a special case of a much more general model-theoretic treatment of strongly minimal sets. The final chapter is on the models of the first-order theory of the integers as an abelian group. This material appears here for the first time in a textbook of introductory level, and is used to give hints to further reading and to recent developments in the field, such as stability (or classification) theory. The latter itself is not touched upon. The undergraduate or graduate, is assumed t

A remarkable interplay exists between the fields of elliptic functions and orthogonal polynomials. In the first monograph to explore their connections, Elliptic Polynomials combines these two areas of study, leading to an interesting development of some basic aspects of each. It presents new material about various classes of polynomials and about the odd Jacobi elliptic functions and their inverses.

The term elliptic polynomials refers to the polynomials generated by odd elliptic integrals and elliptic functions. In studying these, the authors consider such things as orthogonality and the construction of weight functions and measures, finding structure constants and interesting inequalities, and deriving useful formulas and evaluations.

Although some of the material may be familiar, it establishes a new mathematical field that intersects with classical subjects at many points. Its wealth of information on important properties of polynomials and clear, accessible presentation make Elliptic Polynomials valuable to those in real and complex analysis, number theory, and combinatorics, and will undoubtedly generate further research.

Monomial Algebras, Second Edition presents algebraic, combinatorial, and computational methods for studying monomial algebras and their ideals, including Stanley-Reisner rings, monomial subrings, Ehrhart rings, and blowup algebras. It emphasizes square-free monomials and the corresponding graphs, clutters, or hypergraphs. New to the Second Edition Four new chapters that focus on the algebraic properties of blowup algebras in combinatorial optimization problems of clutters and hypergraphs Two new chapters that explore the algebraic and combinatorial properties of the edge ideal of clutters and hypergraphs Full revisions of existing chapters to provide an up-to-date account of the subject Bringing together several areas of pure and applied mathematics, this book shows how monomial algebras are related to polyhedral geometry, combinatorial optimization, and combinatorics of hypergraphs. It directly links the algebraic properties of monomial algebras to combinatorial structures (such as simplicial complexes, posets, digraphs, graphs, and clutters) and linear optimization problems.