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 above. Unfortunately, I haven't heard from him in a while after he went off to Iran for a few weeks, and he doesn't seem to have updated his site since then, either.
Is integrating Eder's project something a group might be interested in doing at [2]? I had planned to apply to work on integrating a similar project at [2] (a different sort of F4-style Gröbner basis algorithm [3,4]) but perhaps [1] would be a good bet since there's no doubt about it and Eder spent at least a year in Paris working with Faugère. regards john perry [1] https://github.com/ederc/gb [2] https://www.ima.umn.edu/2018-2019/SW7.22-26.19 [3] https://github.com/johnperry-math/DynGB [4] https://dl.acm.org/citation.cfm?id=3087643 On Wednesday, November 21, 2018 at 4:43:01 PM UTC-6, Markus Wageringel wrote: > > 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 computing Gröbner bases and > supposedly it is one of the faster implementations that exist. It is > included with Maple [2]. FGb is closed source, but comes with a C interface > that is freely distributed for academic use. Some of the features: > > • The computations run in parallel. (This only seems to work for > computations over finite fields.) > • Elimination/block orders are supported. > • It runs on Linux and Mac. (There seem to be some issues, though. I could > not get FGb to work on my Ubuntu machine. It fails with an "Illegal > instruction" error.) > > > In my Sage interface, I implemented just two functions: computing Gröbner > bases and elimination ideals. Supposedly, the FGb C-library supports other > functionality like computing Hilbert polynomials, but that part of the > library is not documented very well, so it does not make sense to try to > create wrappers for that. The focus is finding a Gröbner basis which, once > computed, can be used by Sage for further computations. > > I just wanted to share this. Maybe it is useful for someone. > > Markus > > [2] https://www-polsys.lip6.fr/~jcf/FGb/Maple/index.html > > -- 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...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
