Number of Solutions of Systems of Homogeneous Polynomial Equations over Finite Fields
Mrinmoy Datta, Sudhir R. Ghorpade

TL;DR
This paper investigates the maximum number of common zeros of systems of homogeneous polynomials over finite fields, confirming a key conjecture in certain cases and extending previous results.
Contribution
It proves the Tsfasman-Boguslavsky conjecture when the number of polynomials does not exceed the number of variables, extending prior work and clarifying the conjecture's limitations.
Findings
Conjecture holds if number of polynomials ≤ number of variables.
Extends results of Serre (1991) and Boguslavsky (1997).
Shows the conjecture is false if polynomials exceed variables.
Abstract
We consider the problem of determining the maximum number of common zeros in a projective space over a finite field for a system of linearly independent multivariate homogeneous polynomials defined over that field. There is an elaborate conjecture of Tsfasman and Boguslavsky that predicts the maximum value when the homogeneous polynomials have the same degree that is not too large in comparison to the size of the finite field. We show that this conjecture holds in the affirmative if the number of polynomials does not exceed the total number of variables. This extends the results of Serre (1991) and Boguslavsky (1997) for the case of one and two polynomials, respectively. Moreover, it complements our recent result that the conjecture is false, in general, if the number of polynomials exceeds the total number of variables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
