The degree complexity of smooth surfaces of codimension (Q412225)

For a given term order, \textit{D. Bayer} and \textit{D. Mumford} [Symp. Math. 34, 1--48 (1993; Zbl 0846.13017)] defined the degree complexity of a projective scheme as the maximal degree of the reduced Gröbner basis of its defining saturated ideal in generic coordinates. Furthermore, it is shown in \textit{D. Bayer} and \textit{D. Stillman} [Invent. Math. 87, 1--11 (1987; Zbl 0625.13003)] that the degree complexity with respect to the graded reverse lexicographic order is equal to the Castelnuovo-Mumford regularity. However, much less is known if one uses the graded lexicographic order. This paper deals with the computation of the degree complexity of a smooth irreducible surface in \(\mathbb{P}^{4}\). Let \(S\) be a smooth irreducible surface of degree \(d\) with \(h^{0}(l_{S}(2)) \neq 0\) and \(I_{S}\) the defining saturated ideal of \(S\). Denote by \(g(S)\) the genus of \(S\). The authors prove that, except three cases, the degree complexity of \(S\) is given by \(2+\binom{\deg Y_1(S)-1}{2}-g(Y_{1}(S))\), where \(Y_{1}(S)\) is a smooth double curve of \(S\) in \(\mathbb{P}^{3}\) under a generic projection and \(\deg Y_1(S)=\binom{d-1}{2}-g(S \cap H)\). Exceptional cases are either a rational normal scroll or a complete intersection surface of \((2,2)\)-type or a Castelnuovo surface of degree 5 in \(\mathbb{P}^4\) whose degree complexities are in fact equal to their degrees. This complexity can also be expressed only in terms of the maximal degree of defining equations of \(I_S\). Finally they provide some examples of their results via calculations done with \texttt{Macaulay 2}.