Answers are grounded in this paper and cite their sources.
Constructs a discretized Langlands theory for function fields, suggesting new computational paths.
This paper systematically constructs a discretized theory of the Langlands program for function fields of characteristic p > 0. By introducing equipped graphs as combinatorial approximations of algebraic curves, we propose an "arithmetic discretization" paradigm: Local Theory: Define discrete valuation rings O_xδ and discrete local fields F_xδ, rigorously establishing the closure decomposition {Sδλ} = μ ≤ λ Sδμ of the discrete affine Grassmannian GrG,xδ and discrete geometric Satake equivalence (verified for G = SL(2)) ; Global Framework: On equipped single-loop graphs (b_1(Γ)=1), construct the discrete moduli stack Bun_Gδ(Γ) of principal G-bundles and the discrete {}^L G-local system stack LocSys_{{}^L G}δ(Γ), proposing the categorical equivalence conjecture Dét(Bun_Gδ)σ-eigen QCoh(LocSys_{{}^L G}δ) ; Computability: Approximate Frobenius traces of classical sheaves via inverse systems, providing an algorithmic foundation for efficient L-function computation (Weak Comparison Conjecture) . This work offers a discrete realization path for the characteristic p Langlands correspondence, combining rigor with computability.
No takes yet. Share an insight, caveat, or question.
Jianming wang (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: