> * Get the okay from Oliver Wienand the main author of the code. I think
> Oliver is reading this list.
You have my okay and please ask if anything is unclear. At the moment
I can only guarantee for the assumed correctness of the polynomial
arithmetic, Gröbner basis and reduction (reduce, i
-- Forwarded message --
Date: 04.04.2008 20:47
Subject: Re: [sage-devel] Re: Experimental Gröbner Bases over Rings
via Singular CVS
To: sage-devel@googlegroups.com
You have to define
#define HAVE_RINGS
to use any rings at all.
I am not sure if this is the problem.
... Oli
I made an implementation of a self designed algorithm to compute the
distribute lattice representing all linear extensions of a given
poset. It should be really fast and also gives you the number pretty
quickly.
If there is interest I can make it SAGE compatible, whatever this
means. It is alread
I have just glimpsed over the code. But maybe it is worth stating in
the comments, that the reduce impl. only returns unqiue answer against
strong Gröbner basis.
Gröbner basis G of I <=> the leading ideal of G generates all leading
terms of I
strong % of I <=> for every leading term t of I there
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 corresponding
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 o
