
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
 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
 mathbabe
Category Archives: Incidence Geometry
Bound on Ramsey numbers from finite geometry
In an earlier post I talked about the work of Mubayi and Verstraete on determining the offdiagonal Ramsey numbers via certain optimal pseudorandom graphs, which are not yet known to exist except for the case of triangles. Beyond this conditional … Continue reading
Ryser’s conjecture
I am on a research visit in Rome, working with Valentina Pepe, and our joint paper on Ryser’s conjecture is on arXiv now. So this seems like the right time to talk about the conjecture and the problems related to … Continue reading
Wenger graphs
A central (and foundational) question in extremal graph theory is the forbidden subgraph problem of Turán, which asks for the largest number of edges in an vertex graph that does not contain any copy of a given graph as its … 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
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