×

Monomial resolutions supported by simplicial trees. (English) Zbl 1330.13016

Let \(I\) be a monomial ideal in a polynomial ring \(S\) over a field \(k\), which is minimally generated by monomials \(m_1,\ldots,m_t\) and \(\Delta\) be a simplicial complex on \(t\) vertices such that each vertex of \(\Delta\) is labeled with one of the generators \(m_1,\ldots,m_t\) and each face is labeled with the least common multiple of the labels of its vertices. In [D. Bayer et al., Math. Res. Lett. 5, No. 1–2, 31–46 (1998; Zbl 0909.13010)] it was proved that the chain complex of \(\Delta\) is a free resolution of \(S/I\) if and only if the induced subcomplex \(\Delta_m\) is empty or acyclic for every monomial \(m\in S\) and it is a minimal free resolution if and only if \(m_A\neq m_{A'}\) for every proper subface \(A'\) of a face \(A\). In the paper under review this criterion had been translated for the class of simplicial trees and it was shown that for a simplicial tree \(\Delta\) the chain complex \(C(\Delta;S)\) is a free resolution of \(S/I\) if and only if the induced subcomplex \(\Delta_m\) is connected for every monomial \(m\). Then using the fact that simplicial trees are acyclic, it was shown that every simplicial tree is the Scarf complex of a monomial ideal \(I\) and supports a minimal resolution of \(I\).
Also for an eligible simplicial complex \(\Delta\), a Scarf ideal of \(\Delta\) had been constructed with smaller monomial generators compared to the Scarf ideal given in [I. Peeva and M. Velasco, Trans. Am. Math. Soc. 363, No. 4, 2029–2046 (2011; Zbl 1221.13024)] and for a monomial ideal \(I\) in-between these two Scarf ideals, it was shown that the Scarf complex of \(I\) contains \(\Delta\) as a subcomplex.

MSC:

13D02 Syzygies, resolutions, complexes and commutative rings
13F55 Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes

References:

[1] D. Bayer, I. Peeva and B. Sturmfels, Monomial resolutions , Math. Res. Lett. 5 (1998), 31-46. · Zbl 0909.13010 · doi:10.4310/MRL.1998.v5.n1.a3
[2] A. Björner, Topological methods , Handbook of combinatorics , Volumes 1 and 2, Elsevier, Amsterdam, 1995.
[3] M. Caboara and S. Faridi, Odd-cycle-free complexes and the Koenig property , Rocky Mountain J. Math. 41 (2011), 1059-1079. · Zbl 1284.05144 · doi:10.1216/RMJ-2011-41-4-1059
[4] M. Caboara, S. Faridi and P. Selinger, Simplicial cycles and the computation of simplicial trees , J. Sym. Comp. 42 (2007), 74-88. · Zbl 1124.05094 · doi:10.1016/j.jsc.2006.03.004
[5] S. Faridi, The facet ideal of a simplicial complex , Manuscr. Math. 109 (2002), 159-174. · Zbl 1005.13006 · doi:10.1007/s00229-002-0293-9
[6] —-, Cohen-Macaulay properties of square-free monomial ideals , J. Comb. Theor. 109 (2005), 299-329. · Zbl 1101.13015 · doi:10.1016/j.jcta.2004.09.005
[7] —-, Simplicial trees are sequentially Cohen-Macaulay , J. Pure Appl. Alg. 190 , (2004), 121-136. · Zbl 1045.05029 · doi:10.1016/j.jpaa.2003.11.014
[8] V. Gasharov, I. Peeva and V. Welker, The lcm-lattice in monomial resolutions , Math. Res. Lett. 6 (1999), 521-532. · Zbl 0970.13004 · doi:10.4310/MRL.1999.v6.n5.a5
[9] I. Peeva and M. Velasco, Frames and degenerations of monomial resolutions , Trans. Amer. Math. Soc. 363 (2011), 2029-2046. · Zbl 1221.13024 · doi:10.1090/S0002-9947-2010-04980-3
[10] J. Phan, Minimal monomial ideals and linear resolutions . (2005).
[11] D. Taylor, Ideals generated by monomials in an \(R\)-sequence , Ph.D. thesis, University of Chicago, 1966.
[12] M. Velasco, Minimal free resolutions that are not supported by a CW -complex, J. Alg. 319 (2008), 102-114. · Zbl 1133.13015 · doi:10.1016/j.jalgebra.2007.10.011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.