The Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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$.
8 pages, 4 figures

Keywords

Combinatorics, 05A05, 05A15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/173260

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0811.0740
 http://arxiv.org/abs/0811.0740

Collections

arXiv