Year: 2014
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Galvin, David
Institution: University of Notre Dame
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Security Agency
Awards: G4066324520, G7845798442
OpenAlex ID: W1593988169