On Zeros of a Polynomial in a Finite Grid

DOI10.1017/S0963548317000566zbMath1388.05198arXiv1508.06020OpenAlexW2963350742MaRDI QIDQ4635504

John R. Schmitt, Aditya Potukuchi, Anurag Bishnoi, Pete L. Clark

Publication date: 23 April 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Blocking sets, ovals, (k)-arcs (51E21) Polynomials over finite fields (11T06) Combinatorial structures in finite projective spaces (51E20) Combinatorial aspects of commutative algebra (05E40)

Related Items (16)

Graph polynomials and group coloring of graphs ⋮ Polynomials over structured grids ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ An isogeny-based ID protocol using structured public keys ⋮ Chevalley-Warning at the boundary ⋮ Covering almost all the layers of the hypercube with multiplicities ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Polynomials that vanish to high order on most of the hypercube ⋮ Covering grids with multiplicity ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ On Zeros of a Polynomial in a Finite Grid ⋮ Minimum distance functions of complete intersections ⋮ On the Alon-Füredi bound ⋮ Uncertainty in finite planes ⋮ Decoupling for moment manifolds associated to Arkhipov-Chubarikov-Karatsuba systems ⋮ Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives

Cites Work

• Unnamed Item
• Unnamed Item
• The Combinatorial Nullstellensätze revisited
• More results on the number of zeros of multiplicity at least \(r\)
• Punctured combinatorial Nullstellensätze
• Erratum. Punctured combinatorial Nullstellensätze
• How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
• Partial covers of \(\mathrm{PG}(n, q)\)
• On the second weight of generalized Reed-Muller codes
• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• Colorings and orientations of graphs
• Covering the cube by affine hyperplanes
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• A probabilistic remark on algebraic program testing
• Warning's second theorem with restricted variables
• Démonstration d'une hypothèse de M. Artin
• Bemerkung zur vorstehenden Arbeit von Herrn Chevalley
• Weighted Reed-Muller codes revisited
• Affine Cartesian codes
• On the second Hamming weight of some Reed-Muller type codes
• Covering Numbers in Linear Algebra
• Blocking Sets in Desarguesian Projective Planes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• On Zeros of a Polynomial in a Finite Grid
• Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
• On generalized ReedMuller codes and their relatives

This page was built for publication: On Zeros of a Polynomial in a Finite Grid