×

Mordell-Weil lattices in characteristic 2. III: A Mordell-Weil lattice of rank 128. (English) Zbl 1040.11041

Summary: We analyze the 128-dimensional Mordell-Weil lattice of a certain elliptic curve over the rational function field \(k(t)\), where \(k\) is a finite field of \(2^{12}\) elements. By proving that the elliptic curve has trivial Tate-Shafarevich group and nonzero rational points of height 22, we show that the lattices density achieves the lower bound derived in our earlier work. This density is by a considerable factor the largest known for a sphere packing in dimension 128. We also determine the kissing number of the lattice, which is by a considerable factor the largest known for a lattice in this dimension.
For Parts I, II, see Noam D. Elkies [Int. Math. Res. Not. 1994, 343–361 (1994; Zbl 0813.52017), Invent. Math. 128, 1–8 (1997; Zbl 0897.11023)].

MSC:

11G05 Elliptic curves over global fields
11H06 Lattices and convex bodies (number-theoretic aspects)
PDFBibTeX XMLCite
Full Text: DOI arXiv Euclid EuDML

References:

[1] Dummigan N., Amer. J. Math. 117 (6) pp 1409– (1995) · Zbl 0914.11033 · doi:10.2307/2375024
[2] Edel Y., Electron. J. Combin. 5 (1) pp RP22– (1998)
[3] Elkies N. D., Internat. Math. Res. Notices pp 343– (1994) · Zbl 0813.52017 · doi:10.1155/S1073792894000395
[4] Elkies N. D., Invent. Math. 128 (1) pp 1– (1997) · Zbl 0897.11023 · doi:10.1007/s002220050133
[5] Illusie L., Ann. Sci. Éeole Norm. Sup. (4) 12 (4) pp 501– (1979)
[6] Milne J. S., Inv. Math. 102 pp 517– (1975)
[7] Nebe G., J. Algebra 199 (2) pp 472– (1998) · Zbl 0897.11022 · doi:10.1006/jabr.1997.7163
[8] Tate J., Séminaire Bourbaki 1965/66 pp 415– (1968)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.