Computational Commutative Algebra 1

This introduction to polynomial rings, Grobner bases and applications bridges the gap in the literature between theory and actual computation. It details numerous applications, covering fields as disp

This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions

"The second volume of the authors' ‘Computational commutative algebra'…covers on its 586 pages a wealth of interesting material with several unexpected applications. … an encyclopedia on computational

Approximate Commutative Algebra is an emerging field of research which endeavours to bridge the gap between traditional exact Computational Commutative Algebra and approximate numerical computation. T

Considers the application of polynomial algebra to experimental design, discrete probability, and statistics. The book begins with an introduction to Gr÷bner bases and a description of their applicat

This substantially enlarged second edition aims to lead a further stage in the computational revolution in commutative algebra. This is the first handbook/tutorial to extensively deal with SINGULAR.

* Stanley represents a broad perspective with respect to two significant topics from Combinatorial Commutative Algebra:1) The theory of invariants of a torus acting linearly on a polynomial ring, and2

This volume collects contributions by leading experts in the area of commutative algebra related to the INdAM meeting “Homological and Computational Methods in Commutative Algebra” held in Cortona (I

Skills Practice Workbook provides ample exercises to help students develop computational skills, lesson by lesson.

The Practice Workbook mimics the computational and verbal problems in each lesson at an average level providing more challenging problems for students who are moving at a regular or faster pace.

The interplay between algebra and geometry is a beautiful (and fun!) area of mathematical investigation. Advances in computing and algorithms make it possible to tackle many classical problems in a down-to-earth and concrete fashion. This opens wonderful new vistas and allows us to pose, study and solve problems that were previously out of reach. Suitable for graduate students, the objective of this 2003 book is to bring advanced algebra to life with lots of examples. The first chapters provide an introduction to commutative algebra and connections to geometry. The rest of the book focuses on three active areas of contemporary algebra: Homological Algebra (the snake lemma, long exact sequence inhomology, functors and derived functors (Tor and Ext), and double complexes); Algebraic Combinatorics and Algebraic Topology (simplicial complexes and simplicial homology, Stanley-Reisner rings, upper bound theorem and polytopes); and Algebraic Geometry (points and curves in projective space, Ri

The interplay between algebra and geometry is a beautiful (and fun!) area of mathematical investigation. Advances in computing and algorithms make it possible to tackle many classical problems in a down-to-earth and concrete fashion. This opens wonderful new vistas and allows us to pose, study and solve problems that were previously out of reach. Suitable for graduate students, the objective of this 2003 book is to bring advanced algebra to life with lots of examples. The first chapters provide an introduction to commutative algebra and connections to geometry. The rest of the book focuses on three active areas of contemporary algebra: Homological Algebra (the snake lemma, long exact sequence inhomology, functors and derived functors (Tor and Ext), and double complexes); Algebraic Combinatorics and Algebraic Topology (simplicial complexes and simplicial homology, Stanley-Reisner rings, upper bound theorem and polytopes); and Algebraic Geometry (points and curves in projective space, Ri

Written to honor the 80th birthday of William Fulton, the articles collected in this volume (the first of a pair) present substantial contributions to algebraic geometry and related fields, with an emphasis on combinatorial algebraic geometry and intersection theory. Featured topics include commutative algebra, moduli spaces, quantum cohomology, representation theory, Schubert calculus, and toric and tropical geometry. The range of these contributions is a testament to the breadth and depth of Fulton's mathematical influence. The authors are all internationally recognized experts, and include well-established researchers as well as rising stars of a new generation of mathematicians. The text aims to stimulate progress and provide inspiration to graduate students and researchers in the field.

Group cohomology reveals a deep relationship between algebra and topology, and its recent applications have provided important insights into the Hodge conjecture and algebraic geometry more broadly. This book presents a coherent suite of computational tools for the study of group cohomology and algebraic cycles. Early chapters synthesize background material from topology, algebraic geometry, and commutative algebra so readers do not have to form connections between the literatures on their own. Later chapters demonstrate Peter Symonds's influential proof of David Benson's regularity conjecture, offering several new variants and improvements. Complete with concrete examples and computations throughout, and a list of open problems for further study, this book will be valuable to graduate students and researchers in algebraic geometry and related fields.

This book demonstrates current trends in research on combinatorial and computational commutative algebra with a primary emphasis on topics related to monomial ideals.Providing a useful and quick intro

"Hilbert functions play major parts in Algebraic Geometry and Commutative Algebra, and are also becoming increasingly important in Computational Algebra. They capture many useful numerical characters

Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theore

The past few years have witnessed significant developments in algebraic coding theory. This book provides an advanced treatment of the subject from an engineering perspective, covering the basic principles and their application in communications and signal processing. Emphasis is on codes defined on the line, on the plane, and on curves, with the core ideas presented using commutative algebra and computational algebraic geometry made accessible using the Fourier transform. Starting with codes defined on a line, a background framework is established upon which the later chapters concerning codes on planes, and on curves, are developed. The decoding algorithms are developed using the standard engineering approach applied to those of Reed-Solomon codes, enabling them to be evaluated against practical applications. Integrating recent developments in the field into the classical treatment of algebraic coding, this is an invaluable resource for graduate students and researchers in telecommun

Hilbert functions and resolutions are both central objects in commutative algebra and fruitful tools in the fields of algebraic geometry, combinatorics, commutative algebra, and computational algebra.

Integral closure has played a role in number theory and algebraic geometry since the nineteenth century, but a modern formulation of the concept for ideals perhaps began with the work of Krull and Zariski in the 1930s. It has developed into a tool for the analysis of many algebraic and geometric problems. This book collects together the central notions of integral closure and presents a unified treatment. Techniques and topics covered include: behavior of the Noetherian property under integral closure, analytically unramified rings, the conductor, field separability, valuations, Rees algebras, Rees valuations, reductions, multiplicity, mixed multiplicity, joint reductions, the Briançon-Skoda theorem, Zariski's theory of integrally closed ideals in two-dimensional regular local rings, computational aspects, adjoints of ideals and normal homomorphisms. With many worked examples and exercises, this book will provide graduate students and researchers in commutative algebra or ring theory w

The second volume of this comprehensive treatise focusses on Buchberger theory and its application to the algorithmic view of commutative algebra. In distinction to other works, the presentation here is based on the intrinsic linear algebra structure of Groebner bases, and thus elementary considerations lead easily to the state-of-the-art in issues of implementation. The same language describes the applications of Groebner technology to the central problems of commutative algebra. The book can be also used as a reference on elementary ideal theory and a source for the state-of-the-art in its algorithmization. Aiming to provide a complete survey on Groebner bases and their applications, the author also includes advanced aspects of Buchberger theory, such as the complexity of the algorithm, Galligo's theorem, the optimality of degrevlex, the Gianni-Kalkbrener theorem, the FGLM algorithm, and so on. Thus it will be essential for all workers in commutative algebra, computational algebra an

This book provides an introduction to recent developments in the theory of blow up algebras - Rees algebras, associated graded rings, Hilbert functions, and birational morphisms. The emphasis is on deriving properties of rings from their specifications in terms of generators and relations. While this limits the generality of many results, it opens the way for the application of computational methods. A highlight of the book is the chapter on advanced computational methods in algebra using Gröbner basis theory and advanced commutative algebra. The author presents the Gröbner basis algorithm and shows how it can be used to resolve computational questions in algebra. This volume is intended for advanced students in commutative algebra, algebraic geometry and computational algebra, and homological algebra. It can be used as a reference for the theory of Rees algebras and related topics.

Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theore

The origins of the mathematics in this book date back more than two thou- sand years, as can be seen from the fact that one of the most important algorithms presented here bears the name of the Greek

This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A compreh