Mathematicians crack hidden patterns in parking and forest structures
Researchers have solved a decades-old mathematical puzzle by discovering unexpected connections between two seemingly unrelated systems—parking arrangements and tree-like networks. The breakthrough reveals underlying statistical patterns that could have applications in optimization problems across logistics, network design, and resource allocation.
Originaltitel: Statistics of Parking Functions and Labeled Forests
<p>In this paper we obtain some new results on the enumeration of parking functions and labeled forests. We introduce new statistics both for parking functions and for labeled forests that are connected to each other by means of a bijection. We determine the joint distribution of two statistics on parking functions and their counterparts on labeled forests. Our results on labeled forests also serve to explain the mysterious equidistribution between two seemingly unrelated statistics in parking functions recently identified by Stanley and Yin and give an explicit bijection between the two statistics.</p>