Computation of étale cohomology on curves in single exponential time (Q2211019)

From MaRDI portal
Revision as of 00:15, 24 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Computation of étale cohomology on curves in single exponential time
scientific article

    Statements

    Computation of étale cohomology on curves in single exponential time (English)
    0 references
    0 references
    10 November 2020
    0 references
    Let \(X\) be a smooth connected curve over a field \(k\). Consider a finite locally constant sheaf \(A\) on \(X_{et}\) of abelian groups of torsion invertible in \(k\). Denote by \(p_a(X)\) the arithmetic genus of curve \(X\) and \(p_a(A)\) the arithmetic genus of the normal completion \(Y\) of the smooth curve representing \(A\). As a final point of notation, let \(n\) be the degree of \(Y\) over \(X\). This paper, presents an algorithm computing for smooth connected curves, the first étale cohomology group (proper support or not) with coefficients in a finite locally constant sheaf of abelian groups (of torsion invertible in k), together with theoretical upper bounds for the complexity. It comes as a natural extension of the result showing that the étale cohomology groups are computable if \(X\) is a smooth, projective, geometrically irreducible variety over a field of characteristic 0 (proved by \textit{B. Poonen} et al. [Compos. Math. 151, No. 4, 713--734 (2015; Zbl 1316.14017)]). More precisely, the statement shown in this paper is given as follows: {Theorem.} There exist an algorithm that takes as input a smooth connected curve X over k, and a (curve representing a) finite locally constant sheaf \(A\) of abelian groups of degree \(n\) over \(X\) with \(n\) invertible in \(k\), and return as output \(H^1(X_{k^{\mathrm{sep}}} , A|_{X_{k^{\mathrm{sep}}}}\)) (resp. \(H_c^1(X_{k^{\mathrm{sep}}},A|_{X_{k^{\mathrm{sep}}}}\))) as \(\mathrm{Gal}(k^{\mathrm{sep}}/k)\)- modules in a number of field operations exponential in \(n\log n, p_a(X),\) and \(pa(A)\), where \(p_a\) denotes the arithmetic genus of the normal completion. The complexity of this algorithm is exponential in \(n\log n\), \(p_a(X)\), and \(p_a(A)\). The computation in this algorithm is done via the computation of a groupoid scheme classifying the \(A\)-torsors with some extra rigidifying data.
    0 references
    algebraic geometry
    0 references
    algorithm
    0 references
    étale cohomology
    0 references
    curves
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references