Abstract
A 1993 result of Alon and Füredi gives a sharp upper bound on the number of zeros of a multivariate polynomial in a finite grid over an integral domain. We give a generalization of the Alon-Füredi Theorem and discuss the relationship between Alon-Füredi, our generalization and the results of DeMillo-Lipton, Schwartz and Zippel. A direct coding theoretic interpretation of our main result in terms of Reed-Muller type affine variety codes is shown, which gives us the minimum Hamming distance of these codes. We also apply the Alon-Füredi Theorem to quickly recover – and sometimes strengthen – some old and new results in finite geometry.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
