Re: [sage-devel] Re: A Sage interface for FGb (Gröbner bases)

2018-11-26 Thread Simon King
Hi! On 2018-11-26, parisse wrote: > not as complete: a quick look indicates that monomial ordering supported > are revlex and lex (no elimination, this is probably not hard to add), and > coefficients must belong to Z/pZ (support for Q would require more work...) What is your definition of "el

[sage-devel] Re: A Sage interface for FGb (Gröbner bases)

2018-11-26 Thread parisse
Le lundi 26 novembre 2018 17:16:16 UTC+1, Bill Hart a écrit : > > > > > From his recent talks, his implementation is nowadays more than > competitive. > I confirm that his timings are very good: for example almost 3 times faster than Giac for cyclic9 modular. On the other hand, the implementat

[sage-devel] Re: A Sage interface for FGb (Gröbner bases)

2018-11-26 Thread 'Bill Hart' via sage-devel
On Saturday, 24 November 2018 20:25:13 UTC+1, john_perry_usm wrote: > > I walk into this discussion with some hesitancy, but Christian Eder has > developed a rather efficient F4 algorithm. [1] I know it works and is quite > fast, though I haven't compared it to the implementations mentioned abo

Re: [sage-devel] A Sage interface for FGb (Gröbner bases)

2018-11-26 Thread Jean-Pierre Flori
For GB addict, yet another open source implementation: https://gforge.inria.fr/projects/tinygb/ -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr