Minimal graded resolutions of reverse lexsegment ideals (Q2435950)

Let \(S=k[x_1,\dots, x_n]\) be a polynomial ring over a field \(k\). Denote by \(M_d\) the set of all monomials of degree \(d\) in \(S\). If \(u,v\in M_d\) and \(u\geq v\), then the set of all monomials \(w\in S\) of degree d such that \(u \geq w \geq v\) is called a segment with respect to \(<\). If \(<\) is the reverse lexicographic order, then such a segment is called arbitrary reverse lexicographic segment and is denoted by \(R(u,v)\). An ideal generated by an arbitrary reverse lexicographic segment is called a reverse lexsegment ideal. The present paper studies minimal graded free resolutions of reverse lexsegment ideals and discusses the extremal Betti numbers of initial reverse lexsegment ideals. Finally, the authors analyze all reverse lexsegment ideals with linear resolution.