On the number of points on a complete intersection over a finite field

1991/07/01 by C. Hooley · 53 citations
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Coding theory and cryptography #Combinatorics #Complete intersection #Dimension (graph theory) #Discrete mathematics #Field (mathematics) #Finite Group Theory Research #Finite field #Finite set #Geometry #Intersection (aeronautics) #Intersection number #Locus (genetics) #Mathematical analysis #Mathematics #Point (geometry) #Pure mathematics

paper · pdf · doi:10.1016/0022-314x(91)90023-5

published in Journal of Number Theory 38(3), 338-358 (Elsevier BV)

openalex publication_date 1991/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02

Cited by

• Dichotomous point counts over finite fields
• On octonary cubic forms
• Representations of integers by systems of three quadratic forms
• NP-hardness of SVP in Euclidean Space
• Singularities of symmetric hypersurfaces and an application to Reed-Solomon codes
• Integral points on cubic hypersurfaces
• Least zero of pairs of additive cubic equations
• Rational points on singular intersections of quadrics
• Stratification theorems for exponential sums in families