That is good news. CoCoALib will hopefully get generic field
extensions over the summer. We already do Weyl Algebras and there is
code for non-commutative monoids, even though that code isn't in the
trunk yet and it is uncertain when it will be finished. Another
interesting thing we are
On 5/5/07, mabshoff [EMAIL PROTECTED] wrote:
Ok, I did discuss that with Max Coboara a couple month back and GBasis
computation over rings is a medium size project for him. He stated
that he needed a diophantic solver for CoCoALib. Linbox provides one
and I have been working on fixing bugs in
Excellent. I'm all for more cooperation between CoCoaLib and Linbox,
since both will be standard components in SAGE.
Ok, when Martin and I initially compared the mvpolynomial performance
of singular vs. CoCoALib singular was 3 times faster for something
like xyz*xyz, when squaring a
On 5/5/07, mabshoff [EMAIL PROTECTED] wrote:
Regarding Linbox: The svn snapshot in 2.5.0alpha2 is about 6 weeks old
and juding from the svn log it seems to be a good idea to update.
The last two times I tried the svn version was broken. The version
included in SAGE was the result of
Oliver Wienand (TU Kaiserslautern, Singular Team)
[EMAIL PROTECTED] writes:
Okay, I looked into the issue. In the top version from Singular of the
repository now has a not yet fully tested polynomial arithmetic for Z/
n with the following functions:
Hi Oliver,
Where is the Singular repo? I
I am a member of the Singular group and working on standard bases over
rings. Therefore as a test case we have implemented standard bases for
Z/2^n[x_1,...x_k] and the corresponding polynomial arithmetic.
As we plan to allow this computations for Z/n[x_1,...,x_k], we will
implement
Okay, I looked into the issue. In the top version from Singular of the
repository now has a not yet fully tested polynomial arithmetic for Z/
n with the following functions:
1) +, -, * of polynomials and numbers
2) where possible / and inverses of numbers (polynomials by monomials
just a matter
Oliver Wienand (TU Kaiserslautern, Singular Team)
[EMAIL PROTECTED] writes:
Okay, I looked into the issue. In the top version from Singular of the
repository now has a not yet fully tested polynomial arithmetic for Z/
n with the following functions:
Thank you, Singular Team! I will use this
(3) SAGE-2.5 will have the first version of an optimized wrapper for
arithmetic using the Singular C++ library directly, which Martin Albrecht
wrote. It only supports QQ and GF(p) though.
This is only temporary, I/it will support CC, RR, and GF(q) soon. If other
base rings - Singular is
On May 2, 3:17 pm, Martin Albrecht [EMAIL PROTECTED]
wrote:
This gives you F_241 - as fas as I know singular returns the ring F_p
with p the next smallest prime if n is composite. Here instead of
F_243 you get F_241. I do not know if you can actually get F_n with n
composite in
10 matches
Mail list logo
