Permutations avoiding sets of patterns with long monotone subsequences

2021/03/11 by Miklós Bóna, Bóna, Miklós, Jay Pantone +1 · 1 citation
Engineering · Mathematics · Computer Science · #graph theory and CDMA systems #Advanced Combinatorial Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2103.06918

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.

Cited by

• Permutations Almost Avoiding Monotone Distant Patterns

Related

• Permutations Almost Avoiding Monotone Distant Patterns
• On Three Different Notions of Monotone Subsequences
• Where the monotone pattern (mostly) rules
• Pattern avoiding permutations and involutions with a unique longest increasing subsequence
• On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length