English

On weak twins and up-and-down sub-permutations

Combinatorics 2020-12-22 v1

Abstract

Two permutations (x1,,xw)(x_1,\dots,x_w) and (y1,,yw)(y_1,\dots,y_w) are weakly similar if xi<xi+1x_i<x_{i+1} if and only if yi<yi+1y_i<y_{i+1} for all 1iw1\leqslant i \leqslant w. Let π\pi be a permutation of the set [n]={1,2,,n}[n]=\{1,2,\dots, n\} and let wt(π)wt(\pi) denote the largest integer ww such that π\pi contains a pair of disjoint weakly similar sub-permutations (called weak twins) of length ww. Finally, let wt(n)wt(n) denote the minimum of wt(π)wt(\pi) over all permutations π\pi of [n][n]. Clearly, wt(n)n/2wt(n)\le n/2. In this paper we show that n12wt(n)n2Ω(n1/3)\tfrac n{12}\le wt(n)\le\tfrac n2-\Omega(n^{1/3}). We also study a variant of this problem. Let us say that π=(π(i1),...,π(ij))\pi'=(\pi(i_1),...,\pi(i_j)), i1<<iji_1<\cdots<i_j, is an alternating (or up-and-down) sub-permutation of π\pi if π(i1)>π(i2)<π(i3)>...\pi(i_1)>\pi(i_2)<\pi(i_3)>... or π(i1)<π(i2)>π(i3)<...\pi(i_1)<\pi(i_2)>\pi(i_3)<.... Let Πn\Pi_n be a random permutation selected uniformly from all n!n! permutations of [n][n]. It is known that the length of a longest alternating permutation in Πn\Pi_n is asymptotically almost surely (a.a.s.) close to 2n/32n/3. We study the maximum length α(n)\alpha(n) of a pair of disjoint alternating sub-permutations in Πn\Pi_n and show that there are two constants 1/3<c1<c2<1/21/3<c_1<c_2<1/2 such that a.a.s. c1nα(n)c2nc_1n\le \alpha(n)\le c_2n. In addition, we show that the alternating shape is the most popular among all permutations of a given length.

Keywords

Cite

@article{arxiv.2012.11451,
  title  = {On weak twins and up-and-down sub-permutations},
  author = {Andrzej Dudek and Jarosław Grytczuk and Andrzej Ruciński},
  journal= {arXiv preprint arXiv:2012.11451},
  year   = {2020}
}
R2 v1 2026-06-23T21:08:37.751Z