Papers
Topics
Authors
Recent
Search
2000 character limit reached

Modular Towers in Drinfeld Module Theory

Updated 17 January 2026
  • Modular towers are recursive sequences of algebraic curves (or function fields) derived from moduli problems of elliptic curves or Drinfeld modules, offering explicit recursive constructions.
  • They employ modular polynomials and isogeny recursions to control key properties such as rational point counts and genus growth, crucial for achieving optimal asymptotic bounds.
  • Their structured and algorithmic approach unifies classical and Drinfeld theories, enabling applications in coding theory, arithmetic geometry, and the explicit construction of global fields.

A modular tower is a recursive sequence of algebraic curves (or function fields) equipped with a modular interpretation, typically arising from the moduli theory of elliptic curves or Drinfeld modules, with each level encoding additional structure (such as level-NN torsion) relative to the previous one. These objects provide a systematic framework for constructing function field towers over finite fields, crucial for attaining high ratios of rational places to genus—a central interest in coding theory, arithmetic geometry, and explicit global fields.

1. Modular Towers: General Construction and Definitions

Modular towers classically refer to sequences of modular curves X0(Nn)X_0(N^n) defined over number fields, where each curve parametrizes isomorphism classes of elliptic curves equipped with cyclic subgroups of order NnN^n. Analogous constructions in the function field setting—most notably over the ring A=Fq[T]A = \mathbb{F}_q[T]—involve Drinfeld modular curves, which classify rank-rr Drinfeld AA-modules plus cyclic AA-submodules of a specified level.

Given a base coefficient ring AA (e.g., A=Fq[T]A=\mathbb F_q[T]), a monic polynomial PAP\in A of degree dd, and a rank-rr Drinfeld module ϕ\phi over an AA-field, the Drinfeld modular curve X0(Pn)X_0(P^n) has function field F(X0(Pn))F(X_0(P^n)) generated by jj-invariants j0,j1,,jnj_0,j_1,\ldots,j_n subject to polynomial recursions induced by modular polynomials ΦP(X,Y)\Phi_P(X,Y) and their generalizations. Recursive tower structures arise from these relations, producing sequences

F0F1F2Fn.F_0 \subset F_1 \subset F_2 \subset \cdots \subset F_n \subset \cdots.

where FnF_n is the function field of X0(Pn)X_0(P^n) over some finite field extension of Fq\mathbb{F}_q. The precise nature of the recursion (depth-one or higher) is determined by the genus of low-level curves and the existence of rational uniformizers (Bassa et al., 2011, Bassa et al., 2016, Bassa et al., 2013).

2. Moduli-Theoretic and Algebraic Structure

The construction of modular towers in the Drinfeld context utilizes the theory of rank-mm Drinfeld modules, particularly normalized forms and their endomorphism rings. For each n1n\geq1, the curve X0(Tn)X_0(T^n) (for P=TP=T) parametrizes weakly supersingular Drinfeld modules of specified rank together with a cyclic TnT^n-torsion submodule of determined rank structure (Anbar et al., 2016).

Key structural features include:

  • Moduli Problem: Classifying Drinfeld modules plus cyclic level-NN structures.
  • Degeneracy Maps: Natural morphisms πn:X0(Tn)X0(Tn1)\pi_n: X_0(T^n)\to X_0(T^{n-1}) forgetting one step of the level structure, inducing a projective system of curves and function fields.
  • Tower Generators and Relations: Explicit recursive relations for the primary invariants (e.g., jj-invariants, “uu”, or “zz” parameters), derived from compositions of isogenies and modular polynomials (see explicit forms below).

The modular towers built from these moduli problems exhibit rich Galois theory: at each level, extensions are Galois, and degrees are explicitly computable, often qq or q+1q+1 depending on the case (Hu et al., 31 Oct 2025).

3. Explicit Equations and Classification of Modular Towers

Several explicit recursions for modular towers have been established, unifying and generalizing previous constructions:

  • Depth-One Recursion: When the modular curve X0(P)X_0(P) is rational over the base field (e.g., for P=TP=T or PP of degree $2$), a coordinate uu can be chosen so that:

(un+1+1)q1un+1=Tq1unq(un+1)q1,(u_{n+1} + 1)^{q-1} u_{n+1} = T^{q-1} \frac{u_n^q}{(u_n+1)^{q-1}},

leading to towers whose field extensions at each stage are of degree qq (Bassa et al., 2011).

  • Cubic Modular Towers: Over Fq3F_{q^3}, the cubic towers arising from rank-3 Drinfeld modules in characteristic T1T-1 are realized via parameterizations such as

(Y1)Yq+(X1)Xq=0,(Y-1)Y^q + (X-1)X^q = 0,

or equivalently, via recursions involving zz-invariants and Hecke operators (Anbar et al., 2016).

  • General Rank-m BBGS Towers: For arbitrary rank m2m\geq 2, the BBGS (Bassa–Beelen–Garcia–Stichtenoth) towers are defined via explicit trace-form recursions depending on a pair (j,k)(j,k) with j+k=mj+k=m and gcd(j,k)=1\gcd(j,k)=1. The recursions take the forms:

F(xi1,xi)=0,H(ui1,ui)=0,F(x_{i-1},x_i)=0,\quad H(u_{i-1},u_i)=0,

where FF and HH are constructed from Fq\mathbb{F}_q-linearized trace polynomials and the modular interpretation of the Drinfeld module level structures (Chen et al., 2019).

The following table summarizes some prototypical modular tower recursions:

Name Base Field Recursion Type
Garcia–Stichtenoth quadratic Fq2\mathbb{F}_{q^2} yq+y=xq1+1y^q + y = x^{q-1} + 1
Elkies quadratic Drinfeld tower Fq2\mathbb{F}_{q^2} (y+1)q1y=xq(x+1)q1(y+1)^{q-1} y = \frac{x^q}{(x+1)^{q-1}}
Cubic “master” modular tower Fq3\mathbb{F}_{q^3} zi+1(zi1)q+1(zi+11)q+1ziq+1=0z_{i+1}(z_i-1)^{q+1} - (z_{i+1}-1)^{q+1}z_i^{q+1} = 0
BBGS general rank-mm (trace) Fqm\mathbb{F}_{q^m} F(xi1,xi)=0F(x_{i-1},x_i)=0 with trace forms

These recursions are unified under a modular framework, with isomorphisms between various previously ad hoc constructions established via explicit changes of variables or translation in tower indices (Anbar et al., 2016, Chen et al., 2019).

4. Asymptotics: Rational Point Counts, Genus Growth, and Bounds

A pivotal aspect of the theory is the asymptotic ratio

λ=limnN(Fn)g(Fn),\lambda = \lim_{n\to\infty} \frac{N(F_n)}{g(F_n)},

where N(Fn)N(F_n) is the number of rational points and g(Fn)g(F_n) is the genus at the nnth level. Towers are termed good if λ>0\lambda>0 and optimal if λ=A(q)\lambda = A(q), where A(q)q1A(q) \leq \sqrt{q} - 1 is the Drinfeld–Vlăduţ bound.

Key results include:

  • Quadratic Towers: For modular towers reduced at primes leading to constant field Fq2\mathbb{F}_{q^2}, optimal towers are achieved with λ=q1\lambda = q-1 (Bassa et al., 2011, Bassa et al., 2013, Bassa et al., 2016).
  • Cubic Towers and Zink’s Bound: For cubic modular towers over Fq3F_{q^3}, the explicit limit is

λ=2(q21)q+2,\lambda = \frac{2(q^2-1)}{q+2},

which realizes Zink's lower bound for non-square fields (Anbar et al., 2016).

  • New Quartic Towers: Towers constructed over quartic constant fields Fq4\mathbb F_{q^4} can attain

λ=q21,\lambda = q^2 - 1,

matching the Drinfeld–Vlăduţ bound (Hu et al., 31 Oct 2025).

Constructing towers whose rational points are supplied predominantly by supersingular Drinfeld modules is a fundamental mechanism for achieving these asymptotics. These calculations typically leverage the explicit Riemann–Hurwitz formula, careful analysis of ramified places, and the explicit modular polynomials or their analogs (notably, Deuring-type polynomials) (Bassa et al., 2011, Bassa et al., 2016, Bassa et al., 2013).

5. Modular Towers: Algorithmic and Structural Aspects

Algorithmic approaches to modular towers—particularly for constructing explicit equations—are well-developed in the Drinfeld setting. The methodology includes:

  1. Selection of Rational Base and Level Structure: Choose FF, AA, and PP such that X(1)X(1) and X0(P)X_0(P) are rational, facilitating the existence of explicit parameterizations.
  2. Isogeny Recursion and Elimination: For pp-isogenies, eliminate module coefficients (subject to modular and characteristic relations) to obtain a single bivariate polynomial determining the recursion at each step (Bassa et al., 2016).
  3. Iterative Extension: The tower is recursively built, adjoining at each stage the solution to a modular equation, and ensuring the desired field extension properties (e.g., total ramification, degree).
  4. Reduction and Extensions: Reduction modulo primes away from the characteristic technique extends the applicability to arbitrary finite fields, with careful attention to supersingular points and splitting loci (Bassa et al., 2011).

The modular tower approach immediately provides control over the Galois structure of the extensions, the computation of automorphism groups (notably via Hecke operators and diamond operators), and the explicit analysis of the ramification and splitting required for the genus and point-count computations (Hu et al., 31 Oct 2025).

6. Connections to Classical and Drinfeld Theory; Generalizations

While the modular towers originated in classical modular curve theory—where X0(pn)X_0(p^n) over Q\mathbb{Q} yields quadratic tower recursions—Drinfeld theory significantly generalizes the landscape:

  • Drinfeld–Vladut Bound: Drinfeld modular towers are central to achieving the Drinfeld–Vladut bound for a wide range of non-prime fields, including quadratic, cubic, and quartic extensions (Bassa et al., 2013, Hu et al., 31 Oct 2025).
  • General Rank: The Generalized Elkies Theorem confirms that the modular-tower approach (with clear moduli problems and explicit isogeny calculations) extends to towers of arbitrary rank m2m\geq2 (BBGS), generalizing the rank-2 theory of Elkies and Garcia–Stichtenoth (Chen et al., 2019).
  • Unification of Ad Hoc Constructions: Modular interpretation unifies various previously distinct constructions—such as the Garcia–Stichtenoth, Elkies, and BBGS towers—under a single moduli-theoretic and algebraic framework, establishing equivalence and isomorphism classes among towers previously studied separately (Anbar et al., 2016).

This modular viewpoint highlights the comprehensive flexibility and generality of the modular tower paradigm, both in the construction of explicit towers and in the analysis of their asymptotic and structural properties.

7. Examples and Applications

Explicit examples underscore the general theory:

  • Rational Drinfeld Tower (quadratic case): Over F4\mathbb{F}_4, the depth-one recursion

(un+1+1)q1un+1=(un+1)q1un(u_{n+1}+1)^{q-1} u_{n+1} = (u_n+1)^{q-1} u_n

yields an optimal tower with λ=1\lambda=1 for q=2q=2 (Bassa et al., 2013).

  • Cubic "Master" Modular Tower: Over Fq3\mathbb{F}_{q^3}, the recursion

zi+1(zi1)q+1(zi+11)q+1ziq+1=0z_{i+1}(z_i-1)^{q+1} - (z_{i+1}-1)^{q+1} z_i^{q+1} = 0

defines the class of all cubic towers reaching Zink's bound (Anbar et al., 2016).

  • Optimal Quartic Tower: For AA as functions regular outside a degree-2 point on PFq1P^1_{\mathbb F_q} and reduction at an auxiliary degree-2 ideal, two non-isomorphic modular towers over Fq4\mathbb F_{q^4} explicitly achieve the Drinfeld–Vlăduţ bound λ=q21\lambda=q^2-1 (Hu et al., 31 Oct 2025).

These towers directly inform the construction of algebraic-geometric codes with optimal asymptotics, explicit examples of maximal curves, and inform the arithmetical theory of finite function fields.


References:

Topic to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Modular Towers.