With 7.6beta3:
sage: f.numerator()
a01*a10^3*u00^2*u01^2 - a00*a10^2*a11*u00^2*u01^2 -
a00*a01*a10^2*u00*u01^2*u10 + a00^2*a10*a11*u00*u01^2*u10 +
a01*a10^2*a11*u00*u01^2*u10 - a00*a10*a11^2*u00*u01^2*u10 -
a01^2*a10^2*u01^2*u10^2 + a00*a01*a10*a11*u01^2*u10^2 -
a00*a01*a10^2*u00^2*u01*u11 +
Dear Sage-devel,
I recently stumbled upon the following odd behavior in the new release of
sage. The issue does not occur in sage-7.4
Am I missing something ?
sage: var('a00, a10, a01, a11, u00, u10, u01, u11')
(a00, a10, a01, a11, u00, u10, u01, u11)
sage: f = (((a01*a10 -
Dear Mike Zabrocki,
Thank you again.
Your codes are helpful after inserting
P.inject_variables()
Sincerely
Biswajit
On Saturday, 11 February 2017 17:46:17 UTC+5:30, Mike Zabrocki wrote:
>
> Is what you want something like this?:
>
> sage: P = FreeAlgebra(QQ,7,'x1,x2,x3,x4,y1,y2,y3')
>
> sage:
>
> By default, Singular uses 16 bit exponents. But it is perfectly capable of
> working with exponents up to 64 bits. That will be slower of course.
>
How to change this? Is it runtime or compile-time? Is it transparent for
overflow detection?
I guess it isn't easy for Sage to change the
Dear Mike Zabrocki,
Thank you for useful information.
sage: y2bar*y1bar+y1bar*y2bar # should be 0
it would be nice if we get y2bar*y1bar+y1bar*y2bar=0. But we are not
getting that.
Basically I am trying for supergrassmanian which has some commutative
variable x0, x1, x2, x3, x4 and rest non
Is what you want something like this?:
sage: P = FreeAlgebra(QQ,7,'x1,x2,x3,x4,y1,y2,y3')
sage: (x1, x2, x3, x4, y1, y2, y3) = P.gens()
sage: I =
P.ideal([y1*y2+y2*y1,y2*y3+y3*y2,y1*y3+y3*y1,x1*x2-x2*x1,x1*x3-x3*x1,x1*x4-x4*x1,x2*x3-x3*x2,x2*x4-x4*x2,x3*x4-x4*x3])
sage: P.quotient_ring(I)
