Pages that link to "Item:Q989529"
From MaRDI portal
The following pages link to The average number of block interchanges needed to sort a permutation and a recent result of Stanley (Q989529):
Displaying 8 items.
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- On the average number of reversals needed to sort signed permutations (Q1682880) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
- The distribution of cycles in breakpoint graphs of signed permutations (Q2446324) (← links)
- A versatile combinatorial approach of studying products of long cycles in symmetric groups (Q2665756) (← links)
- Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations (Q2818210) (← links)
- Separation Probabilities for Products of Permutations (Q5410255) (← links)
- On products of permutations with the most uncontaminated cycles by designated labels (Q6098208) (← links)
