On multivariate polynomials with many roots over a finite grid

DOI10.1142/S021949882150136XMaRDI QIDQ5157742zbMATH OpenOpenAlexFDO

Authors Olav Geil

Publication date 20 October 2021

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldfinite gridfootprint boundmultivariate polynomialrootvariety

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Varieties over finite and local fields (11G25) Polynomials (irreducibility, etc.) (11R09) Polynomials over finite fields (11T06)

Abstract: In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the number of roots, and this bound is sharp in that it can always be attained by trivial polynomials being a constant times a product of an appropriate combination of terms consisting of a variable minus a constant. In contrast to the one variable case, there are multivariate polynomials attaining the footprint bound being not of the above form. This even includes irreducible polynomials. The purpose of the note is to determine a large class of polynomials for which only the mentioned trivial polynomials can attain the bound, implying that to search for other polynomials with the maximal number of roots one must look outside this class.

Recommendations

• On zeros of a polynomial in a finite grid
• Roots and coefficients of multivariate polynomials over finite fields
• Extremal polynomials on the \(n\)-grid
• On Integer Polynomials with Multiple Roots
• Polynomials over structured grids
• Some conjectures on multivariate polynomial matrices
• Multiplicity hunting and approximating multiple roots of polynomial systems
• On multivariate interpolation by generalized polynomials on subsets of grids
• On multiplicities in polynomial system solving

Cites work

• A note on Hermitian codes over GF(q/sup 2/)
• A probabilistic remark on algebraic program testing
• Affine Cartesian codes
• Algebraic function fields and codes
• Combinatorial Nullstellensatz
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Footprints or generalized Bezout's theorem
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 125903 (Why is no real title available?)
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 2081133 (Why is no real title available?)
• scientific article; zbMATH DE number 1756454 (Why is no real title available?)
• On generalized ReedMuller codes and their relatives
• On the parameters of r-dimensional toric codes
• On the structure of generalized toric codes
• Polynomial weights and code constructions
• Weighted Reed-Muller codes and algebraic-geometric codes
• Weighted Reed-Muller codes revisited

Cited in

(5)

• Many order types on integer grids of polynomial size
• More results on the number of zeros of multiplicity at least \(r\)
• Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives
• Polynomials over structured grids
• Considerate ramp secret sharing

This page was built for publication: On multivariate polynomials with many roots over a finite grid

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