Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)

DOI10.1016/J.AAM.2019.01.005zbMath1407.05008arXiv1809.01384OpenAlexW2911565153MaRDI QIDQ1738322

Dun Qiu, Ran Pan, Jeffery B. Remmel

Publication date: 29 March 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.01384

zbMATH Keywords

permutationsDyck pathsCatalan numbersconsecutive patternsclassical patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items (3)

The combinatorics of Jeff Remmel ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata ⋮ Distributions of Statistics over Pattern-Avoiding Permutations

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Patterns in permutations and words.
• A simple and unusual bijection for Dyck paths and its consequences
• Patterns in words of ordered set partitions
• A survey of consecutive patterns in permutations
• Quadrant marked mesh patterns in 123-avoiding permutations
• Distributions of Statistics over Pattern-Avoiding Permutations
• Permutations with restricted patterns and Dyck paths

This page was built for publication: Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)