Enumeration of trees by inversions

DOI10.1002/JGT.3190190402MaRDI QIDQ4842701zbMATH OpenOpenAlexFDO

Authors Ira M. Gessel, Bruce E. Sagan, Yeong-Nan Yeh

Publication date 16 August 1995

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190190402

zbMATH Keywords

asymptotic formulaebinomial coefficient identitiesenumerationgenerating functionhypergeometric seriesinversion polynomialLagrange inversiontrees

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Trees (05C05) Enumeration in graph theory (05C30) Generalized hypergeometric series, ({}_pF_q) (33C20)

Recommendations

• Inversion of integral series enumerating planar trees
• Enumeration problems of trees
• Enumeration of binary trees
• Enumerating spanning trees of graphs with an involution
• Enumerating alternating trees
• Inverses of trees
• A bijective enumeration of tiered trees
• Enumeration on trees under relabelings
• scientific article; zbMATH DE number 123394
• Enumeration of subtrees of trees

Cites work

• scientific article; zbMATH DE number 50660 (Why is no real title available?)
• scientific article; zbMATH DE number 3016223 (Why is no real title available?)
• scientific article; zbMATH DE number 3219699 (Why is no real title available?)
• Nombres d'Euler et inversions dans les arbres
• On the Altitude of Nodes in Random Trees

Cited in

(29)

• Inverses of trees
• The pessimistic search and the straightening involution for trees
• Enumerative applications of a decomposition for graphs and digraphs
• Resolutions for \(S_ n\)-modules, associated with rim hooks, and combinatorial applications
• Limiting distributions for the number of inversions in labelled tree families
• Embedding small digraphs and permutations in binary trees and split trees
• Shellability of generalized Dowling posets
• Shellability of posets of labeled partitions and arrangements defined by root systems
• An involution on increasing trees
• A unifying approach for proving hook-length formulas for weighted tree families
• A generalization of the results of Kreweras on the enumeration polynomial of inversions in arborescences
• Integral Representation and Algorithms for Closed Form Summation
• Parking functions and tree inversions revisited
• Asymptotic properties of the inversion number in colored trees
• An involution on \(\beta (1,0)\)-trees
• scientific article; zbMATH DE number 58845 (Why is no real title available?)
• scientific article; zbMATH DE number 6928770 (Why is no real title available?)
• On the inverse and the dual index of a tree
• Inversions in split trees and conditional Galton-Watson trees
• Pattern restricted quasi-Stirling permutations
• Inversions in split trees and conditional Galton-Watson trees
• Minimax trees and André polynomials
• Generalized parking functions, tree inversions, and multicolored graphs
• A refined enumeration of hex trees and related polynomials
• Five classes of pattern avoiding inversion sequences under one roof: generating trees
• Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
• Tree enumeration polynomials on separable permutations
• On Ward numbers and increasing Schröder trees
• Inversion of integral series enumerating planar trees

This page was built for publication: Enumeration of trees by inversions

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