Betti diagrams from graphs (Q380385)

Let \(k\) be a field and \(S=k[x_1,\dots,x_n]\) be a polynomial ring in \(n\) variables. \textit{M. Boij} and \textit{J. Söderberg} [Algebra Number Theory 6, No. 3, 437--454 (2012; Zbl 1259.13009)] proved that the Betti diagram of any graded \(S\)-module can be written as a positive rational combination of some pure Betti diagrams. In the paper under review, first, the main theorem of Boij-Söderberg theory is interpreted for the special case of modules with 2-linear minimal resolutions. One of the main results of this paper shows that every Betti diagram from a \(2\)-linear ideal in \(S\) arises from a Stanley-Reisner ring of a threshold graph on \(n+1\) vertices. Also, for an ideal with a \(2\)-linear resolution, an algorithm is given for constructing its corresponding threshold graph that can generate all Betti diagrams arising from ideals with \(2\)-linear resolutions recursively with affine transformations. Moreover, it turns out that these diagrams are the lattice points of a normal reflexive lattice simplex that is combinatorially equivalent to a simplex of anti-lecture hall compositions. Using this geometric picture, it is proved that for every finitely generated graded \(S\)-module \(M\) with a \(2\)-linear minimal free resolution with \(\beta_{0,0}(M)=m\), there exists a collection of \(m\) threshold graphs \(\{T_1,\ldots,T_m\}\), not necessarily distinct, such that \(\beta(M) = \beta(k[T_1]\oplus \cdots \oplus k[T_m])\). Also every Betti diagram from a chordal graph arises as the Betti diagram of a threshold graph on the same number of vertices. Finally, some geometric properties of the lattice simplex \(P_n\) and the lattice simplex \(Q_n\) of nonzero anti-lecture hall compositions of length \(n\) are presented.