Tensor-amplification framework proves equality regularization and spectral equivalence for C-Sidorenko graphs in admissible graphon classes.
On the logarithimic calculus and Sidorenko's conjecture
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration of the method we verify the conjecture of Erd\"os-Simonovits and Sidorenko for new families of graphs. In particular we give a short analytic proof for a result by Conlon, Fox and Sudakov. Using this, we prove the forcing conjecture for bipartite graphs in which one vertex is complete to the other side.
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.
citing papers explorer
-
Tensor Amplification and Spectral Transfer for Sidorenko-Type Inequalities
Tensor-amplification framework proves equality regularization and spectral equivalence for C-Sidorenko graphs in admissible graphon classes.