# On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs

### Abstract

Suppose that you have $n$ colours and $m$ mutually independent dice, each of which has $r$ sides. Each dice lands on any of its sides with equal probability. You may colour the sides of each die in any way you wish, but there is one restriction: you are not allowed to use the same colour more than once on the sides of a die. Any other colouring is allowed. Let $X$ be the number of different colours that you see after rolling the dice. How should you colour the sides of the dice in order to maximize the Shannon entropy of $X$? In this article we investigate this question. It is shown that the entropy of $X$ is at most $\frac{1}{2} \log(n) + \frac{1}{2}\log(\pi e)$ and that the bound is tight, up to a constant additive factor, in the case of there being equally many coins and colours. Our proof employs the differential entropy bound on discrete entropy, along with a lower bound on the entropy of binomial random variables whose outcome is conditioned to be an even integer. We conjecture that the entropy is maximized when the colours are distributed over the sides of the dice as evenly as possible.

Copyright (c) 2019 Christos Pelekis

This work is licensed under a Creative Commons Attribution 4.0 International License.

The authors retain all rights to the original work without any restrictions.

#### License for Published Contents

"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).

#### License for Metadata

"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.

You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

#### No Fee Charging

No fee is required to complete the submission/review/publishing process of authors paper.