Tag Archives: finite fields

The footprint bound

Studying the set of common zeros of systems of polynomial equations is a fundamental problem in algebra and geometry. In this post we will look at estimating the cardinality of the set of common zeros, when we already know that … Continue reading

Posted in Coding Theory, Combinatorics, Polynomial Method | Tagged , , , , , , , | Leave a comment

The coefficient formula and Chevalley-Warning

We discuss the new simultaneous generalization of Chevalley-Warning and Morlaye’s result on polynomial equations over finite fields obtained by Pete Clark. Continue reading

Posted in Number Theory, Polynomial Method | Tagged , , , , , , | 2 Comments

Incidence Bounds and Interlacing Eigenvalues

The Szemerédi–Trotter theorem is one of the central results in discrete geometry which gives us a (tight) bound on the number of incidences, i.e., the number of point-line pairs with the point lying on the line, between finite sets of points and lines … Continue reading

Posted in Combinatorics, Finite Geometry, Incidence Geometry, Spectral Graph Theory | Tagged , , , , , , | 3 Comments

Alon-Furedi, Schwartz-Zippel, DeMillo-Lipton and their common generalization

In the post Balls in Bins I wrote about a combinatorial function which denotes the minimum value of the product among all distributions of balls (so ) in bins with the constraints . It turns out that this combinatorial function is linked … Continue reading

Posted in Combinatorics, Polynomial Method | Tagged , , , | 3 Comments

A timeline of the polynomial method up-to combinatorial nullstellensatz

Over the past 30-40 years, the so-called polynomial method has developed into a powerful tool in combinatorics and (additive) number theory. There has been a lot of recent interest in it after Dvir’s  paper on the Kakeya conjecture, where he … Continue reading

Posted in Combinatorics, Finite Geometry, Polynomial Method | Tagged , , , | 1 Comment

On Zeros of a Polynomial in a Finite Grid: the Alon-Furedi bound

My joint paper with Aditya Potukuchi, Pete L. Clark and John R. Schmitt is now up on arXiv: arXiv:1508.06020. This work started a few months back when I emailed Pete and John, pointing out an easy generalization of Chevalley-Warning theorem using something known as … Continue reading

Posted in Combinatorics, Finite Geometry, Polynomial Method | Tagged , , , | 4 Comments

Chevalley-Warning Theorem and Blocking Sets

The classical Chevalley-Warning theorem gives us a sufficient condition for a system of polynomial equations over a finite field to have common solutions. Affine blocking sets are sets of points in an affine geometry (aka affine space) that intersect every hyperplane. … Continue reading

Posted in Polynomial Method | Tagged , , | Leave a comment