Calcolo del conduttore di curve algebriche e ideali di punti
Nous décrivons dans cet article les algorithmes nécessaires à une implantation efficace de la méthode de Schoof pour le calcul du nombre de points sur une courbe elliptique dans un corps fini. Nous tentons d’unifier pour cela les idées d’Atkin et d’Elkies. En particulier, nous décrivons le calcul d’équations pour , premier, ainsi que le calcul efficace de facteurs des polynômes de division d’une courbe elliptique.
The postulation of Aritméticamente Cohen-Macaulay (ACM) subschemes of the projective space PkN is well known in the case of codimension 2. There are many different ways of recording this numerical information: numerical character of Gruson/Peskine, h-vector, postulation character of Martin-Deschamps/Perrin... The first aim of this paper is to show the equivalence of these notions. The second and most important aim, is to study the postulation of codimension 3 ACM subschemes of PN. We use a result...
The numerical range of an matrix is determined by an degree hyperbolic ternary form. Helton-Vinnikov confirmed conversely that an degree hyperbolic ternary form admits a symmetric determinantal representation. We determine the types of Riemann theta functions appearing in the Helton-Vinnikov formula for the real symmetric determinantal representation of hyperbolic forms for the genus . We reformulate the Fiedler-Helton-Vinnikov formulae for the genus , and present an elementary computation...
This paper deals with surfaces with many lines. It is well-known that a cubic contains of them and that the maximal number for a quartic is . In higher degree the question remains open. Here we study classical and new constructions of surfaces with high number of lines. We obtain a symmetric octic with lines, and give examples of surfaces of degree containing a sequence of skew lines.
We describe three algorithms to count the number of points on an elliptic curve over a finite field. The first one is very practical when the finite field is not too large ; it is based on Shanks's baby-step-giant-step strategy. The second algorithm is very efficient when the endomorphism ring of the curve is known. It exploits the natural lattice structure of this ring. The third algorithm is based on calculations with the torsion points of the elliptic curve [18]. This deterministic polynomial...
We develop a new method of proving non-speciality of a linear system with base fat points in general position. Using this method we show that the Hirschowitz-Harbourne conjecture holds for systems with base points of equal multiplicity bounded by 42.