Sciweavers

1484 search results - page 27 / 297
» Ants meeting algorithms
Sort
View
ANTS
2004
Springer
93views Algorithms» more  ANTS 2004»
14 years 2 months 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
2000
Springer
92views Algorithms» more  ANTS 2000»
14 years 1 months ago
Computing Special Values of Partial Zeta Functions
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
Gautam Chinta, Paul E. Gunnells, Robert Sczech
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
14 years 27 days 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
95views Algorithms» more  ANTS 2006»
14 years 21 days ago
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
Nigel Boston, Harris Nover
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
14 years 21 days 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