Enumeration of one class of plane weighted trees
Fundamentalʹnaâ i prikladnaâ matematika, Tome 18 (2013) no. 6, pp. 171-184
We present an enumeration formula for weighted trees, i.e., trees where vertices and edges have weights (a weight is a positive integer) and the weight of each vertex is equal to the sum of the weights of the edges incident to it. Each tree has a binary structure: we can color its vertices in two colors, black and white, so that adjacent vertices have different colors. In this work, the following problem is considered: enumerate weighted plane trees with given sets of weights of black and white vertices.
@article{FPM_2013_18_6_a10,
author = {Yu. Yu. Kochetkov},
title = {Enumeration of one class of plane weighted trees},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {171--184},
year = {2013},
volume = {18},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2013_18_6_a10/}
}
Yu. Yu. Kochetkov. Enumeration of one class of plane weighted trees. Fundamentalʹnaâ i prikladnaâ matematika, Tome 18 (2013) no. 6, pp. 171-184. http://geodesic.mathdoc.fr/item/FPM_2013_18_6_a10/
[1] Drëmov V. A., Algebraicheskaya teoriya par Belogo, Dis. $\dots$ kand. fiz.-mat. nauk, MGU, M., 2012
[2] Kochetkov Yu. Yu., “Antivandermondovy sistemy i ploskie derevya”, Funkts. anal. i ego pril., 36:3 (2002), 83–87 | DOI | MR | Zbl
[3] Zvonkin A., Pakovich F., Minimum degree of the difference of two polynomials over $\mathbb Q$ and weighted plane trees, arXiv: 1306.4141