Three tutorial lectures on entropy and counting
David Galvin

TL;DR
This paper provides an accessible explanation of entropy for discrete variables, illustrating its use in combinatorial enumeration and discussing open questions in the field.
Contribution
It introduces entropy concepts with examples and explores their application in counting problems, offering insights for both beginners and researchers.
Findings
Entropy helps in counting and enumeration tasks.
Basic properties of entropy are derived and explained.
Open questions in entropy and combinatorics are discussed.
Abstract
We explain the notion of the {\em entropy} of a discrete random variable, and derive some of its basic properties. We then show through examples how entropy can be useful as a combinatorial enumeration tool. We end with a few open questions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Markov Chains and Monte Carlo Methods · Computability, Logic, AI Algorithms
