Enumeration schemes for vincular patterns
From MaRDI portal
Publication:418874
DOI10.1016/j.disc.2012.01.021zbMath1242.05008arXiv1108.2642MaRDI QIDQ418874
Andrew M. Baxter, Lara K. Pudwell
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2642
pattern avoidance; generalized pattern; vincular pattern; dashed pattern; enumeration scheme; restricted permutation
Related Items
Consecutive patterns in inversion sequences II: avoiding patterns of relations, Shape-Wilf-equivalences for vincular patterns, Refining enumeration schemes to count according to permutation statistics, Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes, Subregularity in infinitely labeled generating trees of restricted permutations, Inversion sequences avoiding consecutive patterns, Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shape-Wilf-equivalences for vincular patterns
- Permutation tableaux and the dashed permutation pattern 32-1
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- q-Catalan numbers
- Enumeration schemes and, more importantly, their automatic generation
- Consecutive patterns in permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Multi-avoidance of generalised patterns
- The number of permutations containing exactly one increasing subsequence of length three
- Enumeration schemes for permutations avoiding barred patterns
- Asymptotic enumeration of permutations avoiding generalized patterns
- Partially ordered generalized patterns
- Generalized permutation patterns -- a short survey
- Enumeration Schemes for Restricted Permutations
- Generalized pattern avoidance
