Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
From MaRDI portal
Publication:893343
Abstract: The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring , in order to design two algorithms: the first one takes as input and an admissible Hilbert polynomial , and outputs the complete list of saturated quasi-stable ideals in the chosen polynomial ring with the given Hilbert polynomial. The second algorithm has an extra input, the characteristic of the field , and outputs the complete list of saturated Borel-fixed ideals in with Hilbert polynomial . The key tool for the proof of both algorithms is the combinatorial structure of a quasi-stable ideal, in particular we use a special set of generators for the considered ideals, the Pommaret basis.
Recommendations
Cites work
- scientific article; zbMATH DE number 482758 (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?)
- A Borel open cover of the Hilbert scheme
- A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type
- A combinatorial approach to involution and \(\delta \)-regularity. II: Structure analysis of polynomial modules with Pommaret bases
- Algorithms for strongly stable ideals
- An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
- Borel degenerations of arithmetically Cohen-Macaulay curves in \(\mathbb{P}^{3}\)
- Characteristic-free bounds for the Castelnuovo–Mumford regularity
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- Involutive bases of polynomial ideals
- On the relation between Gröbner and Pommaret bases
- Saturation and Castelnuovo-Mumford regularity
- Segments and Hilbert schemes of points
- Term-ordering free involutive bases
- The Geometry of Syzygies
- Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
Cited in
(17)- An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
- Polynomial complexity for Hilbert series of Borel type ideals
- Combinatorial decompositions for monomial ideals
- Alternative polarizations of Borel fixed ideals
- Bar code for monomial ideals
- On almost revlex ideals with Hilbert function of complete intersections
- Strongly stable ideals and Hilbert polynomials
- Smoothable Gorenstein points via marked schemes and double-generic initial ideals
- Algorithms for strongly stable ideals
- Computing quot schemes via marked bases over quasi-stable modules
- Quasi-stability versus genericity
- m-full ideals II
- Functors of liftings of projective schemes
- Macaulay-like marked bases
- Double-generic initial ideal and Hilbert scheme
- Hilbert schemes with two Borel-fixed points in arbitrary characteristic
- A general framework for Noetherian well ordered polynomial reductions
This page was built for publication: Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893343)