Using only the multigraded betti numbers of a $\ZZ^r$-graded module $M$, this function identifies multidegrees at which the truncation of $M$ will have a linear minimal resolution (i.e. where the resolution will satisfy isLinearComplex).
|
|
|
|
|
The output is a list of the minimal multidegrees $d$ such that the sum of the positive coordinates of $b-d$ is at most $i$ for all degrees $b$ appearing in the i-th step of the resolution of $M$.
|
|
In general linearTruncationsBound will not find the minimal degrees where $M$ has a linear resolution but will be faster than repeatedly truncating $M$.
The object linearTruncationsBound is a method function.