Wojciech Samotij

Wojciech Samotij is a Polish mathematician who works in combinatorics, additive number theory, Ramsey theory and graph theory.

Education and career

He studied at the University of Wrocław where in 2007 he obtained his Master of Science degrees in mathematics and computer science. He received his PhD in 2011 at University of Illinois at Urbana-Champaign on the basis of his dissertation titled Extremal Problems In Pseudo-random Graphs And Asymptotic Enumeration and written under the supervision of József Balogh.[1] Between 2010-2014, he was a fellow of the Trinity College, Cambridge at the University of Cambridge. Currently, he is an associate professor at Tel Aviv University.[2] He published his scientific work in such magazines and papers as "Random Structures & Algorithms", "Journal of the American Mathematical Society" as well as "Israel Journal of Mathematics".

He received the 2013 Kuratowski Prize, the 2013 European Prize in Combinatorics [3] and the 2016 George Pólya Prize.[4]

The typical structure of sparse Kr+1-free graphs (co-written with J. Balogh, R. Morris and L. Warnke); "Transactions of the American Mathematical Society" (2016)
Independent sets in hypergraphs (co-written with J. Balogh and R. Morris); "Journal of the American Mathematical Society" (2015)
A refinement of the Cameron-Erdős conjecture (co-written with N. Alon, J. Balogh and R. Morris); "Proceedings of the London Mathematical Society", (2014)
Counting sum-free sets in Abelian groups, (co-written with N. Alon, J. Balogh and R. Morris); "Israel Journal of Mathematics" (2014)
Odd cutsets and the hard-core model on Zd (co-written with R. Peled); "Annales de l'Institut Henri Poincaré, Probabilités et Statistiques" (2014)
The number of Ks,t-free graphs (co-written with J. Balogh); "Journal of the London Mathematical Society", (2011)

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.