Searcharxiv⌕ Search

arXiv subjects

Peter Bruin

Publications and source records attributed to Peter Bruin.

21 records · Page 2Linked to original sources

An approximate spectral representation and explicit bounds on Green functions of Fuchsian groups

We study the Green function gr_Γ for the Laplace operator on the quotient of the hyperbolic plane by a cofinite Fuchsian group Γ. We use a limiting procedure, starting from the resolvent kernel, and lattice point estimates for the action of Γ on the hyperbolic plane to prove an "approximate spectral representation" for gr_Γ. Combining this with bounds on Maaß forms and Eisenstein series for Γ, we prove explicit bounds on gr_Γ.

math.AP↗

Ranks of elliptic curves with prescribed torsion over number fields

We study the structure of the Mordell--Weil group of elliptic curves over number fields of degree 2, 3, and 4. We show that if $T$ is a group, then either the class of all elliptic curves over quadratic fields with torsion subgroup $T$ is empty, or it contains curves of rank~0 as well as curves of positive rank. We prove a similar but slightly weaker result for cubic and quartic fields. On the other hand, we find a group $T$ and a quartic field $K$ such that among the elliptic curves over $K$ with torsion subgroup $T$, there are curves of positive rank, but none of rank~0. We find examples of elliptic curves with positive rank and given torsion in many previously unknown cases. We also prove that all elliptic curves over quadratic fields with a point of order 13 or 18 and all elliptic curves over quartic fields with a point of order 22 are isogenous to one of their Galois conjugates and, by a phenomenon that we call \emph{false complex multiplication}, have even rank. Finally, we discuss connections with elliptic curves over finite fields and applications to integer factorization.

math.NT↗

Computing in Jacobians of projective curves over finite fields

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations can be done efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite morphisms, and hence Picard and Albanese maps on Jacobians; generating uniformly random divisors and points on Jacobians; computing Frobenius maps and Kummer maps; and finding a basis for the $l$-torsion of the Picard group, where $l$ is a prime number different from the characteristic of the base field.

math.AG↗