We prove a Tannakian form of Drinfeld's lemma for isocrystals on a variety over a finite field, equipped with actions of partial Frobenius operators. This provides an intermediate step towards transferring V. Lafforgue's work on the Langlands correspondence over function fields from $\ell$-adic to $p$-adic coefficients. We also discuss a motivic variant and a local variant of Drinfeld's lemma.

Let $C$ be a smooth curve over a finite field of characteristic $p$ and let $M$ be an overconvergent $\mathbf {F}$-isocrystal over $C$. After replacing $C$ with a dense open subset, $M$ obtains a slope filtration. This is a purely $p$-adic phenomenon; there is no counterpart in the theory of lisse $\ell$-adic sheaves. The graded pieces of this slope filtration correspond to lisse $p$-adic sheaves, which we call geometric. Geometric lisse $p$-adic sheaves are mysterious, as there is no $\ell$-adic analogue. In this article, we study the monodromy of geometric lisse $p$-adic sheaves with rank one. More precisely, we prove exponential bounds on their ramification breaks. When the generic slopes of $M$ are integers, we show that the local ramification breaks satisfy a certain type of periodicity. The crux of the proof is the theory of $\mathbf {F}$-isocrystals with log-decay. We prove a monodromy theorem for these $\mathbf {F}$-isocrystals, as well as a theorem relating the slopes of $M$ to the rate of log-decay of the slope filtration. As a consequence of these methods, we provide a new proof of the Drinfeld–Kedlaya theorem for irreducible $\mathbf {F}$-isocrystals on curves.

The purpose of this article is to prove a ‘Newton over Hodge’ result for finite characters on curves. Let X be a smooth proper curve over a finite field $\mathbb {F}_q$ of characteristic $p\geq 3$ and let $V \subset X$ be an affine curve. Consider a nontrivial finite character $\rho :\pi _1^{et}(V) \to \mathbb {C}^{\times }$ . In this article, we prove a lower bound on the Newton polygon of the L-function $L(\rho ,s)$ . The estimate depends on monodromy invariants of $\rho $ : the Swan conductor and the local exponents. Under certain nondegeneracy assumptions, this lower bound agrees with the irregular Hodge filtration introduced by Deligne. In particular, our result further demonstrates Deligne’s prediction that the irregular Hodge filtration would force p-adic bounds on L-functions. As a corollary, we obtain estimates on the Newton polygon of a curve with a cyclic action in terms of monodromy invariants.

Let $k$ be a perfect field of characteristic $p>0$ and let $\operatorname{W}$ be the ring of Witt vectors of $k$. In this article, we give a new proof of the Frobenius descent for convergent isocrystals on a variety over $k$ relative to $\operatorname{W}$. This proof allows us to deduce an analogue of the de Rham complexes comparison theorem of Berthelot [$\mathscr{D}$-modules arithmétiques. II. Descente par Frobenius, Mém. Soc. Math. Fr. (N.S.) 81 (2000)] without assuming a lifting of the Frobenius morphism. As an application, we prove a version of Berthelot’s conjecture on the preservation of convergent isocrystals under the higher direct image by a smooth proper morphism of $k$-varieties.

We present a new approach to the problem of computing the zeta function of a hypersurface over a finite field. For a hypersurface defined by a polynomial of degree $d$ in $n$ variables over the field of $q$ elements, one desires an algorithm whose running time is a polynomial function of $d^n \log(q)$. (Here we assume $d \geq 2$, for otherwise the problem is easy.) The case $n = 1$ is related to univariate polynomial factorisation and is comparatively straightforward. When $n = 2$ one is counting points on curves, and the method of Schoof and Pila yields a complexity of $\log(q)^{C_d}$, where the function $C_d$ depends exponentially on $d$. For arbitrary $n$, the theorem of the author and Wan gives a complexity which is a polynomial function of $(pd^n \log(q))^n$, where $p$ is the characteristic of the field. A complexity estimate of this form can also be achieved for smooth hypersurfaces using the method of Kedlaya, although this has only been worked out in full for curves. The new approach we present should yield a complexity which is a small polynomial function of $pd^n\log(q)$. In this paper, we work this out in full for Artin–Schreier hypersurfaces defined by equations of the form $Z^p - Z = f$, where the polynomial $f$ has a diagonal leading form. The method utilises a relative $p$-adic cohomology theory for families of hypersurfaces, due in essence to Dwork. As a corollary of our main theorem, we obtain the following curious result. Let $f$ be a multivariate polynomial with integer coefficients whose leading form is diagonal. There exists an explicit deterministic algorithm which takes as input a prime $p$, outputs the number of solutions to the congruence equation $f = 0 \bmod{p}$, and runs in ${\mathcal O}(p^{2 + \varepsilon})$ bit operations, for any $\varepsilon > 0$. This improves upon the elementary estimate of ${\mathcal O}(p^{n-1 + \varepsilon})$ bit operations, where $n$ is the number of variables, which can be achieved using Berlekamp's root counting algorithm.