Bill Allombert on Sun, 07 Oct 2018 13:08:16 +0200 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
Re: Introduction, Curve Algorithm |
On Sat, Oct 06, 2018 at 09:43:49PM -0500, Brad Klee wrote: > Hi Pari users, > > Thank you for making this language publicly available. > It seems we have many fun programming hours ahead. > > For starters, I wrote a "Salut au Monde!" program, which > calculates a certified Picard-Fuchs equation for any family > of Hyperelliptic level curves, > > C_z ={ (x,y) : z = 2*H(x,y) = y^2 + 2*V(x) } , > V(x) = c_1*x + c_2*x^2 + ... + c_d*x^d . > > The algorithm is easy to analyse, and leads readily to > the genus-degree formula for non-singular curves C_z: > > https://github.com/bradklee/Hyperelliptic . Hello Brad, thanks for your contribution. Could you explain what this does or give a reference to some explanation ? It seems you are providing example. Maybe put them in a separate file so that they can be used as test. (also it is customary to call gp programm with the .gp extension, though this maybe annoying on Windows maybe). Cheers, Bill.