The Complexity of Ford Domains of $$\Gamma _0(N)$$
Results in Mathematics · 2026-06 · 81 (4)
DOI: 10.1007/s00025-026-02641-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Results in Mathematics, online erschienen am 28.04.2026. Verfasst von Pengcheng Zhang. Die Arbeit nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Max Planck Institute for Mathematics.
Abstract (Originalsprache)
We investigate a particular choice of the Ford fundamental domain of the congruence subgroup $$\Gamma _0(N)$$ Γ 0 ( N ) and define a notion of complexity c ( N ) accordingly, which is a nonnegative integer and carries some information on the shape of the Ford domain. The property that $$c(N)=0$$ c ( N ) = 0 first appeared as a technical assumption in a paper by Pohl, which is closely related to a conjecture of Zagier on the “reduction theory” of $$\Gamma _0(N)$$ Γ 0 ( N ) . In this paper, we give a complete classification of positive integers N with $$c(N)=0$$ c ( N ) = 0 , and we also show that c ( N ) goes to infinity if both the number of distinct prime factors of N and the smallest prime factor of N go to infinity.
Förderung
- Max Planck Institute for Mathematics
Zitieren
APA
Zhang, P. (2026). The Complexity of Ford Domains of $$\Gamma _0(N)$$. Results in Mathematics, 81(4). https://doi.org/10.1007/s00025-026-02641-4
Vancouver
Zhang P. The Complexity of Ford Domains of $$\Gamma _0(N)$$. Results in Mathematics. 2026;81(4). doi:10.1007/s00025-026-02641-4
BibTeX
@article{Zhang2026,
author = {Zhang, Pengcheng},
title = {The Complexity of Ford Domains of $$\Gamma _0(N)$$},
journal = {Results in Mathematics},
year = {2026},
volume = {81},
number = {4},
doi = {10.1007/s00025-026-02641-4}
}
EUVIMED