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

Authors:
Miklós Bóna;Ryan Flynn
Affiliations:
Department of Mathematics, University of Florida, Gainesville, FL 32611-8105, USA;Department of Mathematics, Penn State University, University Park, State College, PA 16802, USA
Venue:
Information Processing Letters
Year:
2009

Citing 3
Cited 3

Enumerative combinatorics

Enumerative combinatorics
Inductive and injective proofs of log concavity results

Discrete Mathematics
Sorting permutations by block-interchanges

Information Processing Letters

An improved algorithm for sorting by block-interchanges based on permutation groups

Information Processing Letters
Sorting Permutations by Reversals through a Hybrid Genetic Algorithm based on Breakpoint Elimination and Exact Solutions for Signed Permutations

Electronic Notes in Theoretical Computer Science (ENTCS)
The distribution of cycles in breakpoint graphs of signed permutations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We use an interesting recent 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.