Boij-Söderberg decompositions of lexicographic ideals (Q2236794)

From MaRDI portal
Revision as of 05:40, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Boij-Söderberg decompositions of lexicographic ideals
scientific article

    Statements

    Boij-Söderberg decompositions of lexicographic ideals (English)
    0 references
    0 references
    26 October 2021
    0 references
    This article focuses on the Boij-Söderberg decomposition of lexicographic ideals. (See [\textit{G. Fløystad}, in: Progress in commutative algebra 1. Combinatorics and homology. Berlin: Walter de Gruyter. 1--54 (2012; Zbl 1260.13020)] for a survey of Boij-Söderberg theory.) Let \(L\subset \mathbf{k}[x_1,\dots,x_n]\) be a monomial ideal whose minimal monomial generating set has the lexicographic property, i.e., for every monomial, \(m\), in the polynomial ring, if \(m\) is lexicographic larger than some minimal monomial generator of same degree then \(m\) is in the ideal. Such an ideal is called a lexicographic ideal, or, abbreviated, a lex ideal. The work contains two main results regarding the Boij-Söderberg decomposition of the Betti table of a lex ideal. The first (Theorem 3.3) relates the summand of pure diagrams of length \(n\) of the Betti table of \(I\) with the corresponding summand of the Betti table of \(\mathfrak{a(-1)}\), where \(\mathfrak{a}=L:(x_1)\). The second (Theorem 4.1) relates the summand of pure diagrams of length \(\leq 2\) of the Betti table of \(I\) with the corresponding summand of the Betti table of \(L+(x_1)\), when \(n=3\), i.e., in the case of three variables, for a lex ideal \(L\) satisfying certain conditions. These ideas are used in Section 5 in the analysis of three examples of Boij-Söderberg decompositions of lex ideals in \(\mathbf{k}[x_1, x_2, x_3]\).
    0 references
    0 references
    Betti diagrams
    0 references
    Boij-Söderberg decompositions
    0 references
    lexicographic ideals
    0 references

    Identifiers