
Recent Posts
Archives
Categories
Blogs I Follow
 A Combinatorics Blog
 all the women
 The Intrepid Mathematician
 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
Category Archives: Combinatorics
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
On a famous pigeonhole problem
After a short break from blogging, which involved moving from Ghent to Berlin, dealing with German bureaucracy, and learning how to make simple websites (the easiest bit), I am now back. I am working as a postdoc at the Free … Continue reading
Posted in Combinatorics, Extremal Combinatorics
Tagged divisionfree sets, extremal problems, Paul Erdos, pigeonhole, Tibor Szabo
5 Comments
What I have learned in finite geometry
On September 2nd, 2014 I wrote a blog post titled learning finite geometry, in which I described how much I have learned in my first year of PhD and more importantly, the topics that I wish to learn while I … Continue reading
Posted in Combinatorics, Finite Geometry, Incidence Geometry, Research Diary
Tagged blocking set, combinatorics, finite geometry, learning, PhD, polar spaces, unitals
Leave a comment
The Cage Problem
I recently finished my research visit to UWA where I worked with John Bamberg and Gordon Royle on some finite geometrical problems related to cages. So this seems like the right time for me to write a blog post about … Continue reading
Posted in Combinatorics, Finite Geometry
Tagged cage, finite geometry, Gordon Royle, Graph Theory, John Bamberg, Moore graphs
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 pointline pairs with the point lying on the line, between finite sets of points and lines … Continue reading