A new class of -Fibonacci polynomials.
In this paper we apply the results of our previous article on the -adic interpolation of logarithmic derivatives of formal groups to the construction of -adic -functions attached to certain elliptic curves with complex multiplication. Our results are primarily concerned with curves with supersingular reduction.
Using refinement of an algorithm given by Habsieger and Salvy to find integer polynomials with smallest sup norm on [0, 1] we extend their table of polynomials up to degree 100. For the degree 95 we find a new exceptionnal polynomial which has complex roots. Our method uses generalized Müntz-Legendre polynomials. We improve slightly the upper bound for the integer transfinite diameter of [0, 1] and give elementary proofs of lower bounds for the exponents of some critical polynomials.
When Henri Cohen and his coworkers set out to write PARI twenty years ago, GP was an afterthought. While GP has become the most commonly used interface to the PARI library by a large margin, both the gp interpretor and the GP language are primitive in design. Paradoxically, while gp allows to handle very high-level objects, GP itself is a low-level language coming straight from the seventies.We rewrote GP as a compiler/evaluator pair, implementing several high-level features (statically scoped variables,...