Resolutions and lattices (Q1605652): Difference between revisions

Given \(S= k[X_1,\dots, X_n]\) and \(M\) a geometric monomial ideal minimally generated by the monomials \(M_1,\dots, M_r\), the author gives several constructions of the minimal free resolution of \(S/M\) based on lattice and poset theoretic notions applied to the setting of polynomial rings where \(l_1\text{vl}_2 v\cdots vl_p= \text{lcm}(l_1,\dots, l_p)\) and the order relation is divisibility. Circuits, broken circuits and nobroken-circuit (i.e., nbc-) sets are defined, the latter forming a simplicial complex \(bc(M)\) in a usual way which plays a major role in constructions, several of them based on the literature and others more novel. Thus ``Construction \(M\)'' gives rise to ``Theorem \(M\)'': If \(M\) is geometric then \(\vec F_{(M)}\) is a minimal free resolution of \(S/M\) which also has associated properties set \(\langle M\rangle\) (sometimes \(\langle M\rangle=\varnothing\)) (for \(M=1\), there is an obvious misquote as well as several such in the introduction). Departing from these theorems it is then possible to give alternate proofs to known results also. For Betti numbers the ``construction 3.1'' yields a simplicial complex which is used to determine Betti numbers of toric ideals in an alternatively elegant way providing a useful addition to a substantial literature on the subject.