Mrinmoy Datta

Number of solutions of systems of homogeneous polynomial equations over finite fields

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.

Generalized Hamming weights of affine Cartesian codes

In this article, we give the answer to the following question: Given a field

Maximum Number of Common Zeros of Homogeneous Polynomials over Finite Fields

\mathbb{F}

Two-Point Codes for the Generalized GK Curve

, finite subsets

Vanishing Ideals of Projective Spaces over Finite Fields and a Projective Footprint Bound

A_1,\dots,A_m

Higher Weights of Affine Grassmann Codes and Their Duals.

of

On a conjecture of Tsfasman and an inequality of Serre for the number of points on hypersurfaces over finite fields.

\mathbb{F}

Remarks on Tsfasman-Boguslavsky Conjecture and Higher Weights of Projective Reed-Muller Codes.

, and

A Combinatorial Approach to the Number of Solutions of Systems of Homogeneous Polynomial Equations over Finite Fields

r

Maximum number of points on intersection of a cubic surface and a non-degenerate Hermitian surface

linearly independent polynomials