Pith. Sign in

RECORD

Explicit equations for Drinfeld modular towers

Number Theory · Submitted 27 Oct 2011

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Reducing at various primes, one obtains towers over finite fields, which are optimal, i.e., reach the Drinfeld--Vladut bound, over a quadratic extension of the finite field.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1110.6076 (version 1)
Pith IDQCTII4GO, Pith's permanent record of this paper and its review
CitationAlp Bassa, Peter Beelen. "Explicit equations for Drinfeld modular towers." arXiv:1110.6076 (2011). https://pith.science/paper/QCTII4GO
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,201 input tokens, $0.0002 reported.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.81 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.71 · compares with prior results 0.87 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Elaborating on ideas of Elkies, we show how recursive equations for towers of Drinfeld modular curves $(X_0(P^n))_{n\ge 0}$ for $P\in \mathbb F_q[T]$ can be read of directly from the modular polynomial $\Phi_P(X,Y)$ and how this naturally leads to recursions of depth two. Although the modular polynomial $\Phi_T(X,Y)$ is not known in general, using generators and relations given by Schweizer, we find unreduced recursive equations over $\mathbb F_q(T)$ for the tower $(X_0(T^n))_{n\ge 2}$ and of a small variation of it (its partial Galois closure). Reducing at various primes, one obtains towers over finite fields, which are optimal, i.e., reach the Drinfeld--Vladut bound, over a quadratic extension of the finite field. We give a proof of the optimality of these towers, which is elementary and does not rely on their modular interpretation except at one point. We employ the modular interpretation to determine the splitting field of certain polynomials, which are analogues of the Deuring polynomial. For these towers, the particular case of reduction at the prime $T-1$ corresponds to towers introduced by Elkies and Garcia--Stichtenoth.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Elaborating on ideas of Elkies, we show how recursive equations for towers of Drinfeld modular curves $(X_0(P^n))_{n\ge 0}$ for $P\in \mathbb F_q[T]$ can be read of directly from the modular polynomial $\Phi_P(X,Y)$ and how this naturally leads to recursions of depth two. contribution 0.92 0.94 0.49 asserted 1.00
s1 Although the modular polynomial $\Phi_T(X,Y)$ is not known in general, using generators and relations given by Schweizer, we find unreduced recursive equations over $\mathbb F_q(T)$ for the tower $(X_0(T^n))_{n\ge 2}$ and of a small variation of it (its partial Galois closure). contribution 0.62 0.94 0.10 asserted 1.00
s2 Reducing at various primes, one obtains towers over finite fields, which are optimal, i.e., reach the Drinfeld--Vladut bound, over a quadratic extension of the finite field. result 0.97 0.88 0.30 asserted 1.00
s3 We give a proof of the optimality of these towers, which is elementary and does not rely on their modular interpretation except at one point. contribution 0.54 0.96 0.25 asserted 1.00
s4 We employ the modular interpretation to determine the splitting field of certain polynomials, which are analogues of the Deuring polynomial. method 0.87 0.95 0.05 asserted 1.00
s5 For these towers, the particular case of reduction at the prime $T-1$ corresponds to towers introduced by Elkies and Garcia--Stichtenoth. result 0.42 0.36 0.05 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.85 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Elaborating on ideas of Elkies, we show how recursive equations for towers of Drinfeld modular curves $(X_0(P^n))_{n\ge 0}$ for $P\in \mathbb F_q[T]$ can be read of directly from the modular polynomial $\Phi_P(X,Y)$ and how this naturally leads to recursions of depth two. Although the modular polynomial $\Phi_T(X,Y)$ is not known in general, using generators and relations given by Schweizer, we find unreduced recursive equations over $\mathbb F_q(T)$ for the tower $(X_0(T^n))_{n\ge 2}$ and of a small variation of it (its partial Galois closure). Reducing at various primes, one obtains towers over finite fields, which are optimal, i.e., reach the Drinfeld--Vladut bound, over a quadratic extension of the finite field. We give a proof of the optimality of these towers, which is elementary and does not rely on their modular interpretation except at one point. We employ the modular interpretation to determine the splitting field of certain polynomials, which are analogues of the Deuring polynomial. For these towers, the particular case of reduction at the prime $T-1$ corresponds to towers introduced by Elkies and Garcia--Stichtenoth.

Human review
How the literature uses it

3 arXiv papers cite this in 22 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 16 sentences without a confident label

Builds on it 1 paper
  • Elaborating on ideas of Elkies [ref] , Bassa and Beelen [ref] recently provided recursive equations over $_q(T)$ for the tower $X_0(T^n))_n≥2$ whose reduction at various primes (different from $T$) are optimal over a quadratic extension of the base field.

    Legendre Drinfeld modules and universal supersingular polynomials · Connections to the modular tower $X_0(T^n)$ and supersingular Drinfeld modules · 0.85

Compares with it 1 paper
Cites it as background 2 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.