Indian Institute of Technology, Bombay
Abstract: It is elementary and well known that a nonzero polynomial in one variable of degree d with
coefficients in a field F has at most d zeros in F. It is meaningful to ask similar questions for
systems of several polynomials in several variables of a fixed degree, provided the base field
F is finite. These questions become particularly interesting and challenging when one restricts
to polynomials that are homogeneous, and considers zeros (other than the origin) that are
non-proportional to each other. More precisely, we consider the following question:
Given a system of a fixed number of linearly independent homogeneous polynomial equations of
a fixed degree with coefficients in a fixed finite field F, what is the maximum number ofcommon zeros they can have in the corresponding protective space over F?
The case of a single homogeneous polynomial (or in geometric terms, a projective hypersurface)
corresponds to a classical inequality proved by Serre in 1989. For the general case, an elaborate
conjecture was made by Tsfasman and Boguslavsky, which was open for almost two decades.
Recently significant progress in this direction has been made, and it is shown that while the
Tsfasman-Boguslavsky Conjecture is true in certain cases, it can be false in general. Some new
conjectures have been proposed, and these have been proved in several cases. Results from extremal combinatorics, such as Kruskal-Katona theorem and Clements-Lindstrǒm theorem play a useful role here.
We will give a motivated outline of these developments.Connections to coding theory or to the
problem of counting points of sections of Veronese varieties by linear subvarieties of a fixed dimension
will also be outlined. This talk is mainly based on joint works with Mrinmoy Datta and with Peter
Beelen and Mrinmoy Datta.
