Permutations avoiding sets of patterns with long monotone subsequences

DOI10.1016/J.JSC.2022.09.001MaRDI QIDQ2100048zbMATH OpenOpenAlexFDO

Authors Miklós Bóna, Jay Pantone

Publication date 21 November 2022

Published in Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

permutationsasymptotic enumerationpatternsstandard Young tableauxnon-algebraic generating functions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Abstract: We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations avoiding the monotone increasing subsequence of length $k-1$.

Recommendations

• Longest monotone subsequences and rare regions of pattern-avoiding permutations
• Permutation classes of polynomial growth
• On the number of permutations avoiding a given pattern
• Publication:4954008
• scientific article; zbMATH DE number 5831716

Cites work

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• Asymptotic values for degrees associated with strips of Young diagrams
• Combinatorics of permutations
• Five subsets of permutations enumerated as weak sorting permutations
• GFUN
• Generating permutations with restricted containers
• On the growth of merges and staircases of permutation classes
• Permutation classes
• The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns

Cited in

(15)

• Permutation classes of polynomial growth
• On three different notions of monotone subsequences
• Pattern avoiding permutations with a unique longest increasing subsequence
• Longest monotone subsequences and rare regions of pattern-avoiding permutations
• Supercritical sequences, and the nonrationality of most principal permutation classes
• Long increasing subsequences and non-algebraicity
• Growth rates for subclasses of Av(321)
• Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
• Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
• Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization
• Combinatorial exploration: an algorithmic framework for enumeration
• Stieltjes moment sequences for pattern-avoiding permutations
• Permutation patterns are hard to count
• Counting crucial permutations with respect to monotone patterns
• scientific article; zbMATH DE number 1447312 (Why is no real title available?)

Describes a project that uses

Uses Software

• gfun

This page was built for publication: Permutations avoiding sets of patterns with long monotone subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2100048)