Three tutorial lectures on entropy and counting
Combinatorics
2014-07-01 v1
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.
Keywords
Cite
@article{arxiv.1406.7872,
title = {Three tutorial lectures on entropy and counting},
author = {David Galvin},
journal= {arXiv preprint arXiv:1406.7872},
year = {2014}
}
Comments
Notes prepared to accompany a series of tutorial lectures given by the author at the 1st Lake Michigan Workshop on Combinatorics and Graph Theory, Western Michigan University, March 15--16 2014