Tag Archives: Zimin words

Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words

Posted on January 11, 2018 by Gil Kalai

I heard a lecture by Benny Sudakov on the remarkable paper Tower-type bounds for unavoidable patterns in words, by David Conlon, Jacob Fox, and Benny Sudakov. Here are the slides, and let me let the slides speak for themselves. The problem Advertisements

Posted in Combinatorics | Tagged Benny Sudakov, David Conlon, Jacob Fox, Zimin words | Leave a comment

	vznvzn on Dan Romik on the Riemann zeta…
	Are Natural Mathemat… on An Invitation to a Conference:…
	Dan Romik on the Rie… on Dan Romik Studies the Riemann…
	Gil Kalai on Dan Romik Studies the Riemann…
	Matt Baker on Imre Bárány: Limit shape
	Itai Benjamini and J… on Hardness of Approximating Vert…
	Itai Benjamini and J… on Must-read book by Avi Wig…
	Gil Kalai on Hardness of Approximating Vert…
	Tools and Sensitivit… on Amazing: Hao Huang Proved the…
	La optimización de t… on A sensation in the morning new…
	Joseph Malkevitch on Imre Bárány: Limit shape
	Un matemático ruso d… on A sensation in the morning new…

Tag Archives: Zimin words

Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives