Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial

DOI10.1007/s00200-015-0263-6zbMath1327.13098arXiv1409.5569MaRDI QIDQ893343

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

zbMATH Keywords

Hilbert polynomial; Pommaret basis; Borel-fixed ideal; quasi-stable ideal

Mathematics Subject Classification ID

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

14Q20: Effectivity, complexity and computational aspects of algebraic geometry

05E40: Combinatorial aspects of commutative algebra

Related Items

Macaulay-like marked bases, Double-generic initial ideal and Hilbert scheme

Uses Software

• StronglyStableIdeals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Term-ordering free involutive bases
• Segments and Hilbert schemes of points
• 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
• Involutive bases of polynomial ideals
• 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
• Borel degenerations of arithmetically Cohen–Macaulay curves in ℙ³
• Algorithms for strongly stable ideals
• Characteristic-free bounds for the Castelnuovo–Mumford regularity
• The Geometry of Syzygies
• An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme