This book is dedicated to the memory of Israel Gohberg (1928-2009) - one of the great mathematicians of our time - who inspired innumerable fellow mathematicians and directed many students. The volume reflects the wide spectrum of Gohberg's mathematical interests. It consists of more than 25 invited and peer-reviewed original research papers written by his former students, co-authors and friends. Included are contributions to single and multivariable operator theory, commutative and non-commutative Banach algebra theory, the theory of matrix polynomials and analytic vector-valued functions, several variable complex function theory, and the theory of structured matrices and operators. Also treated are canonical differential systems, interpolation, completion and extension problems, numerical linear algebra and mathematical systems theory.

The central problem considered in this introduction for graduate students is the determination of rational parametrizability of an algebraic curve and, in the positive case, the computation of a good rational parametrization. This amounts to determining the genus of a curve: its complete singularity structure, computing regular points of the curve in small coordinate fields, and constructing linear systems of curves with prescribed intersection multiplicities. The book discusses various optimality criteria for rational parametrizations of algebraic curves.

For courses in Advanced Linear Algebra. This top-selling, theorem-proof text presents a careful treatment of the principle topics of linear algebra, and illustrates the power of the subject through a variety of applications. It emphasizes the symbiotic relationship between linear transformations and matrices, but states theorems in the more general infinite-dimensional case where appropriate.

This unique monograph building bridges among a number of different areas of mathematics such as algebra, topology, and category theory. The author uses various tools to develop new applications of classical concepts. Detailed proofs are given for all major theorems, about half of which are completely new. Sheaves of Algebras over Boolean Spaces will take readers on a journey through sheaf theory, an important part of universal algebra. This excellent reference text is suitable for graduate students, researchers, and those who wish to learn about sheaves of algebras.

Pell's equation is an important topic of algebraic number theory that involves quadratic forms and the structure of rings of integers in algebraic number fields. The history of this equation is long and circuitous, and involved a number of different approaches before a definitive theory was found. There were partial patterns and quite effective methods of finding solutions, but a complete theory did not emerge until the end of the eighteenth century. The topic is motivated and developed through sections of exercises which allow the student to recreate known theory and provide a focus for their algebraic practice. There are also several explorations that encourage the reader to embark on their own research. Some of these are numerical and often require the use of a calculator or computer. Others introduce relevant theory that can be followed up on elsewhere, or suggest problems that the reader may wish to pursue. A high school background in mathematics is all that is needed to get into this book, and teachers and others interested in mathematics who do not have a background in advanced mathematics may find that it is a suitable vehicle for keeping up an independent interest in the subject. Edward Barbeau is Professor of Mathematics at the University of Toronto. He has published a number of books directed to students of mathematics and their teachers, including Polynomials (Springer 1989), Power Play (MAA 1997), Fallacies, Flaws and Flimflam (MAA 1999) and After Math (Wall & Emerson, Toronto 1995).

Algebraic statistics is a rapidly developing field, where ideas from statistics and algebra meet and stimulate new research directions. One of the origins of algebraic statistics is the work by Diaconis and Sturmfels in 1998 on the use of Grobner bases for constructing a connected Markov chain for performing conditional tests of a discrete exponential family.In this book we take up this topic and present a detailed summary of developments following the seminal work of Diaconis and Sturmfels.

This book is intended for statisticians with minimal backgrounds in algebra.As we ourselves learned algebraic notions through working on statistical problems and collaborating with notable algebraists, we hope that this book with many practical statistical problems is useful for statisticians to start working on the field."

Automatic sequences are sequences which are produced by a finite automaton. Although they are not random they may look as being random. They are complicated, in the sense of not being not ultimately periodic, they may look rather complicated, in the sense that it may not be easy to name the rule by which the sequence is generated, however there exists a rule which generates the sequence. The concept automatic sequences has special applications in algebra, number theory, finite automata and formal languages, combinatorics on words. The text deals with different aspects of automatic sequences, in particular:A· a general introduction to automatic sequencesA· the basic (combinatorial) properties of automatic sequencesA· the algebraic approach to automatic sequencesA· geometric objects related to automatic sequences.

This volume contains the accounts of the principal survey papers presented at GRAPHS and ORDER, held at Banff, Canada from May 18 to May 31, 1984. This conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the University of Calgary. We are grateful for all of this considerable support. Almost fifty years ago the first Symposium on Lattice Theory was held in Charlottesville, U.S.A. On that occasion the principal lectures were delivered by G. Birkhoff, O. Ore and M.H. Stone. In those days the theory of ordered sets was thought to be a vigorous relative of group theory. Some twenty-five years ago the Symposium on Partially Ordered Sets and Lattice Theory was held in Monterey, U.S.A. Among the principal speakers at that meeting were R.P. Dilworth, B. Jonsson, A. Tarski and G. Birkhoff. Lattice theory had turned inward: it was concerned primarily with problems about lattices themselves. As a matter of fact the problems that were then posed have, by now, in many instances, been completely solved.

In these volumes, the most significant of the collected papers of the Chinese-American theoretical physicist Tsung-Dao Lee are printed. A complete list of his published papers, in order of publication, appears in the Bibliography of T.D. Lee. The papers have been arranged into ten categories, in most cases according to the subject matter. At the beginning of each of the first eight categories of papers, there is a commentary on the content and significance of all of the papers in the category. The two short final categories do not have any commentaries. The editor would like to thank Dr. Richard Friedberg for his assistance in the early stages of the editorial work on this project, as well as for writing commentaries on the papers of Categories III and IV. I would also like to thank Dr. Norman Christ for writing the commentary on the papers of Category VII. The assistance of Irene Tramm was in valuable in many aspects of preparing this collection, including locating copies of Lee's p pers. GERALD FEINBERG List of Categories of T.D. Lee's Papers Volume 1 I. Weak Interactions II. Early Papers on Astrophysics and Hydrodynamics III. Statistical Mechanics IV. Polarons and Solitons Volume 2 V. Quantum Field Theory VI. Symmetry Principles Volume 3 VII. Discrete Physics VIII. Strong Interaction Models IX. Historical Papers X. Gravity (Continuum Theory) Contents (Volume 3)* Introduction (by G. Feinberg) ............................................................ ix Bibliography of T.D. Lee ................................................................. xiii VII. Discrete Physics Commentary ................................................................ ."

"About binomial theorems I'm teeming with a lot of news, With many cheerful facts about the square on the hypotenuse. " - William S. Gilbert (The Pirates of Penzance, Act I) The question of divisibility is arguably the oldest problem in mathematics. Ancient peoples observed the cycles of nature: the day, the lunar month, and the year, and assumed that each divided evenly into the next. Civilizations as separate as the Egyptians of ten thousand years ago and the Central American Mayans adopted a month of thirty days and a year of twelve months. Even when the inaccuracy of a 360-day year became apparent, they preferred to retain it and add five intercalary days. The number 360 retains its psychological appeal today because it is divisible by many small integers. The technical term for such a number reflects this appeal. It is called a "smooth" number. At the other extreme are those integers with no smaller divisors other than 1, integers which might be called the indivisibles. The mystic qualities of numbers such as 7 and 13 derive in no small part from the fact that they are indivisibles. The ancient Greeks realized that every integer could be written uniquely as a product of indivisibles larger than 1, what we appropriately call prime numbers. To know the decomposition of an integer into a product of primes is to have a complete description of all of its divisors.

A mathematically precise definition of the intuitive notion of "algorithm" was implicit in Kurt Godel's [1931] paper on formally undecidable propo sitions of arithmetic. During the 1930s, in the work of such mathemati cians as Alonzo Church, Stephen Kleene, Barkley Rosser and Alfred Tarski, Godel's idea evolved into the concept of a recursive function. Church pro posed the thesis, generally accepted today, that an effective algorithm is the same thing as a procedure whose output is a recursive function of the input (suitably coded as an integer). With these concepts, it became possible to prove that many familiar theories are undecidable (or non-recursive)-i. e. , that there does not exist an effective algorithm (recursive function) which would allow one to determine which sentences belong to the theory. It was clear from the beginning that any theory with a rich enough mathematical content must be undecidable. On the other hand, some theories with a substantial content are decidable. Examples of such decidabLe theories are the theory of Boolean algebras (Tarski [1949]), the theory of Abelian groups (Szmiele~ [1955]), and the theories of elementary arithmetic and geometry (Tarski [1951]' but Tarski discovered these results around 1930). The de termination of precise lines of division between the classes of decidable and undecidable theories became an important goal of research in this area. algebra we mean simply any structure (A, h(i E I)} consisting of By an a nonvoid set A and a system of finitary operations Ii over A.

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.

Proceedings of the NATO Advanced Study Institute, Antwerp, Belgium, August 2-12, 1983

Around 1978, a mutation of associative algebras was introduced to generalize the formalism of classical mechanics as well as quantum mechanics. This volume presents the first book devoted to a self-contained and detailed treatment of the mathematical theory of mutation algebras, which is based on research in this subject over the past fifteen years. The book also deals with a broader class of algebras, mutations of alternative algebras, which are a natural generalization of mutations of associative algebras. A complete structure theory, including automorphisms, derivations and certain representations, is given for mutations of artinian alternative algebras, and, in particular, of Cayley--Dickson algebras. Since the mutation algebras do not form a variety, the structure theory explored in this volume takes quite a different approach from the standard theory of nonassociative algebras and provides an important interplay with the theory of noncommutative (associative) algebras through mutation parameters. New simple algebras and open problems presented in this book will stimulate additional research and applications in the area. This book will be valuable to graduate students, mathematicians and physicists interested in applications of algebras.

This volume collects presentations from the international workshop on local cohomology held in Guanajuato, Mexico, including expanded lecture notes of two minicourses on applications in equivariant topology and foundations of duality theory, and chapters on finiteness properties, D-modules, monomial ideals, combinatorial analysis, and related topics. Featuring selected papers from renowned experts around the world, Local Cohomology and Its Applications is a provocative reference for algebraists, topologists, and upper-level undergraduate and graduate students in these disciplines.

This book provides an exposition of the algebraic aspects of the theory of lattice-ordered rings and lattice-ordered modules. All of the background material on rings, modules, and lattice-ordered groups necessary to make the work self-contained and accessible to a variety of readers is included. Filling a gap in the literature, Lattice-Ordered Rings and Modules may be used as a textbook or for self-study by graduate students and researchers studying lattice-ordered rings and lattice-ordered modules.

Steinberg presents the material through 800+ extensive examples of varying levels of difficulty along with numerous exercises at the end of each section. Key topics include: lattice-ordered groups, rings, and fields; archimedean $l$-groups; f-rings and larger varieties of $l$-rings; the category of f-modules; various commutativity results.

Semisimple Lie groups, and their algebraic analogues over fields other than the reals, are of fundamental importance in geometry, analysis, and mathematical physics. Three independent, self-contained volumes, under the general title Lie Theory, feature survey work and original results by well-established researchers in key areas of semisimple Lie theory.

Unitary Representations and Compactifications of Symmetric Spaces, a self-contained work by A. Borel, L. Ji, and T. Kobayashi, focuses on two fundamental questions in the theory of semisimple Lie groups: the geometry of Riemannian symmetric spaces and their compactifications; and branching laws for unitary representations, i.e., restricting unitary representations to (typically, but not exclusively, symmetric) subgroups and decomposing the ensuing representations into irreducibles.

Ji's introductory chapter motivates the subject of symmetric spaces and their compactifications with carefully selected examples. A discussion of Satake and Furstenberg boundaries and a survey of the geometry of Riemannian symmetric spaces in general provide a good background for the second chapter, namely, the Borela "Ji authoritative treatment of various types of compactifications useful for studying symmetric and locally symmetric spaces. Borela "Ji further examine constructions of Oshima, De Concini, Procesi, and Melrose, which demonstrate the wide applicability of compactification techniques.

Kobayashi examines the important subject of branching laws. Important concepts from modern representation theory, such as Harisha "Chandra modules, associated varieties, microlocal analysis, derived functor modules, and geometric quantization areintroduced. Concrete examples and relevant exercises engage the reader.

Knowledge of basic representation theory of Lie groups as well as familiarity with semisimple Lie groups and symmetric spaces is required of the reader.

Complexity increases with increasing system size in everything from organisms to organizations. The nonlinear dependence of a system's functionality on its size, by means of an allometry relation, is argued to be a consequence of their joint dependency on complexity (information). In turn, complexity is proven to be the source of allometry and to provide a new kind of force entailed by a system's information gradient. Based on first principles, the scaling behavior of the probability density function is determined by the exact solution to a set of fractional differential equations. The resulting lowest order moments in system size and functionality gives rise to the empirical allometry relations. Taking examples from various topics in nature, the book is of interest to researchers in applied mathematics, as well as, investigators in the natural, social, physical and life sciences. Contents Complexity Empirical allometry Statistics, scaling and simulation Allometry theories Strange kinetics Fractional probability calculus

The companion title, Linear Algebra, has sold over 8,000 copies

The writing style is very accessible

The material can be covered easily in a one-year or one-term course

Includes Noah Snyder's proof of the Mason-Stothers polynomial abc theorem

New material included on product structure for matrices including descriptions of the conjugation representation of the diagonal group

Nestled between number theory, combinatorics, algebra and analysis lies a rapidly developing subject in mathematics variously known as additive combinatorics, additive number theory, additive group theory, and combinatorial number theory. Its main objects of study are not abelian groups themselves, but rather the additive structure of subsets and subsequences of an abelian group, i.e., sumsets and subsequence sums. This text is a hybrid of a research monograph and an introductory graduate textbook. With few exceptions, all results presented are self-contained, written in great detail, and only reliant upon material covered in an advanced undergraduate curriculum supplemented with some additional Algebra, rendering this bookusable as an entry-level text. However, it will perhaps be of even more interest to researchers already in the field.

The majority of material is not found in book form and includes many new results as well. Even classical results, when included, are given in greater generality or using new proof variations. The text has a particular focus on results of a more exact and precise nature, results with strong hypotheses and yet stronger conclusions, and on fundamental aspects of the theory. Also included are intricate results often neglected in other texts owing to their complexity. Highlights include an extensive treatment of Freiman Homomorphisms and the Universal Ambient Group of sumsets A+B, an entire chapter devoted to Hamidoune s Isoperimetric Method, a novel generalization allowing infinite summands in finite sumset questions, weighted zero-sum problems treated in the general context of viewing homomorphisms as weights, and simplified proofs of the Kemperman Structure Theorem and the Partition Theorem for setpartitions."

This study covers comodules, rational modules and bicomodules; cosemisimple, semiperfect and co-Frobenius algebras; bialgebras and Hopf algebras; actions and coactions of Hopf algebras on algebras; finite dimensional Hopf algebras, with the Nicholas-Zoeller and Taft-Wilson theorems and character theory; and more.

This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colorings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.
Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level and has been used for courses at Simon Fraser University (Vancouver), Charles University (Prague), ETH (Zurich), and UFRJ (Rio de Janeiro).
The exercises vary in difficulty. The first few are usually intended to give the reader an opportunity to practice the concepts introduced in the chapter; the later ones explore related concepts, or even introduce new ones. For the harder exercises hints and references are provided.
The authors are well known for their research in this area and the book will be invaluable to graduate students and researchers alike.

Deals with the most basic notion of linear algebra, to bring emphasis on approaches to the topic serving at the elementary level and more broadly. A typical feature is where computational algorithms and theoretical proofs are brought together. Another is respect for symmetry, so that when this has some part in the form of a matter it should also be reflected in the treatment. Issues relating to computational method are covered. These interests may have suggested a limited account, to be rounded-out suitably. However this limitation where basic material is separated from further reaches of the subject has an appeal of its own. To the `elementary operations' method of the textbooks for doing linear algebra, Albert Tucker added a method with his `pivot operation'. Here there is a more primitive method based on the `linear dependence table', and yet another based on `rank reduction'. The determinant is introduced in a completely unusual upside-down fashion where Cramer's rule comes first. Also dealt with is what is believed to be a completely new idea, of the `alternant', a function associated with the affine space the way the determinant is with the linear space, with n+1 vector arguments, as the determinant has n. Then for affine (or barycentric) coordinates we find a rule which is an unprecedented exact counterpart of Cramer's rule for linear coordinates, where the alternant takes on the role of the determinant. These are among the more distinct or spectacular items for possible novelty, or unfamiliarity. Others, with or without some remark, may be found scattered in different places.