Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
DOI10.1007/S00200-015-0263-6zbMATH Open1327.13098arXiv1409.5569OpenAlexW1860367272MaRDI QIDQ893343FDOQ893343
Authors: Cristina Bertone
Publication date: 19 November 2015
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.5569
Recommendations
Combinatorial aspects of commutative algebra (05E40) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Cites Work
- An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Geometry of Syzygies
- Involutive bases of polynomial ideals
- Title not available (Why is that?)
- Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
- A Borel open cover of the Hilbert scheme
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- Saturation and Castelnuovo-Mumford regularity
- Segments and Hilbert schemes of points
- Characteristic-free bounds for the Castelnuovo–Mumford regularity
- A combinatorial approach to involution and \(\delta \)-regularity. II: Structure analysis of polynomial modules with Pommaret bases
- A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type
- On the relation between Gröbner and Pommaret bases
- Algorithms for strongly stable ideals
- Term-ordering free involutive bases
- Borel degenerations of arithmetically Cohen-Macaulay curves in \(\mathbb{P}^{3}\)
Cited In (17)
- Strongly stable ideals and Hilbert polynomials
- Algorithms for strongly stable ideals
- On almost revlex ideals with Hilbert function of complete intersections
- Alternative polarizations of Borel fixed ideals
- An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
- Smoothable Gorenstein points via marked schemes and double-generic initial ideals
- m-full ideals II
- Polynomial complexity for Hilbert series of Borel type ideals
- Hilbert schemes with two Borel-fixed points in arbitrary characteristic
- Macaulay-like marked bases
- Double-generic initial ideal and Hilbert scheme
- A general framework for Noetherian well ordered polynomial reductions
- Combinatorial decompositions for monomial ideals
- Computing quot schemes via marked bases over quasi-stable modules
- Quasi-stability versus genericity
- Functors of liftings of projective schemes
- Bar code for monomial ideals
Uses Software
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)