分层置换的密度极大化器
Density maximizers of layered permutations
摘要:
如果排列既不包含231也不包含312作为模式,则排列是分层的。已知,如果$σ$是分层置换,则$n$阶置换中的$σ$的密度通过分层置换而最大化。Albert,Atkinson,Handley,Holton and Stromquist [Electron. J. Combin. 9(2002),R#5]声称具有大小为$(a,1,b)$的层的分层置换的密度,其中$a,b\geq2$通过具有有界层数的分层置换被渐近最大化,并且证明如果分层置换没有大小为1的连续层并且其第一层和最后一层的大小至少为2,则同样成立。我们表明,如果$σ$是一个分层排列,其第一层是足够大的第二层是大小为1,那么层的数量趋于无穷大,在每个序列的分层排列渐近最大化的密度$σ$。这反驳了猜想和阿尔伯特等人的索赔,我们补充这一结果给出充分条件的分层置换有界层数的渐近或精确的最大化。
英文摘要:
A permutation is layered if it contains neither 231 nor 312 as a pattern. It is known that, if $σ$ is a layered permutation, then the density of $σ$ in a permutation of order $n$ is maximized by a layered permutation. Albert, Atkinson, Handley, Holton and Stromquist [Electron. J. Combin. 9 (2002), R#5] claimed that the density of a layered permutation with layers of sizes $(a,1,b)$ where $a,b\geq2$ is asymptotically maximized by layered permutations with a bounded number of layers, and conjectured that the same holds if a layered permutation has no consecutive layers of size one and its first and last layers are of size at least two. We show that, if $σ$ is a layered permutation whose first layer is sufficiently large and second layer is of size one, then the number of layers tends to infinity in every sequence of layered permutations asymptotically maximizing the density of $σ$. This disproves the conjecture and the claim of Albert et al. We complement this result by giving sufficient conditions on a layered permutation to have asymptotic or exact maximizers with a bounded number of layers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。