University of Paderborn Department of Mathematics Diploma Thesis ...

More documents

Recommendations

Info

108 CHAPTER 4. ALGORITHMS FOR STABLE IDEALS[0, 1, 0, 3, 0], [0, 0, 4, 0, 0]], [[1, 0, 0, 0, 0], [0, 2, 0, 0, 0],[0, 1, 2, 0, 0], [0, 1, 1, 1, 0], [0, 0, 3, 0, 0]],[[1, 0, 0, 0, 0], [0, 1, 0, 0, 0], [0, 0, 6, 0, 0], [0, 0, 5, 1, 0],[0, 0, 4, 2, 0]], [[2, 0, 0, 0, 0], [1, 1, 0, 0, 0], [1, 0, 1, 0, 0],[0, 2, 0, 0, 0], [0, 1, 1, 0, 0], [0, 0, 2, 0, 0]],[[1, 0, 0, 0, 0], [0, 2, 0, 0, 0], [0, 1, 2, 0, 0], [0, 1, 1, 1, 0],[0, 1, 0, 2, 0], [0, 0, 4, 0, 0]], [[1, 0, 0, 0, 0], [0, 2, 0, 0, 0],[0, 1, 1, 0, 0], [0, 1, 0, 1, 0], [0, 0, 5, 0, 0], [0, 0, 4, 2, 0]],[[1, 0, 0, 0, 0], [0, 2, 0, 0, 0], [0, 1, 1, 0, 0], [0, 1, 0, 2, 0],[0, 0, 5, 0, 0], [0, 0, 4, 1, 0]], [[2, 0, 0, 0, 0], [1, 1, 0, 0, 0],[1, 0, 1, 0, 0], [1, 0, 0, 1, 0], [0, 2, 0, 0, 0], [0, 1, 1, 0, 0],[0, 0, 3, 0, 0]], [[2, 0, 0, 0, 0], [1, 1, 0, 0, 0], [1, 0, 1, 0, 0],[1, 0, 0, 1, 0], [0, 2, 0, 0, 0], [0, 1, 1, 0, 0], [0, 1, 0, 2, 0],[0, 0, 4, 0, 0]], [[2, 0, 0, 0, 0], [1, 1, 0, 0, 0], [1, 0, 1, 0, 0],[1, 0, 0, 1, 0], [0, 2, 0, 0, 0], [0, 1, 1, 0, 0], [0, 1, 0, 1, 0],[0, 0, 5, 0, 0], [0, 0, 4, 1, 0]]}>> nops(%);Output12We have computed 12 saturated stable ideals with the given Hilbert polynomial. Again,as in Example 4.18, these ideals equal those, computed by Alyson Reeves in [16].In Example 4.18, we saw that there are 8 saturated stable ideals with the same Hilbertpolynomial and the same double saturation as the unique lexicographic ideal L p associatedto the Hilbert polynomial p(z) = 4z+1. The above lines show that there are four saturatedstable ideals with the given Hilbert polynomial but a double saturation, which differs fromthe double saturation of L p .
4.5. COMPUTING STABLE IDEALS TO A GIVEN HILBERT POLYNOMIAL 109These four ideals are given by (x 2 0, x 0 x 1 , x 0 x 2 , x 0 x 3 , x 2 1, x 1 x 2 , x 3 2), (x 2 0, x 0 x 1 , x 0 x 2 , x 2 1, x 1 x 2 , x 2 2),(x 0 , x 2 1, x 1 x 2 2, x 1 x 2 x 3 , x 3 2), (x 0 , x 2 1, x 1 x 2 , x 4 2, x 3 2x 3 ). Hence, the different double saturations,which appear among all saturated stable ideals to the Hilbert polynomial p(z) = 4z + 1,are (x 0 , x 1 , x 4 2) (this is the double saturation of the unique lexicographic ideal associatedto p(z)), (x 0 , x 2 1, x 1 x 2 , x 3 2) and (x 2 0, x 0 x 1 , x 0 x 2 , x 2 1, x 1 x 2 , x 2 2) (these two double saturationsbelong to the four ideals stated above, whose double saturation differs from that of theunique lexicographic ideal). We can compute these four ideals as follows:MuPAD>> M:= compute_all_ideals(poly(4*z + 1, [z]), 4, All):>> M[2];Output{[[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 4, 0]],[[1, 0, 0, 0], [0, 2, 0, 0], [0, 1, 1, 0], [0, 0, 3, 0]],[[2, 0, 0, 0], [1, 1, 0, 0], [1, 0, 1, 0], [0, 2, 0, 0], [0, 1, 1, 0],[0, 0, 2, 0]]}>> M[3];Output3The set of lists M[2] encodes exactly those double saturations stated above. The valueM[3] gives us the number of elements of the set M[2], i.e. the number of all differentdouble saturations appearing among all saturated stable ideals associated to the Hilbertpolynomial p(z).Example 4.22. Consider p(z) := 2z 2 + 2z + 1 and R := K[x 0 , x 1 , x 2 , x 3 , x 4 ]. In Example4.19, we saw that there are 77 saturated stable ideals with the same Hilbert polynomialand the same double saturation as the unique lexicographic ideal L p .Now we compute the number of all saturated stable ideals to the given Hilbert polynomial:MuPAD>> nops(compute_all_ideals(poly(2*z^2 + 2*z + 1, [z]), 4));Output84i.e. there are 84 saturated stable ideals to the given Hilbert polynomial. Hence, among
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: 58 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 ...

Create successful ePaper yourself

Delete template?

Save as template?