On weak twins and up-and-down sub-permutations
Abstract
Two permutations and are weakly similar if if and only if for all . Let be a permutation of the set and let denote the largest integer such that contains a pair of disjoint weakly similar sub-permutations (called weak twins) of length . Finally, let denote the minimum of over all permutations of . Clearly, . In this paper we show that . We also study a variant of this problem. Let us say that , , is an alternating (or up-and-down) sub-permutation of if or . Let be a random permutation selected uniformly from all permutations of . It is known that the length of a longest alternating permutation in is asymptotically almost surely (a.a.s.) close to . We study the maximum length of a pair of disjoint alternating sub-permutations in and show that there are two constants such that a.a.s. . In addition, we show that the alternating shape is the most popular among all permutations of a given length.
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}
}