Combinatorial families of multilabelled increasing trees and hook-length formulas

DOI10.1016/J.DISC.2015.08.010MaRDI QIDQ501056zbMATH OpenOpenAlexFDO

Authors Markus Kuba, Alois Panholzer

Publication date 8 October 2015

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bilabelled treesdifferential equationselliptic functionshook-length formulasincreasing treesmultilabelled treesWeierstrass-\(\wp\) function

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in the tree can get multiple labels. For all tree classes we show characterizations of suitable generating functions for the tree enumeration sequence via differential equations. Furthermore, for several combinatorial classes of multilabelled increasing tree families we present explicit enumeration results. We also present multilabelled increasing tree families of an elliptic nature, where the exponential generating function can be expressed in terms of the Weierstrass-p function or the lemniscate sine function. Furthermore, we show how to translate enumeration formulas for multilabelled increasing trees into hook-length formulas for trees and present a general "reverse engineering" method to discover hook-length formulas associated to such tree families.

Recommendations

• Bilabelled increasing trees and hook-length formulae
• A multivariate hook formula for labelled trees
• An edge-weighted hook formula for labelled trees
• A unifying approach for proving hook-length formulas for weighted tree families
• Generating functions for multi-labeled trees

Cites work

• A Combinatorial Interpretation for the Schett Recurrence on the Jacobian Elliptic Functions
• A multivariate hook formula for labelled trees
• A refinement of Cayley's formula for trees
• A unifying approach for proving hook-length formulas for weighted tree families
• Alternating permutations and binary increasing trees
• An analytic approach for the analysis of rotations in fringe-balanced binary search trees
• Analytic combinatorics
• Analytic urns
• Bilabelled increasing trees and hook-length formulae
• Combinatorial aspects of continued fractions
• Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
• Discovering hook length formulas by an expansion technique
• Elliptic functions and modular forms
• Elliptic functions, continued fractions and doubled permutations
• Embedded trees and the support of the ISE
• Generalized Stirling permutations, families of increasing trees and urn models
• Hook length formulas for trees by Han's expansion
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 3536107 (Why is no real title available?)
• scientific article; zbMATH DE number 1409903 (Why is no real title available?)
• Increasing trees and alternating permutations
• On monotone functions of tree structures
• On Postnikov's hook length formula for binary trees
• On the degree distribution of the nodes in increasing trees
• Permutohedra, Associahedra, and Beyond
• Random trees between two walls: exact partition function
• The \(r\)-multipermutations
• The Blasius Function in the Complex Plane
• The doubloon polynomial triangle
• Two kinds of hook length formulas for complete \(m\)-ary trees
• Une approche combinatoire des fonctions elliptiques de Jacobi
• Une interpretation combinatoire des coefficients des développements en série entière des fonctions elliptiques de Jacobi

Cited in

(11)

• A multivariate hook formula for labelled trees
• Weakly increasing trees on a multiset
• A unifying approach for proving hook-length formulas for weighted tree families
• On bucket increasing trees, clustered increasing trees and increasing diamonds
• Tree evolution processes for bucket increasing trees
• Bilabelled increasing trees and hook-length formulae
• Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
• A note on plane trees with decreasing labels
• Thron-type continued fractions (T-fractions) for some classes of increasing trees
• q-hook length formulas for signed labeled forests
• Periodic Pólya urns, the density method and asymptotics of Young tableaux

Describes a project that uses

Uses Software

• OEIS
• HookExp

This page was built for publication: Combinatorial families of multilabelled increasing trees and hook-length formulas

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