Details:
Title  Efficient computation of CastelnuovoMumford regularity.  Author(s)  Amir Hashemi  Type  Article in Journal  Abstract  In this paper, we introduce the notion of a homogeneous ideal in quasi stable position (QSP); a new definition for the notion of generic coordinates to compute efficiently the CastelnuovoMumford regularity of a homogeneous ideal. This definition is simple to check, because it is tested on the initial ideal for the degree reverse lexicographic ordering. It is explicit, because we provide an algorithm to decide whether a monomial ideal is in QSP or not. The main result of this paper is that the CastelnuovoMumford regularity of an ideal in QSP is the maximal degree of the elements of its reduced Gröbner basis with respect to the reverse lexicographic ordering. We have implemented an algorithm in (the distributed library noether.lib of) SINGULAR based on the above results for computing the CastelnuovoMumford regularity of a general ideal, and we evaluate its performance via some examples.  See more at: http://www.ams.org/journals/mcom/201281278/S002557182011025159/#sthash.30xQ5hgP.dpuf  ISSN  00255718; 10886842/e 
File 
 URL 
http://www.ams.org/journals/mcom/201281278/S002557182011025159/S002557182011025159.pdf 
Language  English  Journal  Math. Comput.  Volume  81  Number  278  Pages  11631177  Publisher  American Mathematical Society (AMS), Providence, RI  Year  2012  Edition  0  Translation 
No  Refereed 
No 
