On five types of crucial permutations with respect to monotone patterns

DOI10.37236/11500arXiv2206.12499MaRDI QIDQ6403099FDOQ6403099

Authors: Sergey Avgustinovich, Sergey Kitaev, Anna A. Taranenko 

Publication date: 24 June 2022

Abstract: A crucial permutation is a permutation that avoids a given set of prohibitions, but any of its extensions, in an allowable way, results in a prohibition being introduced. In this paper, we introduce five natural types of crucial permutations with respect to monotone patterns, notably quadrocrucial permutations that are linked most closely to ErdH{o}s-Szekeres extremal permutations. The way we define right-crucial and bicrucial permutations is consistent with the definition of respective permutations studied in the literature in the contexts of other prohibitions. For each of the five types, we provide its characterization in terms of Young tableaux via the RSK correspondence. Moreover, we use the characterizations to prove that the number of such permutations of length $n$ is growing when $noinfty$, and to enumerate minimal crucial permutations in all but one case. We also provide other enumerative results.

Mathematics Subject Classification ID

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

This page was built for publication: On five types of crucial permutations with respect to monotone patterns

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