Noether normalization guided by monomial cone decompositions
Noether normalization is a cornerstone in computational commutative algebra. In the last two decades, many algorithms based on Gröbner bases and random changes of variables have been introduced by several authors. In this paper, the author uses Janet bases and the monomial cone decompositions they define to produce an effective implementation of a general algorithm for Noether normalization outlined by Vasconcelos in 1998 [\textit{W. V. Vasconcelos}, Computational methods of commutative algebra and algebraic geometry. Algorithms and Computation in Mathematics 2. Berlin: Springer (1988; Zbl 0896.13021)]. The main advantages in this novel use of Janet bases for Noether normalization are the detection of \textit{sparse} coordinate transformations and the ability to decide whether an ideal contains a monic polynomial in a given variable without computing elimination ideals (which is usually done via Gröbner bases). A suitable choice of coordinate transformation is crucial in this procedure to avoid computational bottlenecks arising from the fact that arbitrary transformations significantly increase the size of coefficients and the number of monomials in a given polynomial. Hence the procedure outlined in this paper has the promise of being significantly faster than most previous approaches. This is confirmed by an experiment performed by the author comparing his implementation against standard procedures found in some of the main computer algebra systems.
- scientific article; zbMATH DE number 4101329
- scientific article; zbMATH DE number 1684371
- scientific article; zbMATH DE number 2098740
- Efficient Algorithms for Computing Nœther Normalization
- scientific article; zbMATH DE number 1684370
- An algorithm for computing the integral closure
- scientific article; zbMATH DE number 5052246
- Generalized normal forms and polynomial system solving
- Computing Gröbner Bases within Linear Algebra
- scientific article; zbMATH DE number 1254276
- Algorithmic Lie theory for solving ordinary differential equations
- An efficient algebraic algorithm for the geometric completion to involution
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Characteristic-free bounds for the Castelnuovo–Mumford regularity
- Combinatorics and commutative algebra.
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Computing combinatorial decompositions of rings
- Efficient Algorithms for Computing Nœther Normalization
- Finding sparse systems of parameters
- Gröbner bases and Stanley decompositions of determinantal ideals
- scientific article; zbMATH DE number 4101329 (Why is no real title available?)
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 635677 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 5222433 (Why is no real title available?)
- scientific article; zbMATH DE number 5052246 (Why is no real title available?)
- scientific article; zbMATH DE number 3198931 (Why is no real title available?)
- Involutive bases of polynomial ideals
- Janet's approach to presentations and resolutions for polynomials and linear PDEs
- Saturation and Castelnuovo-Mumford regularity
- SINGULAR
- The Magma algebra system. I: The user language
- The theory of involutive divisions and an application to Hilbert function computations
- A combinatorial approach to involution and -regularity. II: Structure analysis of polynomial modules with Pommaret bases
- Deterministic genericity for polynomial ideals
- Complementary decompositions of monomial ideals and involutive bases
- Nœther bases and their applications
- Recursive structures in involutive bases theory
- On the computation of Noether normalization
- Efficient Algorithms for Computing Nœther Normalization
- scientific article; zbMATH DE number 4101329 (Why is no real title available?)
- Effective genericity, -regularity and strong Noether position
- An L₂-quotient algorithm for finitely presented groups.
This page was built for publication: Noether normalization guided by monomial cone decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840706)
