Maximum Number of Common Zeros of Homogeneous Polynomials over Finite Fields

DOI10.1090/PROC/13863zbMATH Open1428.14036arXiv1705.10185OpenAlexW3104962914WikidataQ115926400 ScholiaQ115926400MaRDI QIDQ3132780FDOQ3132780

Authors: Peter Beelen, Mrinmoy Datta, Sudhir R. Ghorpade 

Publication date: 30 January 2018

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: About two decades ago, Tsfasman and Boguslavsky conjectured a formula for the maximum number of common zeros that $r$ linearly independent homogeneous polynomials of degree $d$ in $m+1$ variables with coefficients in a finite field with $q$ elements can have in the corresponding $m$-dimensional projective space. Recently, it has been shown by Datta and Ghorpade that this conjecture is valid if $r$ is at most $m+1$ and can be invalid otherwise. Moreover a new conjecture was proposed for many values of $r$ beyond $m+1$. In this paper, we prove that this new conjecture holds true for several values of $r$. In particular, this settles the new conjecture completely when $d=3$. Our result also includes the positive result of Datta and Ghorpade as a special case. Further, we determine the maximum number of zeros in certain cases not covered by the earlier conjectures and results, namely, the case of $d=q-1$ and of $d=q$. All these results are directly applicable to the determination of the maximum number of points on sections of Veronese varieties by linear subvarieties of a fixed dimension, and also the determination of generalized Hamming weights of projective Reed-Muller codes.

Full work available at URL: https://arxiv.org/abs/1705.10185

Recommendations

• Counting polynomials with zeros of given multiplicities in finite fields
• Number of solutions of systems of homogeneous polynomial equations over finite fields
• Number of zeros of diagonal polynomials over finite fields
• Counting polynomials with distinct zeros in finite fields
• Counting polynomials with a given number of zeros in a finite field
• On the number of factorizations of polynomials over finite fields
• Nonsingular zeros of polynomials defined over finite fields
• Number of Irreducible Polynomials in Several Variables over Finite Fields
• On common zeros of a pair of quadratic forms over a finite field
• On the number of primitive polynomials over finite fields

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Varieties over finite and local fields (11G25) Polynomials over finite fields (11T06) Rational points (14G05) Combinatorial structures in finite projective spaces (51E20) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Projective Reed-Muller codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• On the number of points of algebraic sets over finite fields
• An upper bound on the number of rational points of arbitrary projective varieties over finite fields
• Title not available (Why is that?)
• An elementary bound for the number of points of a hypersurface over a finite field
• On the number of solutions of polynomial systems
• Number of solutions of systems of homogeneous polynomial equations over finite fields
• Linear sections of the finite Veronese varieties and authentication systems defined using geometry
• On a conjecture of Tsfasman and an inequality of Serre for the number of points of hypersurfaces over finite fields
• Remarks on the Tsfasman-Boguslavsky Conjecture and higher weights of projective Reed-Muller codes

Cited In (7)

• Higher weight spectra of codes from Veronese threefolds
• Vanishing ideals of projective spaces over finite fields and a projective footprint bound
• On a conjecture of Tsfasman and an inequality of Serre for the number of points of hypersurfaces over finite fields
• Arithmetic, Geometry, and Coding Theory: Homage to Gilles Lachaud
• A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
• Projective Reed-Muller type codes on higher dimensional scrolls
• Remarks on the Tsfasman-Boguslavsky Conjecture and higher weights of projective Reed-Muller codes

This page was built for publication: Maximum Number of Common Zeros of Homogeneous Polynomials over Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132780)