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

Simple item page
dc.creatorBona, Miklos
dc.creatorFlynn, Ryan
dc.date2008-11-05
dc.date.accessioned2026-07-07T10:15:42Z
dc.date.available2026-07-07T10:15:42Z
dc.descriptionWe 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$.
dc.description8 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0811.0740
dc.identifierhttp://arxiv.org/abs/0811.0740
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173260
dc.subjectCombinatorics
dc.subject05A05, 05A15
dc.titleThe Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley
dc.typetext

Files

Collections

arXiv