On weak twins and up-and-down sub-permutations
Abstract
Two permutations (x1,…,xw) and (y1,…,yw) are weakly similar if xi<xi+1 if and only if yi<yi+1 for all 1≤slant i ≤slant w. Let π be a permutation of the set [n]=\1,2,…, n\ and let wt(π) denote the largest integer w such that π contains a pair of disjoint weakly similar sub-permutations (called weak twins) of length w. Finally, let wt(n) denote the minimum of wt(π) over all permutations π of [n]. Clearly, wt(n) n/2. In this paper we show that n12 wt(n) n2-(n1/3). We also study a variant of this problem. Let us say that π'=(π(i1),...,π(ij)), i1<·s<ij, is an alternating (or up-and-down) sub-permutation of π if π(i1)>π(i2)<π(i3)>... or π(i1)<π(i2)>π(i3)<.... Let n be a random permutation selected uniformly from all n! permutations of [n]. It is known that the length of a longest alternating permutation in n is asymptotically almost surely (a.a.s.) close to 2n/3. We study the maximum length α(n) of a pair of disjoint alternating sub-permutations in n and show that there are two constants 1/3<c1<c2<1/2 such that a.a.s. c1n α(n) c2n. In addition, we show that the alternating shape is the most popular among all permutations of a given length.