Name
Abstract | ||
|---|---|---|
How much can a permutation be simplified by means of cyclic rotations? For functions f : S n → Z which give a measure of complexity to permutations we are interested in finding F ( n ) = max min f ( σ ), where the max is over σ ϵ S n and the min is over π which are cyclically equivalent to σ. The measures of complexity considered are the number of inversions and the diameter of the permutation. The effect of allowing a reflection as well as rotations is also considered. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1016/0012-365X(87)90235-4 | DISCRETE MATHEMATICS |
Field | DocType | Volume |
Discrete mathematics,Equivalence relation,Combinatorics,Permutation,Cyclic permutation,Equivalence (measure theory),Mathematics | Journal | 64 |
Issue | ISSN | Citations |
1 | 0012-365X | 1 |
PageRank | References | Authors |
0.39 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| Nati Linial | 2 | 3872 | 602.77 |
| S Moran | 3 | 1 | 0.39 |