Counting crucial permutations with respect to monotone patterns

DOI10.1016/j.disc.2023.113861arXiv2208.13469OpenAlexW4390291979MaRDI QIDQ6117352

Yunseo Choi

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Young tableauRSK correspondencecrucial permutations

Mathematics Subject Classification ID

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

Cites Work

• Crucial words and the complexity of some extremal problems for sets of prohibited words
• On uniquely \(k\)-determined permutations
• Permutations, matrices, and generalized Young tableaux
• On five types of crucial permutations with respect to monotone patterns
• An Erd\H{o}s--Hajnal analogue for permutation classes
• Longest Increasing and Decreasing Subsequences
• The Hook Graphs of the Symmetric Group
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting crucial permutations with respect to monotone patterns