On multivariate polynomials with many roots over a finite grid

DOI10.1142/S021949882150136XzbMath1478.11145arXiv1909.06613OpenAlexW3045169190MaRDI QIDQ5157742

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 fieldvarietymultivariate polynomialrootfootprint boundfinite grid

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• On the structure of generalized toric codes
• A probabilistic remark on algebraic program testing
• Weighted Reed-Muller codes revisited
• Affine Cartesian codes
• On the parameters of \(r\)-dimensional toric codes
• A note on Hermitian codes over GF(q/sup 2/)
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Weighted Reed-Muller codes and algebraic-geometric codes
• Combinatorial Nullstellensatz
• Footprints or generalized Bezout's theorem
• Polynomial weights and code constructions
• On generalized ReedMuller codes and their relatives