Sciweavers

421 search results - page 25 / 85
» Ant algorithms
Sort
View
ANTS
2004
Springer
93views Algorithms» more  ANTS 2004»
14 years 24 days ago
Nonic 3-adic Fields
We compute all nonic extensions of Q3 and find that there are 795 of them up to isomorphism. We describe how to compute the associated Galois group of such a field, and also the ...
John W. Jones, David P. Roberts
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
13 years 11 months ago
On Weil Polynomials of K3 Surfaces
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...
Andreas-Stephan Elsenhans, Jörg Jahnel
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
13 years 11 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek
ANTS
2010
Springer
248views Algorithms» more  ANTS 2010»
13 years 10 months ago
Huff's Model for Elliptic Curves
Abstract. This paper revisits a model for elliptic curves over Q introduced by Huff in 1948 to study a diophantine problem. Huff's model readily extends over fields of odd cha...
Marc Joye, Mehdi Tibouchi, Damien Vergnaud
ANTS
2006
Springer
75views Algorithms» more  ANTS 2006»
13 years 9 months ago
Symmetric Powers of Elliptic Curve L-Functions
Abstract. The conjectures of Deligne, Beilinson, and Bloch-Kato assert that there should be relations between the arithmetic of algebrogeometric objects and the special values of t...
Phil Martin, Mark Watkins