Tag Archives: Jozsef Solymosi

The largest clique in the Paley Graph: unexpected significant progress and surprising connections.

The result on Paley Graphs by Hanson and Petridis On May 2019, Brandon Hanson and Giorgis Petridis posed a paper on the arXive: Refined Estimates Concerning Sumsets Contained in the Roots of Unity. The abstract was almost as short as … Continue reading

Posted in Combinatorics, Number theory | Tagged , , , , , | 2 Comments

Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science

                            May 4 2:30-3:30; May 7 11:00-13:00; May 10 10:30-12:00 See the event webpage for titles and abstracts (or click on the picture below).  

Posted in Combinatorics, Geometry, Updates | Tagged , | Leave a comment