Computational commutative algebra. I
Buchberger algorithmCoCoAcomputational commutative algebraelimination theoryGröbner basesHilbert's Nullstellensatzhomomorphismsideal membership problemmodules over polynomial ringsmonomial idealpolynomial equations in several variablessyzygyterm ordering
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to commutative algebra (13-01) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects and applications of commutative rings (13Pxx)
The book under review is the first volume of the authors' `Computational commutative algebra'. The second volume will appear soon. The title of the two books is the authors' program. They give a rather complete picture about commutative algebra around polynomial rings with respect to concrete computational problems. More precisely, they introduce the theory of modules over polynomial rings (and their factor rings) located around twelve basic problems summarized in the introduction. Among them the ideal membership problem, how to calculate with ideals and modules, the computation of syzygies, the elimination problem, how to handle homomorphisms of modules, and the solution of polynomial equations in several variables. The techniques developed here and related to these basic questions have numerous applications. The authors discuss several of them in the course of their presentations. The aim of the text is twofold. One might use it for an introduction of more sophisticated techniques of commutative algebra. So the basic concepts are explained from the very beginning, based on an undergraduate course in algebra. On the other hand it may be used in order to illustrate advanced concepts of algebra from a concrete and computational point of view as it may be welcome for a seminar. To an interested reader the authors give advices for the use of the computer algebra system CoCoA for practical and experimental exercises. The central tool of all of the authors' introductory problems and questions is the theory of Gröbner bases. There are some well-written introductions to the subject among them those of \textit{W. W. Adams} and \textit{P. Loustaunau} [``An introduction to Gröbner bases (Providence 1994; Zbl 0803.13015)], \textit{D. Cox, J. Little}, and \textit{D. O'Shea} [``Ideals, varieties and algorithms (2nd ed. 1996; Zbl 0861.13012)], and chapter 15 of \textit{D. Eisenbud}'s book [``Commutative algebra with a view towards algebraic geometry (1995; Zbl 0819.13001)]. What is the authors' intention for another introductory text? First of all they fill a gap between most of the theoretical background and practical exercises. To this end they relate most of their investigations to exercises based on the computer algebra system CoCoA freely available under anonymous ftp. In an appendix there are three chapters (A. ``How to get started with CoCoA, B. ``How to program CoCoA, C. ``A potpourri of CoCoA programs) that encourage an interested reader to study details of CoCoA, necessary for an active learning of the theory, as well as the computer algebra system CoCoA. Beginning with a short introduction the book consists of three main chapters divided into subsections. The first chapter `Foundations' provides an excursion into basics about polynonomial rings, monomial modules, term orderings and the division algorithm in several variables. The material covers Dickson's lemma and how to represent and compute residue classes of the modules. The advantage of this basic chapter (at least from the reviewer's point of view) is of begin of the investigations with the consequent study of modules. In introductory texts about Gröbner bases one often starts with ideals, later on claiming by `modus vivendi' the corresponding statements are also true for modules. The necessity for the consideration of modules turns out by the study of syzygies, even in the case of ideals. The syzygies as well as rewriting rules, Gröbner bases of ideals and modules, Buchberger's algorithm and Hilbert's Nullstellensatz are studied. Again the authors provide a clear and bright picture about various aspects of Gröbner bases. The chapter culminates in eleven equivalent conditions characterizing when a basis of a module is a Gröbner basis, illustrated by several examples also motivating further investigations. The third chapter `First applications' is concerned with several standard applications of the Gröbner bases theory. It starts with the computation of syzygies, elementary operations and homomorphism of modules, continues with elimination theory, localizations and saturations, and finishes with homomorphisms of algebras and the solution of polynomial systems of equations. Thus it covers elements from homological algebra and algebraic geometry. A central sample of the applications is concerned with the solutions of polynomial equation in several variables. This theme becomes more and more important in different branches of mathematics. Besides of this well-written and clearly presented introduction to the subject completed by plenty of practical exersices (for some of them there are hints to their solution) the book contains another highlight. At the end of every section there are tutorials, alltogether 44 of them. Among them those about Berlekamp's factorization algorithm, graph colorings, splines, Diophantine systems and integer programming, and modern portfolio theory. The ideas behind these tutorials are the following: 1. A tutorial is similar to a small section by itself, not used in the main text. 2. It requires some effort of the reader to develop a small piece of theory or to implement a certain algorithm. 3. It presents several algorithms related to a certain subject rather close to the programming facilities of CoCoA. The book may be used by teachers and students alike as a comprehensive guide to both the theory and the practice of computational commutative algebra. The authors tried to make it as self-contained as possible. It is recommended as a textbook for graduate or advanced undergraduate courses.
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- A Singular introduction to commutative algebra. With contributions by Olaf Bachmann, Christoph Lossen and Hans Schönemann
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Ideals, Varieties, and Algorithms
- scientific article; zbMATH DE number 2206382
- Rotatable designs and \(\mathcal G\)-weakly invariant designs
- Supporting degrees of multi-graded local cohomology modules
- Hilbert function of local Artinian level rings in codimension two
- Gröbner bases for spaces of quadrics of codimension 3
- On border basis and Gröbner basis schemes
- Almost vanishing polynomials for sets of limited precision points
- Computations in the ring of quaternionic polynomials
- A combinatorial approach to involution and -regularity. II: Structure analysis of polynomial modules with Pommaret bases
- Discovery of statistical equivalence classes using computer algebra
- The integration of systems of linear PDEs using conservation laws of syzygies
- Confounding revisited with commutative computational algebra
- System theory for system identification.
- Bounding the degree of solutions of differential equations
- Verification of a low-degree polynomial vanishing at empirical points
- Kähler differential algebras for 0-dimensional schemes
- Complexity of Gröbner basis detection and border basis detection
- A p-adic RANSAC algorithm for stereo vision using Hensel lifting
- Characterizations of border bases
- The calculation of radical ideals in positive characteristic
- Bayesian networks for discrete multivariate data: An algebraic approach to inference
- Monomial ideals and the Scarf complex for coherent systems in reliability theory.
- Applications of Gröbner bases to signal and image processing: a survey
- An algebraic approach to Hough transforms
- Numerical computation of H-bases
- Symbolic computation on the partition lattice of an \(n\)-set
- Deterministic normal position transformation and its applications
- Approximate polynomial GCD by approximate syzygies
- Higher weights for the Lagrangian-Grassmannian codes
- Computational aspects of Burnside rings. II: Important maps
- Decomposition of Feynman integrals by multivariate intersection numbers
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
- Canonical Hilbert-Burch matrices for power series
- Codes on linear sections of the Grassmannian
- Hilbert polynomials of Kähler differential modules for fat point schemes
- Finding endomorphisms of Drinfeld modules
- Degree bounds for Gröbner bases of modules
- Properties of the toric rings of a chordal bipartite family of graphs
- An algebraic attack to the Bluetooth stream cipher \textsc{E0}
- Galois orbits of TQFTs: symmetries and unitarity
- Finite group characters on free resolutions
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Algorithms for checking zero-dimensional complete intersections
- Prony's method on the sphere
- Computing coupled border bases
- A signature based border basis algorithm
- Enumerating partial Latin rectangles
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- Solving multivariate polynomial systems and an invariant from commutative algebra
- Kähler differentials for fat point schemes in \(\mathbb{P}^1\times\mathbb{P}^1\)
- Hyperplane sections, Gröbner bases, and Hough transforms
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- Computing quot schemes via marked bases over quasi-stable modules
- On conversions from CNF to ANF
- Two polynomial representations of experimental design
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
- Algebraic invariants of certain projective monomial curves
- Green's hyperplane restriction theorem: an extension to modules
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Kähler differentials and Kähler differents for fat point schemes
- Exact tests for singular network data
- The space of nodal curves of type \(p,q\) with given Weierstraß semigroup
- Polynomial designs. II : Some existence results of exact rotatable spherical designs
- A computer-aided proof of a conjecture in Euclidean geometry
- Invariant syzygies for the Hermitian Dirac operator
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
- Computational aspects of Burnside rings. I: The ring structure
- On characteristic cones of discrete \(n\)D autonomous systems: theory and an algorithm
- Parametrizations of ideals in \(K[x,y]\) and \(K[x,y,z]\)
- Gröbner basis cryptosystems
- On the uniformity of zero-dimensional complete intersections
- Conditional tests on basins of attraction with finite fields
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
- Further results on homogeneous Gröbner bases under composition
- Computing zero-dimensional schemes
- The Gröbner fan and Gröbner walk for modules
- Generic initial ideals of points and curves
- Markov bases and structural zeros
- Algebraic solutions of holomorphic foliations: an algorithmic approach
- Gröbner bases of ideals invariant under endomorphisms.
- Differential operators on orbifolds
- Are Buchberger's criteria necessary for the chain condition?
- Computing invariants of algebraic groups in arbitrary characteristic
- Algebraic statistics of level codings for fractional factorial designs
- A note on Gröbner bases and Berlekamp's algorithm
- Toric statistical models: parametric and binomial representations
- Effectivity of Brauer-Manin obstructions
- Algebraic exact inference for rater agreement models
- Sequential importance sampling for multiway tables
- Invariant resolutions for several Fueter operators
- On multivariate polynomial matrix factorization problems
- Polynomials for classification trees and applications
- Simple signature based iterative algorithm for calculation of Gröbner bases
- Efficiently computing minimal sets of critical pairs
- Minimal free resolution of a finitely generated module over a regular local ring
- The Gröbner fan of the Hilbert scheme
- On a minimal solution for the indefinite multidimensional truncated moment problem
- Almost vanishing polynomials and an application to the Hough transform
- Semistable Vector Bundles and Tannaka Duality from a Computational Point of View
- Computing border bases using mutant strategies
This page was built for publication: Computational commutative algebra. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507801)
