*How do I disable caching for elliptic curve gens() results?*
*The cache doesn't store (or check) enough information*
*to return the correct results.*
*A cache search slows everything down when computing*
*many different elliptic curves within a programmed loop.*
*Example:*
*E = EllipticCurve([-
Singular supports ordering changes. At least you can create a ring with the
ordering you want and map over. I guess Sage can do this too, although I cannot
check this at the moment.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscrib
I know how to set the term order in Sage. But this is a somewhat different
issue, and maybe I am not explaining it well. What I mean is that I create a
matrix A over S with respect to a basis e_1,...,e_n in Sage and then pass it to
Singular, where I compute the symmetric power. But when it compu
the ordering is specified by the ordering of the ring.
Once the entries of your matrix are in the right ring, you are all set.
Please read Sage docs on PolynomialRing on how you specify the ordering.
On Tuesday, May 23, 2017 at 11:52:21 AM UTC+1, Chris Brav wrote:
>
> Given a Sage matrix A ove
Given a Sage matrix A over a polynomial ring S.=QQ[] , I can make it into a
Singular matrix via A._singular_(). Call the result AA. I can then do various
operations on AA, for example symmetricPower(AA,d).
In this case, the default order for the basis of the symmetric power seems to
be 'dp', but
On Tuesday, May 23, 2017 at 8:17:41 AM UTC+1, Chris Brav wrote:
>
> Thanks. It seems that indeed some rings, such as ZZ and QQ, are too exotic
> for Singular,
this is a limitation of Singular - it appears that any ring in Singular
must be either a polynomial ring or something derived from it,
Caution to those who want to use this: Singular produces a symmetric power
matrix in a basis that is the reverse of what you (or at least I) might expect.
Which basis Singular chooses is clear if you test it on a diagonal matrix with
variables as entries.
--
You received this message because
Thanks. It seems that indeed some rings, such as ZZ and QQ, are too exotic for
Singular, and that you really have to base change to a polynomial ring over a
field. Here is a little function definition which seems to work for any matrix
defined over a domain:
def sympow(A,d):
R=A.base_ring()
