Computation of graded ideals with given extremal Betti numbers in a polynomial ring. (July 2019)

• Record Type: Journal Article
• Authors: Amata, Luca; Crupi, Marilena
• Is Part Of: Journal of symbolic computation. Volume 93(2019)
• Page Start: 120
• Page End: 132
• Publication Date: 2019-07
• Subjects: 13B25 -- 13D02 -- 16W50 -- 68W30; Graded ideals -- Monomial ideals -- Minimal graded resolution -- Extremal Betti numbers -- Algorithms; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2018.04.019
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: Consider a polynomial ring in a finite number of variables over a field of characteristic 0. We implement in CoCoA some algorithms in order to easy compute graded ideals of this ring with given extremal Betti numbers (positions as well as values). More precisely, we develop a package for determining the conditions under which, given two positive integers n, r, 1 ≤ r ≤ n − 1, there exists a graded ideal of a polynomial ring in n variables with r extremal Betti numbers in the given position. An algorithm to check whether an r -tuple of positive integers represents the admissible values of the r extremal Betti numbers is also described. An example in order to show how the package works is also presented.