Non-simplicial decompositions of Betti diagrams of complete intersections (Q491431)

The authors obtain a simple formula (see Corollary 5.7) for the decomposition of the Betti diagram of a complete intersection into a non-negative rational combination of pure diagrams in terms of the degrees of the minimal generators of the complete intersection. Their method is different from Algorithm 2.2 given by \textit{D. Eisenbud} and \textit{F. Schreyer} in [J. Am. Math. Soc. 22, No. 3, 859--888 (2009; Zbl 1213.13032)], which requires the degree sequences in the pure diagrams being totally ordered. Section 3 and section 4 are about Algorithm 2.2 and their motivations, while section 5 has the main result of this paper. Since the Betti diagram of a complete intersection can be viewed as the tensor product (see Definition 5.1) of some simple pure diagrams, the authors study how to decompose the tensor product of some pure diagrams into the sum of some other pure diagrams in Theorem 5.2, which is the key result of this paper.