Re: 6 months free Claude Max 20x for working on Maxima
Michel Talon <[email protected]> Tue, 21 Jul 2026 15:04:03 +0200
| Newsgroups | gmane.comp.mathematics.maxima.general |
|---|---|
| Message-ID | <[email protected]> |
This is a multi-part message in MIME format.
--===============0936841895607713867==
Content-Type: multipart/alternative;
boundary="------------WaSiEFWFFgYXaOzvefKPSwY3"
Content-Language: fr, en-US
This is a multi-part message in MIME format.
--------------WaSiEFWFFgYXaOzvefKPSwY3
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Hello,
having been a user of the grobner package, i think that it seems to work
OK as it is. Maybe it is slow, there are faster algorithms implemented
elsewhere notably the F4 and F5 Faugère algorithms in Maple and Magma,
but it is a limitation of the concept that for a complicated enough
problem, the grobner computation will take "infinite" time. Also the
grobner basis obtained will depend of the ordering of the polynomial
set, so chance is a factor here.
In fact the author Rychlick has written an extension of his code, long
ago, introducing colored variables and such stuff which are useful for
solving algebraically problems in geometry, a well known application of
this business. At the time i took a copy of this program, you can take
it at:
https://www.lpthe.jussieu.fr/~talon/rychlik_CGBLisp.tgz
There is another implementation of grobner basis in maxima, that can be
found in share/affine, due to the late William Shelter. A long long time
ago it seemed to work, slower than the Rychlick implementation, but
since the package affine was written for doing algebraic geometry on an
affine map of an algebraic variety, for non commutative variables, it is
possible it was working for non commutative polynomials. However when i
have tried to play with this stuff more recently almost nothing worked
and there is essentially zero documentation. Maybe this is extremely
interesting but short of understanding all the code, which probably
requires a lot of work done by specialists of the subject.
Le 21/07/2026 à 02:44, Robert Dodier a écrit :
> (1b) as part of that, maybe fix bugs, extend, unify, and update the
> existing stuff for Groebner bases. I don't know where that stands at
> present.
--
Michel Talon
--------------WaSiEFWFFgYXaOzvefKPSwY3
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: 8bit
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
</head>
<body>
<p><font size="4" face="monospace">Hello,</font></p>
<p><font size="4" face="monospace">having been a user of the grobner
package, i think that it seems to work OK as it is. Maybe it is
slow, there are faster algorithms implemented elsewhere notably
the F4 and F5 Faugère algorithms in Maple and Magma, but it is a
limitation of the concept that for a complicated enough problem,
the grobner computation will take "infinite" time. Also the
grobner basis obtained will depend of the ordering of the
polynomial set, so chance is a factor here. <br>
</font></p>
<p><font size="4" face="monospace">In fact the author Rychlick has
written an extension of his code, long ago, introducing colored
variables and such stuff which are useful for solving
algebraically problems in geometry, a well known application of
this business. At the time i took a copy of this program, you
can take it at:</font></p>
<p><font size="4" face="monospace"><a class="moz-txt-link-freetext" href="https://www.lpthe.jussieu.fr/~talon/rychlik_CGBLisp.tgz">https://www.lpthe.jussieu.fr/~talon/rychlik_CGBLisp.tgz</a></font></p>
<p><font size="4" face="monospace">There is another implementation
of grobner basis in maxima, that can be found in share/affine,
due to the late William Shelter. A long long time ago it seemed
to work, slower than the Rychlick implementation, but since the
package affine was written for doing algebraic geometry on an
affine map of an algebraic variety, for non commutative
variables, it is possible it was working for non commutative
polynomials. However when i have tried to play with this stuff
more recently almost nothing worked and there is essentially
zero documentation. Maybe this is extremely interesting but
short of understanding all the code, which probably requires a
lot of work done by specialists of the subject.<br>
</font></p>
<p><font size="4" face="monospace"><br>
</font></p>
<div class="moz-cite-prefix">Le 21/07/2026 à 02:44, Robert Dodier a
écrit :<br>
</div>
<blockquote type="cite"
cite="mid:CAAsY_sT9W5evntJYMfe_760+LSO_BzynECwpLMGNMpvROdzXOw@mail.gmail.com">
<pre>(1b) as part of that, maybe fix bugs, extend, unify, and update the
existing stuff for Groebner bases. I don't know where that stands at
present.</pre>
</blockquote>
<pre class="moz-signature" cols="72">--
Michel Talon</pre>
</body>
</html>
--------------WaSiEFWFFgYXaOzvefKPSwY3--
--===============0936841895607713867==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
--===============0936841895607713867==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
_______________________________________________
Maxima-discuss mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/maxima-discuss
--===============0936841895607713867==--