Scaling problems and applications to extremal combinatoricsAlgebra & Discrete Mathematics
|Speaker:||Rafael Oliveira, University of Toronto|
|Start time:||Mon, Jan 28 2019, 12:10PM|
Scaling problems and their algorithms have recently found a myriad of applications in different areas of mathematics, such as in extremal combinatorics (quantitative generalizations of the Sylvester-Gallai theorem), invariant theory (the null cone problem for matrix semi-invariants), functional analysis (the Brascamp-Lieb inequalities), non-commutative algebra (the word problem for free-skew fields) and many others.
In this talk, we will first define scaling problems and then discuss some of the structural theory behind them. After that, we will elaborate on the applications of this structural theory to problems in extremal combinatorics, in particular discussing how such scaling problems can give us quantitative generalizations of the Sylvester-Gallai theorem.
The talk is based on joint work with Zeev Dvir, Ankit Garg, and Joseph Solymosi.