University of Paderborn Department of Mathematics Diploma Thesis ...

More documents

Recommendations

Info

112 CHAPTER 4. ALGORITHMS FOR STABLE IDEALSand R/I 4 as well as the corresponding values of the Hilbert polynomial⎧1 if j = 05 if j = 113 if j = 225 if j = 3⎪⎨41 if j = 4h R/I1 (j) =61 if j = 585 if j = 6113 if j = 7145 if j = 8⎪⎩181 if j = 9⎧1 if z = 05 if z = 113 if z = 225 if z = 3⎪⎨41 if z = 4p R/I1 (z) =61 if z = 585 if z = 6113 if z = 7145 if z = 8⎪⎩181 if z = 9⎧1 if j = 04 if j = 110 if j = 220 if j = 3⎪⎨35 if j = 4h R/I2 (j) =55 if j = 579 if j = 6107 if j = 7139 if j = 8⎪⎩175 if j = 9⎧−5 if z = 0−1 if z = 17 if z = 219 if z = 3⎪⎨35 if z = 4p R/I2 (z) =55 if z = 579 if z = 6107 if z = 7139 if z = 8⎪⎩175 if z = 9⎧1 if j = 05 if j = 113 if j = 225 if j = 3⎪⎨41 if j = 4h R/I3 (j) =61 if j = 585 if j = 6113 if j = 7145 if j = 8⎪⎩181 if j = 9⎧1 if z = 05 if z = 113 if z = 225 if z = 3⎪⎨41 if z = 4p R/I3 (z) =61 if z = 585 if z = 6113 if z = 7145 if z = 8⎪⎩181 if z = 9
4.5. COMPUTING STABLE IDEALS TO A GIVEN HILBERT POLYNOMIAL 113⎧1 if j = 05 if j = 112 if j = 223 if j = 3⎪⎨39 if j = 4h R/I4 (j) =59 if j = 583 if j = 6111 if j = 7143 if j = 8⎪⎩179 if j = 9⎧−1 if z = 03 if z = 111 if z = 223 if z = 3⎪⎨39 if z = 4p R/I4 (z) =59 if z = 583 if z = 6111 if z = 7143 if z = 8⎪⎩179 if z = 9(Later within 4.28 we present a procedure to compute the values of the Hilbert function toa given reduced Hilbert series of R/I for I ⊂ R = K[x 0 , . . . , x n ] a saturated homogeneousideal. This procedure has been used to compute the values of the Hilbert functions above.)It is amazing that the values h R/I1 (j) and h R/I3 (j), j = 0, 1, . . . , 9, equal those of thecorresponding Hilbert polynomial p R/I1 (z) = p R/I3 (z), z = 0, 1, . . . , 9. In the case of R/I 2we have h R/I2 (j) ≠ p R/I2 (j) for j = 0, 1, 2, 3 and h R/I2 (j) = p R/I2 (j) for j = 4, 5, . . . , 9.Finally for R/I 4 we obtain h R/I4 (j) ≠ p R/I4 (j) for j = 0, 1, 2 and h R/I4 (j) = p R/I4 (j) forj = 3, 4, . . . , 9.Comparing the values of the Hilbert functions of R/I 1 , R/I 2 , R/I 3 and R/I 4 in a fixeddegree j ∈ {0, 1, 2, . . . , 9}, we can see that we haveh R/I2 (j) ≤ h R/I4 (j) ≤ h R/I1 (j) = h R/I3 (j)for all j and even h R/I2 (j) < h R/I4 (j) for j ∈ {1, 2, . . . , 9}. Hence, we have a uniquely determinedminimal Hilbert function h R/I2 among all the double saturations I 1 , I 2 , I 3 and I 4appearing among the saturated stable ideals to the Hilbert polynomial p(z) = 2z 2 + 2z + 1.This minimal Hilbert function belongs to R/I 2 , where I 2 is the double saturation of theunique lexicographic ideal L p associated to the Hilbert polynomial p(z). This agrees withthe characterization of the ideal L p in Corollary 3.40 (ii).From this special example we additionally conclude that there may not be a uniquelydetermined ideal I with maximal Hilbert function of R/I, where I is a double saturationappearing among all saturated stable ideals to a given Hilbert polynomial. In our case,the Hilbert functions of R/I 1 and R/I 3 are both maximal in the sense of our comparisonabove.In the next section we present the source code of a procedure to compute all Hilbert seriesassociated to a given Hilbert polynomial.
Page 1:
University of PaderbornDepartment o
Page 5:
”Im großen Garten der Geometriek
Page 9:
AbstractThe main result of this the
Page 12 and 13:
Glossary of MuPAD procedures 129Bib
Page 14 and 15:
This thesis is organized in four ch
Page 16 and 17:
6described in Chapter 4.Additionall
Page 18 and 19:
8 CHAPTER 1. NOTATIONS AND PREREQUI
Page 20 and 21:
10 CHAPTER 1. NOTATIONS AND PREREQU
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
Page 28 and 29:
Page 30 and 31:
20 CHAPTER 2. STABLE IDEALSExample
Page 32 and 33:
22 CHAPTER 2. STABLE IDEALSset, whe
Page 34 and 35:
24 CHAPTER 2. STABLE IDEALSm ∈ M
Page 36 and 37:
26 CHAPTER 2. STABLE IDEALSRemark a
Page 38 and 39:
28 CHAPTER 2. STABLE IDEALSby Lemma
Page 40 and 41:
30 CHAPTER 2. STABLE IDEALSwith Hil
Page 42 and 43:
32 CHAPTER 2. STABLE IDEALSfor all
Page 44 and 45:
34 CHAPTER 2. STABLE IDEALS• We h
Page 46 and 47:
36 CHAPTER 2. STABLE IDEALSis stabl
Page 48 and 49:
38 CHAPTER 2. STABLE IDEALSWe will
Page 50 and 51:
40 CHAPTER 2. STABLE IDEALSAs a cor
Page 52 and 53:
42 CHAPTER 2. STABLE IDEALSTheorem
Page 54 and 55:
44 CHAPTER 2. STABLE IDEALSBinomial
Page 56 and 57:
46 CHAPTER 3. OPERATIONS ON STABLE
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73: 62 CHAPTER 3. OPERATIONS ON STABLE
Page 86 and 87: 76 CHAPTER 4. ALGORITHMS FOR STABLE
Page 110 and 111: 100 CHAPTER 4. ALGORITHMS FOR STABL
Page 137 and 138: Glossary of NotationsK a field of c
Page 139: Glossary of MuPAD procedurescompute
Page 142: [13] F.S. Macaulay, Some properties
show all

University of Paderborn Department of Mathematics Diploma Thesis ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?