Explicit modular towers
| dc.creator | Elkies, Noam D. | |
| dc.date | 2001-03-16 | |
| dc.date.accessioned | 2026-07-07T08:18:08Z | |
| dc.date.available | 2026-07-07T08:18:08Z | |
| dc.description | We give a general recipe for explicitly constructing asymptotically optimal towers of modular curves such as {X_0(l^n): n=1,2,3,...}. We illustrate the method by giving equations for eight towers with various geometric features. We conclude by observing that such towers are all of a specific recursive form, and speculate that perhaps every tower of this form that attains the Drinfeld-Vladut bound is modular. | |
| dc.description | 10 pages; presented at Allerton 1998 (see Journal-ref field) | |
| dc.identifier | https://arxiv.org/abs/math/0103107 | |
| dc.identifier | http://arxiv.org/abs/math/0103107 | |
| dc.identifier | Pages 23-32 in Proceedings of the Thirty-Fifth Annual Allerton Conference on Communication, Control and Computing (1997; T.Basar and A.Vardy, eds.), Univ. of Illinois at Urbana-Champaign 1998 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134328 | |
| dc.subject | Number Theory | |
| dc.subject | Information Theory | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 11G18 (Primary) 14G50 (Seconday) | |
| dc.title | Explicit modular towers | |
| dc.type | text |