Rooted forests that avoid sets of permutations
From MaRDI portal
Publication:1715620
DOI10.1016/j.ejc.2018.10.004zbMath1404.05003arXiv1607.03046OpenAlexW2962921265WikidataQ128977394 ScholiaQ128977394MaRDI QIDQ1715620
Publication date: 29 January 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.03046
Related Items
Maximal chains in bond lattices, Wilf equivalences for patterns in rooted labeled forests, Stanley-Wilf limits for patterns in rooted labeled forests, Embedding small digraphs and permutations in binary trees and split trees, Integer sequences and monomial ideals, Runs in labelled trees and mappings, Classical and consecutive pattern avoidance in rooted forests, Pattern restricted quasi-Stirling permutations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern avoidance in labelled trees
- A refinement of Cayley's formula for trees
- An insertion algorithm and leaders of rooted trees
- Pattern avoidance in binary trees
- Hook length formulas for trees by Han's expansion
- Mahonian statistics on labeled forests
- Counting forests by descents and leaves
- A multivariate hook formula for labelled trees
- Dyck tilings, increasing trees, descents, and inversions
- A generalized enumeration of labeled trees and reverse Prüfer algorithm
- A note on the \(\gamma\)-coefficients of the tree Eulerian polynomial
- Geometric grid classes of permutations
- Patterns and pattern-matching in trees: An analysis
- Increasing trees and alternating permutations
- Pattern Avoidance in Ternary Trees
- The inversion enumerator for labeled trees
- Restricted permutations
- Enumerating alternating trees
