On rearrangement inequalities for multiple sequences

18 May 2020 Wu Chai Wah

The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the smallest value. This has been generalized to multiple sequences to show that similarly ordered sequences provide the largest value... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS