-
This code
ring = PolynomialRing(QQ, names=[])
id = ring.ideal(0)
print id == id
gives the following error message
---
Traceback (most recent call last)
/Users/bjarke/sync/ in ()
/Us…
-
Trying to use fast float evaluation with multivariate polynomials gives error messages like:
```
AttributeError: 'sage.rings.polynomial.multi_polynomial_libsingular' object has no attribute '_f…
-
```
vars = ",".join([ 'c%s'%i for i in range(1, 23)])
BR = QQ[ 't,'+vars ].fraction_field()
t = BR.gens()[0]
MS = MatrixSpace(BR, 3, 3)
def x(alpha, k, c):
m = MS(1)
if alpha == 'a1':
…
-
Here are some examples:
```
sage: x = Zmod(3)['x'].gen(); x.homogenize('y')
---------------------------------------------------------------------------
Traceback (most recent call last)
/U…
-
Behold this behavior:
```
sage: R. = QQ[]
sage: f = (-1) * (a - d) * (-a + b) * (b - d) * (a - c) * (b - c) * (c - d)
sage: f.factor()
(-1) * (a - d) * (-a + b) * (b - d) * (a - c) * (b - c) * (c …
-
```
sage: k = GF(next_prime(2^31)^2,'x')
sage: k['y,z']
Traceback (most recent call last):
...
OverflowError: long int too large to convert to int
sage: PolynomialRing(k,2,'x,y')
Traceback (most re…
-
Reducing a polynomial to the libsingular polynomials to GF(p^n) is buggy as the following examples all illustrate.
```
sage: R. = QQ[]
sage: S. = GF(5)[]
sage: S(5*x*y + x + 17*y)
0*xx*yy + xx + 2…
-
Initially reported by Jaap:
```
sage -t tut.tex
**********************************************************************
File "tut.py", line 3574:
: f…
-
We have this timing:
```
sage: R.=ZZ[]
sage: f=prod([g^2-12*g+2 for g in R.gens()])
sage: len((f).monomials())
729
sage: %time _=f**2
CPU times: user 21.32 s, sys: 0.14 s, total: 21.46 s
Wall time:…
-
```
----------------------------------------------------------------------
sage/rings/polynomial/multi_polynomial_libsingular.pyx
SCORE sage/rings/polynomial/multi_polynomial_libsingular.pyx: 98% (…
malb updated
16 years ago