On the sub-permutations of pattern avoiding permutations
From MaRDI portal
Publication:465287
DOI10.1016/j.disc.2014.06.028zbMath1301.05008arXiv1210.6908OpenAlexW2013231195MaRDI QIDQ465287
Filippo Disanto, Thomas H. E. Wiehe
Publication date: 31 October 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6908
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Permutations, words, matrices (05A05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern matching for permutations
- Non-contiguous pattern avoidance in binary trees
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Descendants in increasing trees
- Pattern avoidance in binary trees
- Permutation trees and variation statistics
- Dyck path enumeration
- Generating functions for generating trees
- The kernel method: a collection of examples
- Generating trees and the Catalan and Schröder numbers
- Counting strings in Dyck paths
- Avoiding patterns of length three in compositions and multiset permutations
- ECO:a methodology for the enumeration of combinatorial objects
- Restricted permutations