Counting solutions to equations in many variables over finite fields

DOI10.1007/s10208-003-0093-yzbMath1076.11040MaRDI QIDQ1767486

Alan G. B. Lauder

Publication date: 11 March 2005

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-003-0093-y

zbMATH Keywords

algorithm; finite field; deformation theory; zeta function; homogeneous polynomial; projective hypersurface; Dwork cohomology

Mathematics Subject Classification ID

11Y16: Number-theoretic algorithms; complexity

11D45: Counting solutions of Diophantine equations

14G15: Finite ground fields in algebraic geometry

11G25: Varieties over finite and local fields

14F30: (p)-adic cohomology, crystalline cohomology

11M38: Zeta and (L)-functions in characteristic (p)

Related Items

Nonstandard rank-one nonincreasing maps on symmetric matrices, Computing zeta functions of generic projective hypersurfaces in larger characteristic, Unnamed Item, A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants, Randomized polynomial-time root counting in prime power rings, Point Counting on Singular Hypersurfaces, Counting roots for polynomials modulo prime powers, Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology, Faster \(p\)-adic feasibility for certain multivariate sparse polynomials, Improvements to the deformation method for counting points on smooth projective hypersurfaces, Fast arithmetic in unramified \(p\)-adic fields, Rigid cohomology and \(p\)-adic point counting, A Recursive Method for Computing Zeta Functions of Varieties, Computing zeta functions of arithmetic schemes