Re: [sage-devel] Re: FGb - Gröbner basis computation code

2016-05-11 Thread Thierry
On Wed, May 04, 2016 at 01:54:04PM +0200, Thierry wrote: > Hi, > > On Wed, May 04, 2016 at 03:05:03AM -0700, mmarco wrote: > > Also, has somebody done timing comparisons with singular? > > According to the following ask question, it is much slower at least on a > given concrete example > http://a

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-09 Thread john_perry_usm
On Monday, May 9, 2016 at 4:03:49 AM UTC-5, parisse wrote: > > > Le lundi 9 mai 2016 09:18:53 UTC+2, john_perry_usm a écrit : >> >> >> For the homogeneous cyclic-8, >> >> > int RT = rtimer; int T=timer; size(sba(k,0,0)); rtimer-RT; timer-T; >> 1182 >> 6854 >> 5113 >> >> > Strange figures: I get 4

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-09 Thread parisse
Le lundi 9 mai 2016 09:18:53 UTC+2, john_perry_usm a écrit : > > > For the homogeneous cyclic-8, > > > int RT = rtimer; int T=timer; size(sba(k,0,0)); rtimer-RT; timer-T; > 1182 > 6854 > 5113 > > Strange figures: I get 455 for the first (which is correct for the basis size, while 1182 is wrong)

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-09 Thread john_perry_usm
Changing the rewrite order greatly improves performance (though not yet to an acceptable level). I tested this using Singular's web-interface. For the inhomogeneous cyclic-8, > int RT = rtimer; int T=timer; size(sba(k,0,0)); rtimer-RT; timer-T; 372 6369 5304 For the homogeneous cyclic-8, > in

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-07 Thread parisse
Le dimanche 8 mai 2016 04:08:54 UTC+2, john_perry_usm a écrit : > > What about homogeneous cyclic-8? I'm not sure it will be any better; I'm > just curious. > > I do know Singular is working on improving aspects of the sba() > implementation, and I'm a bit surprised it's that slow. > That's i

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-07 Thread john_perry_usm
What about homogeneous cyclic-8? I'm not sure it will be any better; I'm just curious. I do know Singular is working on improving aspects of the sba() implementation, and I'm a bit surprised it's that slow. On Saturday, May 7, 2016 at 1:32:36 AM UTC-5, parisse wrote: > > > > Le samedi 7 mai 201

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-06 Thread parisse
Le samedi 7 mai 2016 07:30:42 UTC+2, john_perry_usm a écrit : > > I'm sorry. I got the name mixed up; the function you want to look at is > sba(), not dstd() (which is something experimental of mine that never saw > the light of day). > > http://www.singular.uni-kl.de/Manual/latest/sing_39

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-06 Thread john_perry_usm
I'm sorry. I got the name mixed up; the function you want to look at is sba(), not dstd() (which is something experimental of mine that never saw the light of day). http://www.singular.uni-kl.de/Manual/latest/sing_391.htm#SEC430 Because my copy of Singular is a little... "tinkered with" I'

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-06 Thread parisse
Le vendredi 6 mai 2016 15:07:48 UTC+2, john_perry_usm a écrit : > > > One of us misunderstands the other. Here's what I'm saying: > >- Singular's std() is neither an F4- nor F5-style algorithm; it is a >traditional, Buchberger algorithm that uses a modified Gebauer-Möller pair >sele

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-06 Thread john_perry_usm
On Wednesday, May 4, 2016 at 11:58:13 PM UTC-5, parisse wrote: > Le mercredi 4 mai 2016 23:00:23 UTC+2, john_perry_usm a écrit : >> >> Unfortunately Roman doesn't mention on that page whether he used >> Singular's std() or dstd(). The numbers look vaguely std()ish to me (i.e., >> when I compute

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread parisse
Le mercredi 4 mai 2016 23:00:23 UTC+2, john_perry_usm a écrit : > > > Unfortunately Roman doesn't mention on that page whether he used > Singular's std() or dstd(). The numbers look vaguely std()ish to me (i.e., > when I compute the GB of Cyclic-8 using std(), it takes about 40 seconds; > homo

Re: [sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread William Stein
On Wed, May 4, 2016 at 5:17 PM, Luca De Feo wrote: >> Can you also ask him about the license? > > > You can read here http://www-polsys.lip6.fr/~jcf/FGb/Maple/tutorial-fgb.pdf > that "FGb is freely distributed for academic use only". The question has > been asked often: publishing the sources is o

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread Luca De Feo
> > Can you also ask him about the license? > You can read here http://www-polsys.lip6.fr/~jcf/FGb/Maple/tutorial-fgb.pdf that "FGb is freely distributed for academic use only". The question has been asked often: publishing the sources is out of question. -- Luca -- You received this message

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread john_perry_usm
On Wednesday, May 4, 2016 at 3:14:16 PM UTC-5, parisse wrote: > > > Perhaps you should have a look at the link I've posted, there is a > comparison of mgb with magma, singular and my own system giac (for which > there is an optional package in sage), mgb is not open source while > singular and g

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread parisse
Le mercredi 4 mai 2016 12:05:04 UTC+2, mmarco a écrit : > > Can you also ask him about the license? > > Also, has somebody done timing comparisons with singular? > > Perhaps you should have a look at the link I've posted, there is a comparison of mgb with magma, singular and my own system giac

Re: [sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread Thierry
Hi, On Wed, May 04, 2016 at 03:05:03AM -0700, mmarco wrote: > Also, has somebody done timing comparisons with singular? According to the following ask question, it is much slower at least on a given concrete example http://ask.sagemath.org/question/32742/elimination-of-variables-in-polynomial-equ

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread mmarco
Can you also ask him about the license? Also, has somebody done timing comparisons with singular? El miércoles, 4 de mayo de 2016, 10:25:42 (UTC+2), Luca De Feo escribió: > > I was also thinking about writing an interface to FGb. Maple uses this > library via the C API to compute Gröbner bases.

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread parisse
Le mercredi 4 mai 2016 10:25:42 UTC+2, Luca De Feo a écrit : > > I was also thinking about writing an interface to FGb. Maple uses this > library via the C API to compute Gröbner bases. As far as I know Magma uses > an older version of this code too. So it must be doable. > > > Maple will pro

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-04 Thread Luca De Feo
I was also thinking about writing an interface to FGb. Maple uses this library via the C API to compute Gröbner bases. As far as I know Magma uses an older version of this code too. So it must be doable. I spoke to the author, and he is positive about an interface into Sage. If we find ourselve

Re: [sage-devel] Re: FGb - Gröbner basis computation code

2016-05-03 Thread Rusydi H. Makarim
I have been using FGb for the past 3 months. It supports Grobner basis computation over a prime finite field and rational field. I personally only use it for system of equations over a finite field. Some details I would like to share here : 1. The choice to perform computation over finite field

[sage-devel] Re: FGb - Gröbner basis computation code

2016-05-03 Thread Dima Pasechnik
Have you noticed that it's binary only? So you cannot include it. Provide an interface, well, yes. On Tuesday, May 3, 2016 at 8:39:37 PM UTC+1, Travis Scrimshaw wrote: > > Hey all, >I justed wanted to point out that I found this Gröbner basis package: > http://www-polsys.lip6.fr/~jcf/FGb/inde