Efficient computation of Castelnuovo-Mumford regularity

DOI10.1090/S0025-5718-2011-02515-9zbMath1247.14064OpenAlexW2058337994MaRDI QIDQ5389451

Amir Hashemi

Publication date: 26 April 2012

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02515-9

zbMATH Keywords

complexityGröbner basesCastelnuovo-Mumford regularitydegree reverse lexicographic orderingsatiety

Mathematics Subject Classification ID

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)

Related Items (1)

Deterministic genericity for polynomial ideals

Uses Software

• SINGULAR
• noether.lib

Cites Work

• A criterion for detecting m-regularity
• Linear free resolutions and minimal multiplicity
• Minimal resolutions of some monomial ideals
• Résolution des systèmes d'équations algébriques
• Saturation and Castelnuovo-Mumford regularity
• Computing the Castelnuovo-Mumford regularity of some subschemes of \(\mathbb{P}_K^n\) using quotients of monomial ideals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient computation of Castelnuovo-Mumford regularity