Canonical Trees, Compact Prefix-free Codes and Sums of Unit Fractions: A Probabilistic Analysis
Number Theory
2015-09-16 v2 Combinatorics
Probability
Abstract
For fixed , we consider the class of representations of as sum of unit fractions whose denominators are powers of or equivalently the class of canonical compact -ary Huffman codes or equivalently rooted -ary plane "canonical" trees. We study the probabilistic behaviour of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the path length (normal distribution), the width (main term of the expectation and concentration property) and the number of leaves at maximum distance from the root (discrete distribution).
Keywords
Cite
@article{arxiv.1503.08791,
title = {Canonical Trees, Compact Prefix-free Codes and Sums of Unit Fractions: A Probabilistic Analysis},
author = {Clemens Heuberger and Daniel Krenn and Stephan Wagner},
journal= {arXiv preprint arXiv:1503.08791},
year = {2015}
}