Ascent sequences avoiding pairs of patterns
From MaRDI portal
Publication:2260633
zbMath1308.05001arXiv1406.4100MaRDI QIDQ2260633
Lara K. Pudwell, Andrew M. Baxter
Publication date: 11 March 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.4100
Trees (05C05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (7)
Inversion sequences avoiding pairs of patterns ⋮ Unnamed Item ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Catalan words avoiding pairs of length three patterns ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ Transport of patterns by Burge transpose
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
- Some enumerative results related to ascent sequences
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Patterns in permutations and words.
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- Pattern avoidance in ascent sequences
- Ascent sequences and upper triangular matrices containing non-negative integers
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
- On multiple pattern avoiding set partitions
- On 021-avoiding ascent sequences
- Finitely labeled generating trees and restricted permutations
- Counting strings in Dyck paths
- Restricted ascent sequences and Catalan numbers
- $n!$ matchings, $n!$ posets
- Directed column-convex polyominoes by recurrence relations
- Ascent sequences and Fibonacci numbers
This page was built for publication: Ascent sequences avoiding pairs of patterns
