Permutations $r_j$ such that ${\sum }_{i=1}^n{\prod }_{j=1}^k{r}_j(i)$ is maximized or minimized

Abstract

We consider the problem of finding the set of permutations $r_j$ of $\{1,\cdots ,n\}$ such that ${\sum }_{i=1}^n{\prod }_{j=1}^k{r}_j(i)$ is maximized or minimized. While the set of permutations maximizing this value are easily determined, finding the set of permutations minimizing this value appears to be an open problem. We show values of $k$ and $n$ for which an explicit solution exists and comment on computational issues in determining the general problem. We also look at the dual problem of finding the permutations such that ${\prod }_{i=1}^n{\sum }_{j=1}^k{r}_j(i)$ is maximized or minimized. As part of this study we also look at a variant of a rearrangement inequality.

arXiv comment16 pages. Added Theorem 10

Cited by in corpus (1)

• On rearrangement inequalities for multiple sequences