Kamienny's criterion and the method of Coleman and Chabauty

This paper gives a new proof of Kamienny's Criterion using the method of Coleman and Chabauty.

     

Counting elliptic plane curves with fixed -invariant

The number of degree elliptic plane curves with fixed -invariant passing through general points in is computed.

     

Circles in torus-torus intersections

We present a procedure to compute all the circles in the intersection curve of two tori, based on the geometric properties of the circles embedded in a torus. By using the geometric constraints in computing the circles, our algorithm provides an efficient and robust solution.     

Computing the Rational Torsion of an Elliptic Curve Using Tate Normal Form

It is a classical result (apparently due to Tate) that all elliptic curves with a torsion point of order n(4?n?10, or n=12) lie in a one-parameter family. However, this fact does not appear to have been used ever for computing the torsion of an elliptic curve. We present here an extremely down-to-earth algorithm using the existence of such a family.     

The Densest Packing of 19 Congruent Circles in a Circle

Dense packings of n congruent circles in a circle were given by Kravitz in 1967 for n = 2,..., 16. In 1969 Pirl found the optimal packings for n 10, he also conjectured the dense configurations for 11 n 19. In 1994, Melissen provided a proof for n = 11. In this paper we exhibit the densest packing of 19 congruent circles in a circle with the help of a technique developed by Bateman and Erdös.     

Special Points on the Product of Two Modular Curves

We prove, assuming the generalized Riemann hypothesis for imaginary quadratic fields, the following special case of a conjecture of Oort, concerning Zarsiski closures of sets of CM points in Shimura varieties. Let X be an irreducible algebraic curve in C², containing infinitely many points of which both coordinates are j-invariants of CM elliptic curves. Suppose that both projections from X to C are not constant. Then there is an integer m 1such that X is the image, under the usual map, of the modular curve Y₂0(m). The proof uses some number theory and some topological arguments.     

Average Root Numbers for a Nonconstant Family of Elliptic Curves

We give some examples of families of elliptic curves with nonconstant j-invariant where the parity of the (analytic) rank is not equidistributed among the fibres.     

Twists of elliptic curves

If E is an elliptic curve over , then let E(D) denote theD-quadratic twist of E. It is conjectured that there are infinitely many primesp for which E(p) has rank 0, and that there are infinitely many primes for which has positive rank. For some special curvesE we show that there is a set S of primes p with density for which if is a squarefree integer where , then E(D) has rank 0. In particular E(p) has rank 0 for every . As an example let E1 denote the curve .Then its associated set of primes S₁ consists of the prime11 and the primes p for which the order of the reduction ofX₀(11) modulo p is odd. To obtain the general result we show for primes that the rational factor of L(E(p),1) is nonzero which implies thatE(p) has rank 0. These special values are related to surjective Galois representations that are attached to modularforms. Another example of this result is given, and we conclude with someremarks regarding the existence of positive rank prime twists via polynomialidentities.     

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm

The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time currently cannot be proven rigorously, but heuristic arguments show that it should run in time to prove the primality of . An asymptotically fast version of it, attributed to J. O. Shallit, is expected to run in time . We describe this version in more detail, leading to actual implementations able to handle numbers with several thousands of decimal digits.

     

Inégalité du discriminant pour les pinceaux elliptiques à réductions quelconques

In this article the degree of the discriminant of an elliptic pencil on a projective curve is upper-bounded by using the degree of its conductor and the genus of the base curve. This is done in the most general case, extending a method and a result of Szpiro (1981 and 1990a) and a result of Hindry and Silvermann. The difficult part, dealing with characteristic 2 and 3 and additive reductions, need the introduction of a new object - which we called 'conducteur efficace' - defined by using differentials and interestingly comparable to the usual conductor. This article ends with a few results in the arithmetical case - case corresponding to an inequality conjectured by the second author in 1978: (1) the proof of this inequality in the potentially good reduction cases; (2) the passage from the semi-stable reduction to the general case for a strong inequality.     

Degrees of the Elliptic Teichmüller Lift

The purpose of this paper is to find upper bounds for the degrees, or equivalently, for the order of the poles at O, of the coordinate functions of the elliptic Teichmüller lift of an ordinary elliptic curve over a perfect field of characteristic p. We prove the following bounds:ord₀(x_n)?−(n+2)pⁿ+npⁿ⁻¹, ord₀(y_n)?−(n+3)pⁿ+npⁿ⁻¹. Also, we prove that the bound for x_n is not the exact order if, and only if, p divides (n+1), and the bound for y_n is not the exact order if, and only if, p divides (n+1)(n+2)/2. Finally, we give an algorithm to compute the reduction modulo p³ of the canonical lift for p≠2,3.     

Integral points on elliptic curves and -torsion in class groups

We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques and methods based on quasi-orthogonality in the Mordell-Weil lattice. We apply our results to break previous bounds on the number of elliptic curves of given conductor and the size of the -torsion part of the class group of a quadratic field. The same ideas can be used to count rational points on curves of higher genus.

     

Sieving for rational points on hyperelliptic curves

We give a new and efficient method of sieving for rational points on hyperelliptic curves. This method is often successful in proving that a given hyperelliptic curve, suspected to have no rational points, does in fact have no rational points; we have often found this to be the case even when our curve has points over all localizations . We illustrate the practicality of the method with some examples of hyperelliptic curves of genus .

     

Variations on the Theorem of Birkhoff – von Neumann and Extensions

 The theorem of Birkhoff – von Neumann concerns bistochastic matrices (i.e., matrices with nonnegative real entries such that all row sums and all column sums are equal to one). We consider here real matrices with entries unrestricted in sign and we extend the notion of permutation matrices (integral bistochastic matrices); some generalizations of the theorem are derived by using elementary properties of graph theory. Received: October 10, 2000 Final version received: April 11, 2002     

The four-dimensional Sklyanin algebras

The four-dimensional Sklyanin algebras are certain noncommutative graded algebras having the same Hilbert series as the polynomial ring on four indeterminates. Their structure and representation theory is intimately connected with the geometry of an elliptic curve (and a fixed translation) embedded in ³. This is an account of the work done on these algebras over the past four years.Supported by NSF grant DMS-9100316.     

On the supersingular reduction of elliptic curves

Let a∈Q and denote byE _a the curvey ² = (x ² + l)(x + a). We prove thatE _a(F_p) is cyclic for infinitely many primesp. This fact was known previously only under the assumption of the generalized Riemann hypothesis. Research partially supported by NSERC grant A9418.     

三维Mbius变换中的Beardon定理

本文利用高维保向Ｍｏｂｉｕｓ变换的Ｃｌｉｆｆｏｒｄ矩阵表示，对三维广义椭圆Ｍｏｂｉｕｓ群，椭圆Ｍｏｂｉｕｓ群及运动Ｍｏｂｉｕｓ群进行了讨论，得到了它们各自的特征。