202 search results - page 6 / 41 » Counting Distance Permutations |
DMTCS
2008
14 years 11 months ago
2008
Recently, Kitaev and Remmel [8] refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. Results in [8] were extende...
103
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This...
HICSS
2008
IEEE
15 years 7 months ago
2008
IEEE
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
85
Voted
EJC
2010
15 years 25 days ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
76
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer