Tree enumeration polynomials on separable permutations

DOI10.54550/ECA2024V4S1R6MaRDI QIDQ6659971FDO

Authors Yi-Bo Gao, Siyu Liu

Publication date 9 January 2025

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

zbMATH Keywords

matrix-tree theoremseparable permutationreciprocity theorem

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Enumeration in graph theory (05C30)

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

Cited in

(1)

• Distributions of statistics on separable permutations

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)