Complete intersections in certain affine and projective monomial curves (Q487059): Difference between revisions

The authors consider monomial curves given by a parametrization \(\mathcal{C} = \{(t^{d1},\ldots,t^{d_n}) | t \in k\} \subset \mathbb{A}^n_{k}\) and their projective closures \(\mathcal{C}^* \subset \mathbb{P}^n_k\), where \(\mathcal{A} = \{d_1,\ldots, d_n\}\) is a sequence of positive integers and \(k\) is an arbitrary field. They investigate the complete intersection property for toric ideals \[ I_{\mathcal{A}} = \mathrm{ker} \varphi, \text{ where } \varphi: k[x_1,\ldots,x_n] \longrightarrow k[t], x_i \mapsto t^{b_i}, \] and \(I_{\mathcal{A}^*}\) of \(\mathcal{C}\) and \(\mathcal{C}^*\), which are binomial ideals. The aim of the article is the characterization of this property for various choices of the set~\(\mathcal{A}\). Four types of the set~\(\mathcal{A} = \{d_1,\ldots,d_n\}\) are considered: {\parindent=6mm \begin{itemize} \item[1.] \(\mathcal{A}\) is a generalized arithmetic sequence, i.e. for some \(h \in \mathbb{Z}^+\) the sequence \(\{hd_1,d_2,\ldots,d_n\}\) is increasing arithmetic. \item [2.] \(\mathcal{A}\setminus\{d_n\}\) is a generalized arithmetic sequence and \(d_n \in \mathbb{Z}^+\). \item [3.] \(\mathcal{A}\) consists of terms of a \((p,q)\)-Fibonacci sequence \(\{F_n\}\), given by \(F_0=0\), \(F_1 = 1\) and \(F_{n+2} = pF_{n+1} + qF_n\) for \(n>1\), where \(p,q\) are relatively prime. More precisely, the indices of terms which belong to \(\mathcal{A}\) make a generalized arithmetic sequence. \item [4.] \(\mathcal{A}\) consists of terms of a \((p,q)\)-Lucas sequence \(\{L_n\}\), given by \(L_0=2\), \(L_1 = p\) and \(L_{n+2} = pL_{n+1} + qL_n\) for \(n>1\), where \(p,q\) are relatively prime. More precisely, the indices of terms which belong to \(\mathcal{A}\) make an arithmetic sequence. \end{itemize}} In all these cases the authors provide conditions equivalent to the complete intersection property, which depend in a simple way on the size of \(\mathcal{A}\), values of the parameters \(p,q\) describing the sequences and values of the parameters describing the choice of elements of sequences belonging to~\(\mathcal{A}\). For the projective case an algorithm for checking the complete intersection property for any set~\(\mathcal{A}\) is given and used in the proofs. The results are based on earlier works of the authors: \textit{I. Bermejo} et al. [J. Symb. Comput. 42, No. 10, 971--991 (2007; Zbl 1147.14026)] and \textit{I. Bermejo} and \textit{I. García-Marco} [J. Symb. Comput. 68, Part 1, 265--286 (2015; Zbl 1311.13024)].