Extremal problems on permutations under
β
P ErdΓΆs; N Linial; S Moran
π
Article
π
1987
π
Elsevier Science
π
English
β 608 KB
How much can a permutation be simplified by means of cyclic rotations? For functions f: S,.-o Z which give a measure of complexity to permutations we are interested in finding where the max is over o e S,, and the min is over u which are cyclically equivalent to o. The measures of complexity consi