
Recent Posts
Archives
 January 2020 (2)
 December 2019 (1)
 September 2019 (1)
 July 2019 (1)
 May 2019 (1)
 September 2018 (1)
 April 2018 (1)
 March 2018 (1)
 November 2017 (2)
 August 2017 (2)
 July 2017 (1)
 April 2017 (2)
 September 2016 (1)
 July 2016 (1)
 May 2016 (2)
 December 2015 (1)
 October 2015 (1)
 August 2015 (2)
 June 2015 (1)
 May 2015 (1)
 April 2015 (1)
 March 2015 (4)
 January 2015 (1)
 September 2014 (3)
 August 2014 (1)
 July 2012 (3)
Categories
 Coding Theory (1)
 Combinatorics (29)
 Extremal Combinatorics (10)
 Ramsey Theory (1)
 Spectral Graph Theory (6)
 Conferences (1)
 Finite Geometry (21)
 Incidence Geometry (9)
 Number Theory (1)
 Polynomial Method (13)
 Real Analysis (1)
 References (1)
 Research Diary (1)
Blogs I Follow
 Radimentary
 Cosmin Pohoata
 Sleepless in Seattle
 Bloag
 Jagriti is professoring
 Math3ma
 Aparajita's blog
 The Intrepid Mathematician
 Ratio Bound – A Combinatorics Blog
 all the women
 ellipticnews
 Becoming My Better Self
 Points And Lines
 Some Plane Truths
 Gentzen translated
 E. Kowalski's blog
 Quomodocumque
 Short, Fat Matrices
 Combinatorics and more
 Yufei Zhao
 Abhishek Khetan
 urduwallahs
 Gaurish4Math
 Jerusalem Combinatorics Seminar
 Personal Blog
 The value of the variable
 Uniformly at Random
 The Same Name for Different Things
 Theoretical Physics and Related Math
 in theory
Category Archives: Polynomial Method
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
Introduction to polynomial method
(The following is a blogfriendly version of Chapter 7 of my PhD thesis, which is an introduction to the socalled polynomial method.) The polynomial method is an umbrella term for different techniques involving polynomials which have been used to solve … Continue reading
The coefficient formula and ChevalleyWarning
We discuss the new simultaneous generalization of ChevalleyWarning and Morlaye’s result on polynomial equations over finite fields obtained by Pete Clark. Continue reading
Applications of AlonFuredi to finite geometry
In a previous post I discussed how the AlonFuredi theorem serves as a common generalisation of the results of Schwartz, DeMillo, Lipton and Zippel. Here I will show some nice applications of this theorem to finite geometry (reference: Section 6 of my … Continue reading
Posted in Combinatorics, Finite Geometry, Polynomial Method
Tagged AlonFuredi, blocking set, polynomials
Leave a comment
The EllenbergGijswijt bound on cap sets
Four days back Jordan Ellenberg posted the following on his blog: Briefly: it seems to me that the idea of the CrootLevPach paper I posted about yesterday can indeed be used to give a new bound on the size of subsets … Continue reading
Posted in Combinatorics, Finite Geometry, Polynomial Method
Tagged capset, Dion Gijswijt, Ernie Croot, Jordan Ellenberg, Peter Pach, Seva Lev
6 Comments
The ErdősGinzburgZiv theorem
Let be a sequence of integers (not necessarily distinct). Then there exists a subsequence of the sum of whose elements is divisible by . This is one of the first problems I saw when learning the pigeonhole principle. And it’s … Continue reading
Posted in Combinatorics, Polynomial Method
Tagged additivecombinatorics, AlonFuredi, combinatorics, polynomials
8 Comments
AlonFuredi, SchwartzZippel, DeMilloLipton 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 AlonFuredi, combinatorics, finite fields, polynomials
3 Comments
A timeline of the polynomial method upto combinatorial nullstellensatz
Over the past 3040 years, the socalled 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 combinatorics, finite fields, finite geometry, polynomials
1 Comment
On Zeros of a Polynomial in a Finite Grid: the AlonFuredi 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 ChevalleyWarning theorem using something known as … Continue reading
Posted in Combinatorics, Finite Geometry, Polynomial Method
Tagged AlonFuredi, combinatorics, finite fields, polynomials
4 Comments
ChevalleyWarning Theorem and Blocking Sets
The classical ChevalleyWarning 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