Cargando…
A combinatorial identity for rooted labeled forests
In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes and multinomial identities are given.
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2019
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7357680/ https://www.ncbi.nlm.nih.gov/pubmed/32684636 http://dx.doi.org/10.1007/s00010-019-00662-9 |
| Sumario: | In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes and multinomial identities are given. |
|---|