A path forward: Tropicalization in extremal combinatorics
A path forward: Tropicalization in extremal combinatorics
复制标题
前进之路:极值组合的热带化
DOI:
10.1016/j.aim.2022.108561
复制
发表时间:
2022
影响因子:
1.7
通讯作者:
Raymond, Annie
中科院分区:
文献类型:
--
作者:
Blekherman, Grigoriy;Raymond, Annie
Many important problems in extremal combinatorics can be stated as proving a pure binomial inequality in graph homomorphism numbers, ie, proving that hom (H 1, G) a 1⋯ hom (H k, G) a k≥ hom (H k+ 1, G) a k+ 1⋯ hom (H m, G) a m holds for some fixed graphs H 1,…, H m and all graphs G. One prominent example is Sidorenko's conjecture. For a fixed collection of graphs U={H 1,…, H m}, the exponent vectors of valid pure binomial inequalities in graphs of U form a convex cone. We compute this cone for several families of graphs including complete graphs, even cycles, stars and paths; the latter is the most interesting and intricate case that we compute. In all of these cases, we observe a tantalizing polyhedrality phenomenon: the cone of valid pure binomial inequalities is actually rational polyhedral, and therefore all valid pure binomial inequalities can be generated from the finite collection of exponent vectors of the extreme rays. Using the work of Kopparty and Rossman ([17]), we show that the cone of valid inequalities is indeed rational polyhedral when all graphs H i are series-parallel and chordal, and we conjecture that polyhedrality holds for any finite collection U. We demonstrate that the polyhedrality phenomenon also occurs in matroids and simplicial complexes. Our description of the inequalities for paths involves a generalization of the Erdős-Simonovits conjecture recently proved in its original form in [29] and a new family of inequalities not observed previously. We also solve an open problem of Kopparty and Rossman on the homomorphism domination exponent of paths. One of our main tools is tropicalization, a well-known technique in complex algebraic geometry, first applied in extremal combinatorics in [3]. We prove several results about tropicalizations which may be of independent interest.
登录
查看更多内容
DOI:
--
发表时间:
2018
期刊:
International Colloquium on Automata, Languages and Programming
影响因子:
--
作者:
Holger Dell;Martin Grohe;Gaurav Rattan
通讯作者:
Gaurav Rattan
影响因子:
2.5
作者:
Nima Anari;S. Gharan;C. Vinzant
通讯作者:
C. Vinzant
DOI:
10.1090/tran/6487
发表时间:
2013
期刊:
arXiv: Combinatorics
影响因子:
--
作者:
J. Kim;Choongbum Lee;Joonkyung Lee
通讯作者:
Joonkyung Lee
影响因子:
0.9
作者:
M. Develin;B. Sturmfels
通讯作者:
B. Sturmfels
DOI:
--
发表时间:
2019
期刊:
ArXivorg
影响因子:
--
作者:
Hill, Cvetelina;Lamboglia, Sara;Pasley Simon, Faye
通讯作者:
Pasley Simon, Faye