Mixed matrices and binomial ideals (Q1815301)

Write \(u\in\mathbb{Z}^n\) as \(u=u^+-u^-\) with nonnegative integral \(u^+\), \(u^-\) of disjoint support. Define the binomial \(f_u=X^{u^+} -X^{u^-}\in\mathbb{Z}[X] =\mathbb{Z}[X_1, \dots,X_n]\). Given \(u_1,\dots, u_r\in\mathbb{Z}^n\) consider the matrix \(M\) having the \(u_i\) as row vectors and the ideals \(I=\langle f_{u_1}, \dots, f_{u_r}\rangle\), \(I^*=\langle f_u:u\in\text{span}_\mathbb{Z} (u_1, \dots,u_r)\rangle\), \(\hat I=\langle f_u:u\in\text{span}_\mathbb{Q} (u_1,\dots,u_r) \cap\mathbb{Z}^n\rangle\). The relations and properties of these binomial ideals are studied in terms of the properties of \(M\). A real matrix is mixed if all rows contain positive and negative entries; it is dominating if it does not contain a square mixed submatrix. A certain simple algorithm produces from a real matrix a submatrix that the authors call derived; all its nonzero rows are mixed. Here a selection of results of Sections 2,3. Theorem 2.3: The height of ideal \(I\) equals \(r-\max\{0,s-t\): The derived of \(M\) contains a mixed \(s\times t\) submatrix\}; Corollary 2.4: A criterion for when \(f_{u_1}, \dots,f_{u_r}\) is a regular sequence. Corollary 2.8: Mixed dominating matrices are \(L\)-matrices in the sense of [\textit{R. A. Brualdi}, \textit{K. L. Chavey}, \textit{B. L. Shader}, Linear Algebra Appl. 196, 37-61 (1994; Zbl 0789.15026)]. Theorem 2.9: If \(M\) is dominating of linearly independent rows, then \(I=I^*\); if even content \((M)=1\), then \(I=I^*=\hat I\). Corollary 2.10: A criterion for a finitely generated subsemigroup \(S\) of \(\mathbb{Z}^n\) in order that \(\mathbb{Z}[t^s: s\in S]\) is a complete intersection. This uses results of [\textit{K. G. Fischer}, \textit{J. Shapiro}, Lect. Notes Pure Appl. Math. 151, 111-130 (1993; Zbl 0792.13008)] and [\textit{J. Herzog}, Manuscr. Math. 3, 175-193 (1970; Zbl 0211.33801)]. Proposition 3.1: An \(r\times (r+1)\) matrix is an \(S\)-matrix in the sense of [\textit{R. A. Brualdi}, \textit{B. L. Shader}, Cambridge Tracts in Math. 116 (1995; Zbl 0833.15002)] and [\textit{V. Klee}, Linear Algebra Appl. 96, 233-247 (1987; Zbl 0628.65034)] iff it is mixed dominating. Theorem 3.5: \textit{C. Delorme}'s [Ann. sci. Ecole norm. sup., IV. Ser. 9, 145-154 (1976; Zbl 0325.20065)] criterion for when is \(\mathbb{Z}[t^s:s\in S]\) a complete intersection, \(S\subset\mathbb{N}\) being a numerical semigroup. The paper draws also on a paper of \textit{D. Eisenbud} and \textit{B. Sturmfels} [Duke Math. J. 84, No. 1, 1-45 (1996)].