The degree complexity of smooth surfaces of codimension [formula omitted

Abstract

For a given term order, the degree complexity of a projective scheme is defined by the maximal degree of the reduced Gröbner basis of its defining saturated ideal in generic coordinates (Bayer and Mumford, 1993). It is well known that the degree complexity with respect to the graded reverse lexicographic order is equal to the Castelnuovo–Mumford regularity (Bayer and Stillman, 1987). However, much less is known if one uses the graded lexicographic order (Ahn, 2008; Conca and Sidman, 2005).In this paper, we study the degree complexity of a smooth irreducible surface in P4 with respect to the graded lexicographic order and its geometric meaning. As in the case of a smooth curve (Ahn, 2008), we expect that this complexity is closely related to the invariants of the double curve of a surface under a generic projection. As results, we prove that except in a few cases, the degree complexity of a smooth surface S of degree d with h0(IS(2))≠0 in P4 is given by 2+(degY1(S)−12)−g(Y1(S)), where Y1(S) is a double curve of degree (d−12)−g(S∩H) under a generic projection of S. In particular, this complexity is actually obtained at the monomial x0x1x3(degY1(S)−12)−g(Y1(S)) where k[x0,x1,x2,x3,x4] is a polynomial ring defining P4. Exceptional cases are a rational normal scroll, a complete intersection surface of (2,2)-type, or a Castelnuovo surface of degree 5 in P4 whose degree complexities are in fact equal to their degrees. This complexity can also be expressed in terms of degrees of defining equations of IS in the same manner as the result of A. Conca and J. Sidman (Conca and Sidman, 2005). We also provide some illuminating examples of our results via calculations done withMacaulay 2 (Grayson and Stillman, 1997).