Decomposition of triply rooted trees (Q1953487): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On Finding Lowest Common Ancestors in Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3669422 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Une théorie combinatoire des séries formelles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An identity conjectured by Lacasse via the tree function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5589310 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple proof of an identity of Lacasse / rank | |||
Normal rank |
Latest revision as of 11:38, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decomposition of triply rooted trees |
scientific article |
Statements
Decomposition of triply rooted trees (English)
0 references
7 June 2013
0 references
Summary: In this paper, we give a decomposition of triply rooted trees into three doubly rooted trees. This leads to a combinatorial interpretation of an identity conjectured by \textit{A. Lacasse} [Bornes PAC-Bayes et algorithmes d'apprentissage. Quebec: Universite Laval (Dissertation) (2010)] in the study of the PAC-Bayesian machine learning theory, and proved by \textit{M. Younsi} [``Proof of a combinatorial conjecture coming from the PAC-Bayesian machine learning theory'', Preprint, \url{arXiv:1209.0824}] by using the Hurwitz identity on multivariate Abel polynomials. We also give a bijection between the set of functions from \([n+1]\) to \([n]\) and the set of triply rooted trees on \([n]\), which leads to the refined enumeration of functions from \([n+1]\) to \([n]\) with respect to the number of elements in the orbit of \(n+1\) and the number of periodic points.
0 references
doubly rooted tree
0 references
triply rooted tree
0 references
bijection
0 references