In this paper a combinatorial characterization of stable, lex-segment and Borel ideals in P(n) := k[X1, ..., Xn] (assuming chark = 0) is given. The last ones are special monomial ideals, widely studied after the fundamental result of A. Galligo [7] (chark = 0) and D. Bayer–M. Stillman [1] (any characteristic) stating that for every homogeneous ideal a ⊆ P(n) and generic change of coordinates the initial ideal does not vary and is actually fixed by the Borel subgroup of triangular matrices in Gl(n,k). Such a monomial ideal is called generic initial ideal of a and denoted gin (a). Also the first ones are monomial ideals (including the Borel ones) studied after S. Eliahou–M. Kervaire [6] that gave a handy way of computing their minimal free resolutions. We want to characterize stable, Borel and lex-segment ideals a ⊆ P(n) by means of the associated order ideal N (a) ⊆ N, corresponding to the terms outside a. We note first that N (a) reflects the geometric structure of the reduced union of linear varieties X(a) ⊆ P associated to a ⊆ P(n), via the well-known lifting-construction due to Hartshorne (see [13]). To each monomial ideal a ⊆ P(n) we associate a numerical character, denoted e(a) and called e-vector of a, consisting of a sequence of symbols ∞ and positive integers intercalated by finite groups of /’s. We notice that symbols ∞ do not occur if a is 0-dimensional. The numerical character e(a) gives in a very compact way the ‘geometric configuration’ of the order ideal N (a) ⊆ N and a canonical system of generators of a that in the stable case is precisely the minimal system G(a) of monomial generators of a (see Thm. 3.6). Namely, assuming a ⊆ P(n) stable, let G(a) = {m1, . . . , mr} and let m1 <L m2 <L · · · <L mr , where <L is the lexicographic ordering, then the entries of e(a) belonging to N are ordinately
Read full abstract