Tree enumeration polynomials on separable permutations
From MaRDI portal
Publication:6659971
Recommendations
- Enumeration of trees by inversions
- A generalization of the results of Kreweras on the enumeration polynomial of inversions in arborescences
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Generalized tree inversions and \(k\)-parking functions
- A tree distinguishing polynomial
Cites work
- scientific article; zbMATH DE number 3722110 (Why is no real title available?)
- scientific article; zbMATH DE number 3265752 (Why is no real title available?)
- scientific article; zbMATH DE number 2230252 (Why is no real title available?)
- A theorem on trees.
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Matrix tree theorems
- Pattern matching for permutations
- Product decompositions of the symmetric group induced by separable permutations
- Separable elements and splittings of Weyl groups
- Separable elements in Weyl groups
This page was built for publication: Tree enumeration polynomials on separable permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659971)