An information theoretic approach to Sidorenko's conjecture
read the original abstract
We investigate the famous conjecture by Erd\H os-Simonovits and Sidorenko using information theory. Our method gives a unified treatment for all known cases of the conjecture and it implies various new results as well. Our topological type conditions allow us to extend Sidorenko's conjecture to large families of $k$-uniform hypergraphs. This is somewhat unexpected since the conjecture fails for $k$ uniform hypergraphs in general.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Sidorenko-Inspired Pessimistic Estimation
Caterpillar-based homomorphism counts yield pessimistic join size estimates that overestimate by roughly m to the power 3/5 in simulations, improving on prior star and bi-star exponents.
-
Mathematical exploration and discovery at scale
AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.