Pages that link to "Item:Q4842701"
From MaRDI portal
The following pages link to Enumeration of trees by inversions (Q4842701):
Displaying 14 items.
- Parking functions and tree inversions revisited (Q308986) (← links)
- The pessimistic search and the straightening involution for trees (Q1266368) (← links)
- Enumerative applications of a decomposition for graphs and digraphs (Q1893989) (← links)
- Limiting distributions for the number of inversions in labelled tree families (Q1929740) (← links)
- Embedding small digraphs and permutations in binary trees and split trees (Q2292861) (← links)
- Shellability of generalized Dowling posets (Q2299615) (← links)
- Shellability of posets of labeled partitions and arrangements defined by root systems (Q2327229) (← links)
- A unifying approach for proving hook-length formulas for weighted tree families (Q2637731) (← links)
- Integral Representation and Algorithms for Closed Form Summation (Q3053877) (← links)
- Inversions in split trees and conditional Galton--Watson trees (Q4993537) (← links)
- Pattern restricted quasi-Stirling permutations (Q5197606) (← links)
- Inversions in Split Trees and Conditional Galton–Watson Trees (Q5222541) (← links)
- Generalized parking functions, tree inversions, and multicolored graphs (Q5956786) (← links)
- Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials (Q6115210) (← links)
