Deterministic genericity for polynomial ideals
From MaRDI portal
Abstract: We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent algebraic characterisations are provided. It is shown that in characteristic zero the corresponding generic positions can be obtained with a simple deterministic algorithm. In positive characteristic, only adapted stable positions are reachable except for quasi-stability which is obtainable in any characteristic.
The authors deal, mainly from the algorithmic point of view, with the notion of genericity in the frame of commutative algebra, and more precisely in relation to polynomial ideals. More specifically, the paper emphasizes on generic positions related to Gröbner bases. For this purpose, the authors define several stability notions using combinatorial descriptions. Algorithms for obtaining generic positions are provided.
Recommendations
Cites work
- A combinatorial approach to involution and -regularity. I: Involutive bases in polynomial algebras of solvable type
- A combinatorial approach to involution and -regularity. II: Structure analysis of polynomial modules with Pommaret bases
- A criterion for detecting m-regularity
- A new algorithm for computing comprehensive Gröbner systems
- A survey on signature-based algorithms for computing Gröbner bases
- A theorem on refining division orders by the reverse lexicographic order
- Almost regular sequences and Betti numbers
- An algebraic model of transitive differential geometry
- An efficient algebraic algorithm for the geometric completion to involution
- Characteristic-free bounds for the Castelnuovo–Mumford regularity
- Componentwise linear ideals
- Comprehensive Gröbner bases
- Computing the Castelnuovo-Mumford regularity of some subschemes of \(\mathbb{P}_K^n\) using quotients of monomial ideals
- Deterministically Computing Reduction Numbers of Polynomial Ideals
- Effective genericity, -regularity and strong Noether position
- Efficient computation of Castelnuovo-Mumford regularity
- Finding sparse systems of parameters
- Gröbner bases for polynomial systems with parameters
- Hilbert functions and the Buchberger algorithm
- scientific article; zbMATH DE number 1726532 (Why is no real title available?)
- scientific article; zbMATH DE number 3465689 (Why is no real title available?)
- scientific article; zbMATH DE number 1263375 (Why is no real title available?)
- scientific article; zbMATH DE number 1305008 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 2046150 (Why is no real title available?)
- Improved computation of involutive bases
- Involution. The formal theory of differential equations and its applications in computer algebra
- Monomial Ideals
- Noether normalization guided by monomial cone decompositions
- Quasi-stability versus genericity
- Saturation and Castelnuovo-Mumford regularity
- Spencer cohomology, differential equations, and Pommaret bases
- Strong Nœther position and stabilized regularities
- Théorème de division et stabilité en géométrie analytique locale
- Verallgemeinerte COHEN-MACAULAY-Moduln
Cited in
(14)- Deterministic normal position transformation and its applications
- Degree upper bounds for involutive bases
- An involutive GVW algorithm and the computation of Pommaret bases
- Relative Gröbner and involutive bases for ideals in quotient rings
- Computing the resolution regularity of bi-homogeneous ideals
- Dimension and depth dependent upper bounds in polynomial ideal theory
- Computing quot schemes via marked bases over quasi-stable modules
- Nœther bases and their applications
- Recursive structures in involutive bases theory
- Genericity for Mathias forcing over general Turing ideals
- scientific article; zbMATH DE number 7142706 (Why is no real title available?)
- A single exponential time algorithm for homogeneous regular sequence tests
- Cohen-Macaulay, Gorenstein and complete intersection conditions by marked bases
- Computing finite and infinite free resolutions with Pommaret-like bases
This page was built for publication: Deterministic genericity for polynomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680155)
