Search arXivSearch

arXiv · 2602.17994

A function field analogue of Ligozat's theorem for Drinfeld modular units

Abstract

Fix a nonzero level $\mathfrak{n} \in \mathbb{F}_q[T]$. In this paper, we first establish a function field analogue of Ligozat's theorem, which serves as our main result and provides a criterion for Drinfeld modular units on the Drinfeld modular curve $X_0(\mathfrak{n})$. We further conjecture that this criterion characterizes all Drinfeld modular units; we verify the conjecture in the cases of prime power level and of level equal to the product of two primes. Second, as an application of Drinfeld modular units, we investigate the rational cuspidal divisor class group $\mathcal{C}(\mathfrak{n})$ of $X_0(\mathfrak{n})$. We construct an injective map $g$ from the group of degree $0$ rational cuspidal divisors on $X_0(\mathfrak{n})$ to the group of Drinfeld modular units on $X_0(\mathfrak{n})$ tensored with $\mathbb{Q}$ over $\mathbb{Z}$. As a result, we establish an explicit upper bound for the exponent of $\mathcal{C}(\mathfrak{n})$ for general level $\mathfrak{n}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sheng-Yang Kevin Ho. 2026-02-20. A function field analogue of Ligozat's theorem for Drinfeld modular units. https://arxiv.org/abs/2602.17994

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT