Tree enumeration polynomials on separable permutations
From MaRDI portal
Publication:6659971
DOI10.54550/ECA2024V4S1R6MaRDI QIDQ6659971FDOQ6659971
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- Pattern matching for permutations
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Title not available (Why is that?)
- Product decompositions of the symmetric group induced by separable permutations
- Matrix tree theorems
- A theorem on trees.
- Title not available (Why is that?)
- Separable elements and splittings of Weyl groups
- Separable elements in Weyl groups
- Title not available (Why is that?)
Cited In (1)
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)