Iteration entropy

Por • 11 dic, 2017 • Sección: Opinion

Joachim von zur Gathen

We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to 2 log_2(n) minus the entropy of the vector of its cycle lengths. For general functions, a similar approximation holds.

arXiv:1712.01407v1 [math.NT]

Number Theory (math.NT)

Post to Twitter

Escribe un comentario