Counting Line-Colored D-ary Trees
Valentin Bonzom, Razvan Gurau

TL;DR
This paper studies a generating function for counting specific colored rooted trees related to tensor models, providing an explicit formula for the number of such trees with given color distributions.
Contribution
It introduces an independent method to derive a closed-form formula for counting line-colored D-ary trees with specified edge counts per color.
Findings
Derived an explicit formula for the number of line-colored D-ary trees with given color counts.
Connected the combinatorial enumeration to observables in tensor models.
Provided a new proof technique for counting these specialized trees.
Abstract
Random tensor models are generalizations of matrix models which also support a 1/N expansion. The dominant observables are in correspondence with some trees, namely rooted trees with vertices of degree at most and lines colored by a number from 1 to such that no two lines connecting a vertex to its descendants have the same color. In this Letter we study by independent methods a generating function for these observables. We prove that the number of such trees with exactly lines of color is .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Random Matrices and Applications
