A combinatorial identity for rooted labeled forests

DOI10.1007/S00010-019-00662-9MaRDI QIDQ2307654zbMATH OpenOpenAlexWikidataFDO

Authors Benjamin Hackl

Publication date 25 March 2020

Published in Aequationes Mathematicae (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1902.06627

zbMATH Keywords

combinatorial identityforestHurwitz multinomial identityset partition

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Trees (05C05)

Abstract: 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.

Recommendations

• scientific article; zbMATH DE number 3926929
• A combinatorial identity with applications to forest graphs
• Labeled trees, functions, and an algebraic identity
• A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions

Cites work

• A combinatorial identity with applications to forest graphs
• A Generalisation of a Result of Abel with an Application to Tree Enumerations
• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Introduction to enumerative combinatorics. With a foreword by Richard Stanley

Cited in

(11)

• A family of invariants of rooted forests.
• Rooted forests that avoid sets of permutations
• A combinatorial identity with applications to forest graphs
• scientific article; zbMATH DE number 2186866 (Why is no real title available?)
• Postnikov identities and Seo's formulas
• scientific article; zbMATH DE number 3926929 (Why is no real title available?)
• A combinatorial approach to Golomb forests
• A counting formula for labeled, rooted forests
• Labeled trees, functions, and an algebraic identity
• A new bijection on rooted forests
• q-hook length formulas for signed labeled forests

This page was built for publication: A combinatorial identity for rooted labeled forests

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