Number of solutions of systems of homogeneous polynomial equations over finite fields
HTML articles powered by AMS MathViewer
- by Mrinmoy Datta and Sudhir R. Ghorpade
- Proc. Amer. Math. Soc. 145 (2017), 525-541
- DOI: https://doi.org/10.1090/proc/13239
- Published electronically: October 27, 2016
- PDF | Request permission
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.References
- M. Boguslavsky, On the number of solutions of polynomial systems, Finite Fields Appl. 3 (1997), no. 4, 287–299. MR 1478830, DOI 10.1006/ffta.1997.0186
- Alain Couvreur, An upper bound on the number of rational points of arbitrary projective varieties over finite fields, Proc. Amer. Math. Soc. 144 (2016), no. 9, 3671–3685. MR 3513530, DOI 10.1090/proc/13015
- Mrinmoy Datta, Rational points of linear sections of algebraic varieties over finite fields and higher weights of linear codes, Ph.D. Thesis, Indian Institute of Technology Bombay, 2016.
- Mrinmoy Datta and Sudhir R. Ghorpade, On a conjecture of Tsfasman and an inequality of Serre for the number of points of hypersurfaces over finite fields, Mosc. Math. J. 15 (2015), no. 4, 715–725. MR 3438829, DOI 10.17323/1609-4514-2015-15-4-715-725
- Mrinmoy Datta and Sudhir R. Ghorpade, Remarks on Tsfasman-Boguslavsky Conjecture and higher weights of projective Reed-Muller codes, Arithmetic, Geometry, Cryptography and Coding Theory (Luminy, France, May 2015), A. Bassa, A. Couvreur and D. Kohel Eds., Contemp. Math., Amer. Math. Soc., Providence, to appear.
- Sudhir R. Ghorpade and Gilles Lachaud, Hyperplane sections of Grassmannians and the number of MDS linear codes, Finite Fields Appl. 7 (2001), no. 4, 468–506. MR 1866340, DOI 10.1006/ffta.2000.0299
- Sudhir R. Ghorpade and Gilles Lachaud, Étale cohomology, Lefschetz theorems and number of points of singular varieties over finite fields, Mosc. Math. J. 2 (2002), no. 3, 589–631. Dedicated to Yuri I. Manin on the occasion of his 65th birthday. MR 1988974, DOI 10.17323/1609-4514-2002-2-3-589-631
- Sartaj Ul Hasan, Primitive recursive vector sequences, polynomial systems and determinantal codes over finite fields, Ph.D. Thesis, Indian Institute of Technology Bombay, 2009.
- Petra Heijnen and Ruud Pellikaan, Generalized Hamming weights of $q$-ary Reed-Muller codes, IEEE Trans. Inform. Theory 44 (1998), no. 1, 181–196. MR 1486657, DOI 10.1109/18.651015
- Gilles Lachaud, The parameters of projective Reed-Muller codes, Discrete Math. 81 (1990), no. 2, 217–221 (English, with French summary). MR 1054981, DOI 10.1016/0012-365X(90)90155-B
- Gilles Lachaud and Robert Rolland, On the number of points of algebraic sets over finite fields, J. Pure Appl. Algebra 219 (2015), no. 11, 5117–5136 (English, with English and French summaries). MR 3351576, DOI 10.1016/j.jpaa.2015.05.008
- Dany-Jack Mercier and Robert Rolland, Polynômes homogènes qui s’annulent sur l’espace projectif $\textrm {P}^m(\textbf {F}_q)$, J. Pure Appl. Algebra 124 (1998), no. 1-3, 227–240 (French, with French summary). MR 1600301, DOI 10.1016/S0022-4049(96)00104-1
- Jean-Pierre Serre, Lettre à M. Tsfasman, Astérisque 198-200 (1991), 11, 351–353 (1992) (French, with English summary). Journées Arithmétiques, 1989 (Luminy, 1989). MR 1144337
- Anders Bjært Sørensen, Projective Reed-Muller codes, IEEE Trans. Inform. Theory 37 (1991), no. 6, 1567–1576. MR 1134296, DOI 10.1109/18.104317
- Corrado Zanella, Linear sections of the finite Veronese varieties and authentication systems defined using geometry, Des. Codes Cryptogr. 13 (1998), no. 2, 199–212. MR 1600208, DOI 10.1023/A:1008286614783
Bibliographic Information
- Mrinmoy Datta
- Affiliation: Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India
- Address at time of publication: Department of Applied Mathematics and Computer Science, Technical University of Denmark, DK 2800, Kgs. Lyngby, Denmark
- MR Author ID: 1120609
- ORCID: 0000-0003-1138-0953
- Email: mrinmoy.dat@gmail.com
- Sudhir R. Ghorpade
- Affiliation: Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India
- MR Author ID: 306883
- ORCID: 0000-0002-6516-3623
- Email: srg@math.iitb.ac.in
- Received by editor(s): July 17, 2015
- Received by editor(s) in revised form: April 12, 2016
- Published electronically: October 27, 2016
- Additional Notes: The first author was partially supported by a doctoral fellowship from the National Board for Higher Mathematics, a division of the Department of Atomic Energy, Government of India.
The second author was partially supported by Indo-Russian project INT/RFBR/P-114 from the Department of Science & Technology, Government of India, and IRCC Award grant 12IRAWD009 from IIT Bombay. - Communicated by: Matthew A. Papanikolas
- © Copyright 2016 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 145 (2017), 525-541
- MSC (2010): Primary 14G15, 11T06, 11G25, 14G05; Secondary 51E20, 05B25
- DOI: https://doi.org/10.1090/proc/13239
- MathSciNet review: 3577858