File: decompose-test.m2

package info (click to toggle)
macaulay2 1.21%2Bds-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 133,096 kB
  • sloc: cpp: 110,377; ansic: 16,306; javascript: 4,193; makefile: 3,821; sh: 3,580; lisp: 764; yacc: 590; xml: 177; python: 140; perl: 114; lex: 65; awk: 3
file content (92 lines) | stat: -rw-r--r-- 2,225 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
R = ZZ/101[a..d]
I = ideal 0_R
assert ( minimalPrimes I == {I} )
assert ( minimalPrimes ideal 1_R == {} )

S = R / ((a+b)*(a^2+b))
I = ideal 0_S
assert (
     minimalPrimes I == {ideal(a^2+b), ideal(a+b)} 
     or
     minimalPrimes I == {ideal(a+b), ideal(a^2+b)} 
     )
assert( minimalPrimes ideal 1_S == {})

A = ZZ/101[a,b,c]
I = ideal (b^2 - 4*a*c)
irreducibleCharacteristicSeries I
minimalPrimes I
assert ( minimalPrimes I == { I } )

A = QQ[a,b,c]
I = ideal (b^2 - 4*a*c)
minimalPrimes I
assert ( minimalPrimes I == { I } )
J = a*I
minimalPrimes J
assert( 
     minimalPrimes J == {ideal a, ideal(b^2-4*a*c)}
     or 
     minimalPrimes J == {ideal(b^2-4*a*c), ideal a}
     )


f = 77 * a^5 + 64637 * a^3 + a - 111
g = 77 * a^8 + 646371 * a^3 + a - 111
h = 111/60 * f * g^2
s = factor h
assert( # s == 3 )
assert( value s == h )


h = symbol h

A = ZZ/103[a..e,h]
I = ideal ( a+b+c+d+e, a*b + b*c + c*d + d*e + e*a ,
     a*b*c + b*c*d + c*d*e + d*e*a + e*a*b,
     a*b*c*d + b*c*d*e + c*d*e*a + d*e*a*b + e*a*b*c,
     a*b*c*d*e - h^5
     )
--old status: This crashes in factory version 3.0.4 but not in 3.0.3
--old status: I've reported it to the Singular people
--old status: We may have to stick with the older version
time minimalPrimes I
assert ( 25 == # minimalPrimes I )

A = ZZ/101[a..e,h]
I = ideal ( a+b+c+d+e, a*b + b*c + c*d + d*e + e*a ,
     a*b*c + b*c*d + c*d*e + d*e*a + e*a*b,
     a*b*c*d + b*c*d*e + c*d*e*a + d*e*a*b + e*a*b*c,
     a*b*c*d*e - h^5
     )
time minimalPrimes I
assert ( 75 == # minimalPrimes I )

end

-- we don't have enough time to test this one

A = QQ[a..e]
I = ideal ( a+b+c+d+e, a*b + b*c + c*d + d*e + e*a ,
     a*b*c + b*c*d + c*d*e + d*e*a + e*a*b,
     a*b*c*d + b*c*d*e + c*d*e*a + d*e*a*b + e*a*b*c,
     a*b*c*d*e - 1
     )
time minimalPrimes I
assert ( 25 == # minimalPrimes I )


end

A = QQ[a..e,h]
I = ideal ( a+b+c+d+e, a*b + b*c + c*d + d*e + e*a ,
     a*b*c + b*c*d + c*d*e + d*e*a + e*a*b,
     a*b*c*d + b*c*d*e + c*d*e*a + d*e*a*b + e*a*b*c,
     a*b*c*d*e - h^5
     )
time minimalPrimes I
assert ( 25 == # minimalPrimes I )
end
-- Local Variables:
-- compile-command: "make -C $M2BUILDDIR/Macaulay2/packages/Macaulay2Doc/test decompose.out"
-- End: