Graph Laplacians, component groups and Drinfeld modular curves
Mihran Papikian

TL;DR
This paper investigates the structure and size of the component group of Jacobians of Drinfeld modular curves using graph Laplacians, providing asymptotic estimates and bounds with applications to modular curve properties.
Contribution
It introduces graph Laplacian techniques to estimate the order of component groups and relates these to the discriminant of the Hecke algebra, advancing understanding of Drinfeld modular curves.
Findings
Estimated the order of the component group as the degree of the prime increases.
Showed the component group is not annihilated by the Eisenstein ideal for large primes.
Derived bounds on the spectrum of adjacency operators related to modular curve gonality.
Abstract
Let be a prime ideal of . Let be the Jacobian variety of the Drinfeld modular curve . Let be the component group of at the place . We use graph Laplacians to estimate the order of as goes to infinity. This estimate implies that is not annihilated by the Eisenstein ideal of the Hecke algebra acting on once the degree of is large enough. We also obtain an asymptotic formula for the size of the discriminant of by relating this discriminant to the order of ; in this problem the order of plays a role similar to the Faltings height of classical modular Jacobians. Finally, we bound the spectrum of the adjacency operator of a finite subgraph of an infinite diagram in terms of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
