Generalized Rearrangement Inequalities

From MaRDI portal





Let \({\mathbf x}=(x_1,\ldots,x_n), {\mathbf y}=(y_1,\ldots,y_n)\) be \(n\)-tuples of real numbers and \(T\) a real function on \( (\min{\mathbf x}, \max{\mathbf x})\times (\min{\mathbf y}, \max{\mathbf y})\) with \(\partial^2T\big/\partial x\partial y\geq 0\); put \(S({\mathbf x},{\mathbf y})= \sum_{i=1}^nT(x_i, y_i)\). The authors prove the following generalization of the standard rearrangement inequality: if the elements of the \(n\)-tuples \({\mathbf x}^*,{\mathbf y}^*\) are permutations of the elements of \({\mathbf x}, {\mathbf y}\), respectively, the function \(S\) is maximized if the elements of \({\mathbf x}^*,{\mathbf y}^*\) are similarly ordered and minimized if they are oppositely ordered. The case \(T(x,y) = xy\) gives the standard rearrangement inequality; taking \(T(x,y)= f(x)g(y)\) with \(f'\geq 0, g'\geq 0\) leads to several interesting special cases.











This page was built for publication: Generalized Rearrangement Inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146555)