Entropy methods in combinatorics
Combinatorics
2026-07-27 v1
Abstract
Even though entropy methods have been used in combinatorics for at least five decades, only in recent years has their use really proliferated. There are now tens, if not hundreds, of combinatorial papers that crucially rely on the notion of entropy and exploit the various powerful identities and inequalities relating entropies. In this short survey article, we give a selective overview of these works and discuss several of them in more detail, outlining some of the key ideas.
Cite
@article{arxiv.2607.24414,
title = {Entropy methods in combinatorics},
author = {Wojciech Samotij},
journal= {arXiv preprint arXiv:2607.24414},
year = {2026}
}
Comments
19 pages; a survey for the ICM