Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization

DOI10.1007/s00026-021-00549-0OpenAlexW4223554523MaRDI QIDQ2155548

Miklós Bóna, Alexander Burstein

Publication date: 15 July 2022

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

generating functioninjectionpattern avoiding permutationSimion-Schmidt bijection

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• A short proof for the number of permutations containing pattern 321 exactly once
• Analytic models and ambiguity of context-free languages
• Permutations with one or two 132-subsequences
• Asymptotic values for degrees associated with strips of Young diagrams
• The number of permutations containing exactly one increasing subsequence of length three
• Supercritical sequences, and the nonrationality of most principal permutation classes
• Combinatorics of Permutations
• Permutation classes
• Restricted permutations
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent

This page was built for publication: Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization