Page 1

Displaying 1 – 19 of 19

Showing per page

On some properties of partial intersection schemes.

Alfio Ragusa, Giuseppe Zappalà (2003)

Collectanea Mathematica

Partial intersection subschemes of Pr of codimension c were used to furnish various graded Betti numbers which agree with a fixed Hilbert function. Here we study some further properties of such schemes; in particular, we show that they are not in general licci and we give a large class of them which are licci. Moreover, we show that all partial intersections are glicci. We also show that for partial intersections the first and the last Betti numbers, say m and p respectively, give bounds each other;...

On the Jacobian ideal of the binary discriminant.

Carlos D'Andrea, Jaydeep Chipalkatti (2007)

Collectanea Mathematica

Let Δ denote the discriminant of the generic binary d-ic. We show that for d ≥ 3, the Jacobian ideal of Δ is perfect of height 2. Moreover we describe its SL2-equivariant minimal resolution and the associated differential equations satisfied by Δ. A similar result is proved for the resultant of two forms of orders d, e whenever d ≥ e-1. If Φn denotes the locus of binary forms with total root multiplicity ≥ d-n, then we show that the ideal of Φn is also perfect, and we construct a covariant which...

Orderings of monomial ideals

Matthias Aschenbrenner, Wai Yan Pong (2004)

Fundamenta Mathematicae

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal invariants for the complexity of this ordered set. In particular, we give an interpretation of the height function in terms of the Hilbert-Samuel polynomial, and we compute bounds on the maximal order type.

Currently displaying 1 – 19 of 19

Page 1