Counting Line-Colored D-ary Trees

arXiv1206.4203MaRDI QIDQ6233785FDOQ6233785

Publication date: 19 June 2012

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

D

and lines colored by a number

i

from 1 to

D

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

p_{i}

lines of color

i

is

.

This page was built for publication: Counting Line-Colored D-ary Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233785)