The average number of block interchanges needed to sort a permutation and a recent result of Stanley

From MaRDI portal
Publication:989529




Abstract: We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length n.









This page was built for publication: The average number of block interchanges needed to sort a permutation and a recent result of Stanley

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989529)