arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.12499math.CO
收藏

关于单调模式的五类关键置换

On five types of crucial permutations with respect to monotone patterns

Sergey Avgustinovich, Sergey Kitaev, Anna Taranenko

摘要:

一个关键的排列是一个排列,避免了一组给定的禁令,但它的任何扩展,在一个允许的方式,导致一个禁令被引入。在本文中,我们介绍了五种自然类型的关键排列单调模式,特别是quadrocritical排列,最密切的联系到Erdens-Szekeres极值排列。我们定义右关键排列和双十字排列的方式与文献中研究的其他禁止的上下文中的相应排列的定义是一致的。对于每一个五种类型,我们提供了它的表征通过RSK对应的杨tableaux。此外,我们使用的特征证明,这种排列的长度$n$增长时,$n\to\infty$,并列举最小的关键排列,但在所有的情况下。我们还提供了其他的枚举结果。

英文摘要:

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 Erdő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 $n\to\infty$, and to enumerate minimal crucial permutations in all but one case. We also provide other enumerative results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑