Recall: pari-2.9-stable was released in 2016, pari-2.10-testing is scheduled after Atelier 2017 . # DISCUSSION FROM ATELIER 2016 & AFTERMATH ([X] = DONE!) New mathematical features for PARI-2.10 (testing) -> PARI-2.11 (stable) ## Elliptic curves / Arithmetic geometry - include ratpoint ? - include Denis Simon's ellQ.gp - descent - S-integral points - fields generated by torsion points under Galois action. - canonical height of points on elliptic curves over number fields - improve the interface for complex periods of elliptic curves - Falting height of elliptic curves - 2-descent on elliptic curves - isogeny matrix [ done over Q; not as easy as expected over K ] - Frobenius matrix via Kedlaya's algorithm for p=2 - Genus 2 curves; in particular complex periods, Tamagawa numbers and endomorphism rings - Export local solvability of hyperelliptic equations (over number fields) - Arithmetic & pairings on Mumford representation for hyperelliptic curves Jacobians - Khuri-Makdisi's algorithms (Jacobians of (modular) curves) (Peter, Nicolas) - ellbsd to check the BSD hypothesis over number fields or p-adically ## Modular symbols - proper normalisation of new symbols, integrality conditions - support \Gamma_0(1) ! - q-expansions for Eisenstein symbols - support \Gamma_1(N) - other coefficient modules F_q[x,y]_{k-2}, p-adic distributions (overconvergent symbols), etc. ## Algebraic number theory - dynamic nf (confer 'ell'): add new components dynamically as they are computed (integer basis, class group/units...) - rnfinit with list of prime to maximize at, like nfinit([pol,L]) (+rnfcertify ?) (useful for Aurel & Denis) - compact fundamental units (bnfinit + flag) - compact S-units (bnfinit + flag) - rewrite bnfsunit to compute directly S-units without reducing to fundamental units ? - cyclotomic units / subfields to help bnfinit (Jean-Robert) generators, implicit descriptions in terms of linear algebra should be enough. - regulator/units and class number/class group for special cases of high degree fields (abelian fields, say), using different methods from bnfinit - nfinit for abelian fields using adapted bases - rnfidealprimedec for infinite places - rewrite lowerboundforregulator [#1572] - rnfkummer for composite degrees - rnfkummer for prime power degrees (needed for CSA Aurel) - abstract / generalize ad hoc abelian groups constructions (short exact sequences) - nfpolsturm(nf,pol,i) where 1<=i<=nf.r1 (useful for Aurel & Denis) - idealispower (Nicolas) - idealsqrtn (useful for CSA Aurel) (Nicolas) - nfissquare - non maximal orders - cubic / quartic / quintic fields by discriminant - rnfsplitting - more central simple algebras: orders, ideals, localizations (Aurel) - Fieker-Klueners polgalois algorithm, GAP module using PARI ? - van Hoeij-Klueners (maximal) subfields algorithm - nfprimes for the primes in a nf whose norm lie in an interval ## Multiprecision: - Change libpari prec variable to be in bits instead of words. - merge the new-t_REAL branch - go through transcendental functions and include rigorous/faster algorithms - hooks to optionally link with mpfr / mpc higher lever routines - asymptotically fast Flx_resultant [ see Flint ] ## Parallelisation, use parallel interface internally: - CRT - [X] polmodular - factorint - znlog - SEA - bnfinit - ... ## GP - [X] 0xDEADBEEF (integers in hexadecimal) - [X] expose the iterator associated to forxxx() functions, e.g. forprime [ vectorprime(), sumprime(), prodprime(), prime ideals... ] partition / forpartion [ ... ] certain subsets (e.g. sets with m elements, words of Hamming weight k...) - forprimestep(p = a, {b}, Mod(c,d), ...) - forfactored - [X] fold - [X] move "useful" functions from gp.c -> libpari (e.g. handling of \[a-z] shortcuts) - V[-1] (= V[#V-1]) ? - V[a..b] when a > b ? (= []) [CONTROVERSIAL: cool but marginally useful compared to effort] - "dictonary arguments" (aka named parameters) f( disc := 10, p := 7, len := 18 ) instead of f(len, disc, p) = ; f(18,10,7) \\ imagine 42 arguments ## Misc - Factorisation of bivariate polynomials (bifactor script) - Baker-Davenport - Generic Newton method - Abel-Jacobi map ## Technical stuff / internals - cleanup input/output (don't change global pari_infile, etc.) - [Configure] let gcc try to find its libraries first [ don't start by overriding with /usr/lib, /usr/lib64, etc ] - properly tune Flx operations wrt p and degree. - cleanup entree* - remove built-in hashtable and use generic one - don't overload "value" / remove "useless" struct members - [X] parser must only create polynomial variables when creating a t_POL/t_SER - separate valuation for t_SER / t_PADIC (servalp / valp) - rename all gerepile* functions -> gc_* - [X] fix DLLDFLAGS on OS/X [#1623] # LEFTOVERS FROM ATELIER 2013 ## Short hacks - Lambert W [ for x >= -1/e ! ] - primepi for large arguments - inverse gamma / inverse erfc - LinearRecurrence [ via Mod(x, T(x))^N ] - Hurwitz zeta - Bell numbers - sumrat \sum F(n), F rational function \sum (-1)^n F(n), F rational function \prod F(n)) - sumeulerrat, \sum_{p prime} F(p^s) \prod_{p prime} F(p^s) - tools for p-adic analysis: Newton polygon (slopes, # of zeros), Amice transform and interpolation - vecprod (= \prod_i v[i]), see vecsum ## Long term projects - change t_SER format (-> faster + easier to maintain) s[0] = type | lg s[1] = valuation s[2] = precp s[2] = t_POL + functions operating on t_POL mod X^n [ RgXn_... ] - t_REAL format - stat functions ? -> Gaussian vectors - Elliptic curves over finite fields: [proposed by Damien Robert] 1) Basic - geometric points over an extension - base change - Various models, morphisms between them, e.g. from / to Weierstrass 2) Isogenies - isogeny graphs - If $\phi_l(j,j')=0$, compute the isogeny corresponding to E, E' - Isogeny class of an elliptic curve - Endomorphism ring 3) Misc - Weil restriction - Symplectic basis for l-torsion