2013/09/16 by Fedor Petrov, Petrov, Fedor
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1309.3935
openalex publication_date 2013/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of |f(A,B)| for finite subsets A, B of a field, and polynomial f(x,y) of the form f(x,y)=g(x)+yh(x), where degree of g is greater then degree of h.