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.

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.

One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations.

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

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.

Moments as projections of an image’s intensity onto a proper polynomial basis can be applied to many different aspects of image processing. These include invariant pattern recognition, image normalization, image registration, focus/ defocus measurement, and watermarking. This book presents a survey of both recent and traditional image analysis and pattern recognition methods, based on image moments, and offers new concepts of invariants to linear filtering and implicit invariants. In addition to the theory, attention is paid to efficient algorithms for moment computation in a discrete domain, and to computational aspects of orthogonal moments. The authors also illustrate the theory through practical examples, demonstrating moment invariants in real applications across computer vision, remote sensing and medical imaging. Key features: Presents a systematic review of the basic definitions and properties of moments covering geometric moments and complex moments. Considers invariants to traditional transforms – translation, rotation, scaling, and affine transform - from a new point of view, which offers new possibilities of designing optimal sets of invariants. Reviews and extends a recent field of invariants with respect to convolution/blurring. Introduces implicit moment invariants as a tool for recognizing elastically deformed objects. Compares various classes of orthogonal moments (Legendre, Zernike, Fourier-Mellin, Chebyshev, among others) and demonstrates their application to image reconstruction from moments. Offers comprehensive advice on the construction of various invariants illustrated with practical examples. Includes an accompanying website providing efficient numerical algorithms for moment computation and for constructing invariants of various kinds, with about 250 slides suitable for a graduate university course. Moments and Moment Invariants in Pattern Recognition is ideal for researchers and engineers involved in pattern recognition in medical imaging, remote sensing, robotics and computer vision. Post graduate students in image processing and pattern recognition will also find the book of interest.

This book brings the reader to the frontiers of research in some topics in superalgebras and symbolic method in invariant theory. Superalgebras are algebras containing positively-signed and negatively-signed variables. One of the book's major results is an extension of the standard basis theorem to superalgebras. This extension requires a rethinking of some basic concepts of linear algebra, such as matrices and coordinate systems, and may lead to an extension of the entire apparatus of linear algebra to ``signed'' modules. The authors also present the symbolic method for the invariant theory of symmetric and of skew-symmetric tensors. In both cases, the invariants are obtained from the symbolic representation by applying what the authors call the umbral operator. This operator can be used to systematically develop anticommutative analogs of concepts of algebraic geometry, and such results may ultimately turn out to be the main byproduct of this investigation. While it will be of special interest to mathematicians and physicists doing research in superalgebras, invariant theory, straightening algorithms, Young bitableaux, and Grassmann's calculus of extension, the book starts from basic principles and should therefore be accessible to those who have completed the standard graduate level courses in algebra and/or combinatorics.

The questions that have been at the center of invariant theory since the 19th century have revolved around the following themes: finiteness, computation, and special classes of invariants. This book begins with a survey of many concrete examples chosen from these themes in the algebraic, homological, and combinatorial context. In further chapters, the authors pick one or the other of these questions as a departure point and present the known answers, open problems, and methods and tools needed to obtain these answers. Chapter 2 deals with algebraic finiteness. Chapter 3 deals with combinatorial finiteness. Chapter 4 presents Noetherian finiteness. Chapter 5 addresses homological finiteness. Chapter 6 presents special classes of invariants, which deal with modular invariant theory and its particular problems and features. Chapter 7 collects results for special classes of invariants and coinvariants such as (pseudo) reflection groups and representations of low degree. If the ground field is finite, additional problems appear and are compensated for in part by the emergence of new tools. One of these is the Steenrod algebra, which the authors introduce in Chapter 8 to solve the inverse invariant theory problem, around which the authors have organized the last three chapters. The book contains numerous examples to illustrate the theory, often of more than passing interest, and an appendix on commutative graded algebra, which provides some of the required basic background. There is an extensive reference list to provide the reader with orientation to the vast literature.

An introduction to a rapidly developing topic: the theory of quantum computing. Following the basics of classical theory of computation, the book provides an exposition of quantum computation theory. In concluding sections, related topics, including parallel quantum computation, are discussed.

From the winner of the Turing Award and the Abel Prize, 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