Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

An integer sequence and standard monomials

    https://doi.org/10.1142/S0219498818500378Cited by:1 (Source: Crossref)

    For an (oriented) graph G on the vertex set {0,1,,n} (rooted at 0), Postnikov and Shapiro (Trans. Amer. Math. Soc.356 (2004) 3109–3142) associated a monomial ideal G in the polynomial ring R=k[x1,,xn] over a field k such that the number of standard monomials of RG equals the number of (oriented) spanning trees of G and hence, dimk(RG)=det(LG), where LG is the truncated Laplace matrix of G. The standard monomials of RG correspond bijectively to the G-parking functions. In this paper, we study a monomial ideal Jn in R having rich combinatorial properties. We show that the minimal free resolution of the monomial ideal Jn is the cellular resolution supported on a subcomplex of the first barycentric subdivision Bd(Δn1) of an n1 simplex Δn1. The integer sequence {dimk(RJn)}n1 has many interesting properties. In particular, we obtain a formula, dimk(RJn)=det([mij]n×n), with mij=1 for i>j, mii=i and mij=ij for i<j, similar to dimk(RG)=det(LG).

    Communicated by T. Ha

    AMSC: 05E40, 13D02