Counting crucial permutations with respect to monotone patterns

preprint2022arXivOpen access

Abstract

Recently, Avgustinovich, Kitaev, and Taranenko defined five types of (k,ℓ)−(k, \ell)-crucial permutations, which are maximal permutations that do not contain an increasing subsequence of length kk or a decreasing subsequence of length ℓ\ell. Further, Avgustinovich, Kitaev, and Taranenko began the enumeration of the (k,ℓ)−(k, \ell)-crucial permutations of the minimal length and the next minimal length and the (k,3)−(k, 3)-crucial permutations of all lengths for each of the five types of (k,ℓ)−(k,\ell)-crucial permutations. In this paper, we complete the enumeration that Avgustinovich, Kitaev, and Taranenko began.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.