Permutations avoiding sets of patterns with long monotone subsequences

DOI10.1016/j.jsc.2022.09.001zbMath1506.05002arXiv2103.06918OpenAlexW3136720388MaRDI QIDQ2100048

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)

Uses Software

• gfun

Cites Work

• Unnamed Item
• The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns
• Five subsets of permutations enumerated as weak sorting permutations
• Generating permutations with restricted containers
• Asymptotic values for degrees associated with strips of Young diagrams
• On the growth of merges and staircases of permutation classes
• Combinatorics of Permutations
• Permutation classes
• GFUN

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