Hi everyone.
I created a Sage wrapper for the C interface of FGb, which makes it easy to
call FGb from within Sage. The sources are available on Github [1] and can
be installed as a Python package into Sage:
[1] https://github.com/mwageringel/fgb_sage
FGb is a C-library by J. C. Faugère for c
Dear All,
I decided to try inheriting from polynomials, specifically from
`MPolynomialRing_polydict` and `MPolynomial_polydict`, but I noticed
something strange: is there any reason why `MPolynomialRing_polydict`
hardcodes `MPolynomial_polydict` as its element class?
I would have expected som
I think I made significant progress, but now I am in need of help.
Progress means, that I reduced the example to a dozen of lines, containing
three tests.
I am in need of help, because I have no idea why these interact.
Martin
Am Dienstag, 20. November 2018 17:40:57 UTC+1 schrieb Frédéric Chap
I think I made significant progress, but now I am in need of help.
Progress means, that I reduced the example to a dozen of lines, containing
three tests.
I am in need of help, because I have no idea why these interact.
Martin
Am Dienstag, 20. November 2018 17:40:57 UTC+1 schrieb Frédéric Chap
Hi Simon,
thank you for the explanation. As you guessed I do not need ideals nor
Gröbner basis. Forget for the moment the matter of infinitely many
generators: what I would like to implement is a polynomial ring whose
variables are certain functions. One possible way to do this would be to wrap
Dear S.,
On 2018-11-20, VulK wrote:
> I am trying to implement the ring of coordinates of a Lie group in the
> perspective of Peter-Weyl theorem.
>
> Concretely I would like to define a polynomial ring with infinitely many
> generators each depending on two points on a lattice. These generators
