Jozsef Balogh,
Dingding Dong,
Bernard Lidicky,
and Annie Raymond
Original Announcement
This workshop will be devoted to further developing the method of flag algebras and its applications. Flag algebras, developed by Razborov in 2007, allows one to solve problems in combinatorics via streamlined calculations that combine elements from computer engineering and optimization. It led to many recent breakthroughs on long-standing open problems of Erdős, Sós, Turán, Gromov and Zarankiewicz, to name a few. The technique is versatile and can be applied in other settings than graphs and hypergraphs including permutations, oriented graphs, point sets, embedded graphs, and phylogenetic trees.
The main topics for this workshop are:
Applications of flag algebras to topics in combinatorics, such as hypergraph Turán problems, rainbow Turán problems and Sidorenko's conjecture.
Better understanding the strengths and limitations of flag algebras, e.g., to prove inequalities that generate all valid inequalities of a certain form and to find classes of problems that cannot be solved with the method.
Obtaining proofs by flag algebras which are not using computers.
