Computational Invariant Theory

This book, the first volume of a subseries on "Invariant Theory and Algebraic Transformation Groups", provides a comprehensive and up-to-date overview of the algorithmic aspects of invariant theory. Numerous illustrative examples and a careful selection of proofs make the book accessible to non-specialists.

This book is about the computational aspects of invariant theory. Of central interest is the question how the invariant ring of a given group action can be calculated. Algorithms for this purpose form the main pillars around which the book is built. There are two introductory chapters, one on Gröbner basis methods and one on the basic concepts of invariant theory, which prepare the ground for the algorithms. Then algorithms for computing invariants of finite and reductive groups are discussed. Particular emphasis lies on interrelations between structural properties of invariant rings and computational methods. Finally, the book contains a chapter on applications of invariant theory, covering fields as disparate as graph theory, coding theory, dynamical systems, and computer vision. The book is intended for postgraduate students as well as researchers in geometry, computer algebra, and, of course, invariant theory. The text is enriched with numerous explicit examples which illustrate the theory and should be of more than passing interest. More than ten years after the first publication of the book, the second edition now provides a major update and covers many recent developments in the field. Among the roughly 100 added pages there are two appendices, authored by Vladimi r Popov, and an addendum by Norbert A'Campo and Vladimir Popov.

The primary goal of this 2003 book is to give a brief introduction to the main ideas of algebraic and geometric invariant theory. It assumes only a minimal background in algebraic geometry, algebra and representation theory. Topics covered include the symbolic method for computation of invariants on the space of homogeneous forms, the problem of finite-generatedness of the algebra of invariants, the theory of covariants and constructions of categorical and geometric quotients. Throughout, the emphasis is on concrete examples which originate in classical algebraic geometry. Based on lectures given at University of Michigan, Harvard University and Seoul National University, the book is written in an accessible style and contains many examples and exercises. A novel feature of the book is a discussion of possible linearizations of actions and the variation of quotients under the change of linearization. Also includes the construction of toric varieties as torus quotients of affine spaces.

This book is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to research ideas, hints for applications, outlines and details of algorithms, examples and problems.

The book is a self-contained introduction to the results and methods in classical invariant theory.

This volume includes the proceedings of a workshop on Invariant Theory held at Queen's University (Ontario). The workshop was part of the theme year held under the auspices of the Centre de recherches mathematiques (CRM) in Montreal. The gathering brought together two communities of researchers: those working in characteristic 0 and those working in positive characteristic. The book contains three types of papers: survey articles providing introductions to computational invarianttheory, modular invariant theory of finite groups, and the invariant theory of Lie groups; expository works recounting recent research in these three areas and beyond; and open problems of current interest. The book is suitable for graduate students and researchers working in invarianttheory.

This book explains recent results in the theory of moving frames that concern the symbolic manipulation of invariants of Lie group actions. In particular, theorems concerning the calculation of generators of algebras of differential invariants, and the relations they satisfy, are discussed in detail. The author demonstrates how new ideas lead to significant progress in two main applications: the solution of invariant ordinary differential equations and the structure of Euler-Lagrange equations and conservation laws of variational problems. The expository language used here is primarily that of undergraduate calculus rather than differential geometry, making the topic more accessible to a student audience. More sophisticated ideas from differential topology and Lie theory are explained from scratch using illustrative examples and exercises. This book is ideal for graduate students and researchers working in differential equations, symbolic computation, applications of Lie groups and, to a lesser extent, differential geometry.

An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography