Abstract: We consider a new and simpler proof of an inequality of A.S. Gasparyan, which was originally derived in terms of complex algebraical objects --- multidimensional hyperdeterminants. Our proof is much simpler and use only standard technics such as mean inequalities. The main theorem on Gini means is essentially used. Some corollaries and problems are considered.
The inequality of the title is \( \sum_{r=0}^{2m}(-1)^r\Bigl(\sum_{k=1}^nx_k^r\Bigr)\Bigl(\sum_{k=1}^nx_k^{2m-r}\Bigr)\geq0\); the \(x_k, 1\leq k\leq n,\) are real numbers. The authors improve this inequality and give a simpler proof. The improvement consists in replacing the right-hand side zero by simple forms of degree 2m. The new inequalities are strict unless \(x_1= \cdots=x_n\). An application to Gini means is made.
Recommendations
Cites work
- Analytic Inequalities
- scientific article; zbMATH DE number 3882580 (Why is no real title available?)
- scientific article; zbMATH DE number 3809880 (Why is no real title available?)
- scientific article; zbMATH DE number 3902841 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 2021757 (Why is no real title available?)
- scientific article; zbMATH DE number 194680 (Why is no real title available?)
- scientific article; zbMATH DE number 233956 (Why is no real title available?)
- Means and their inequalities
Cited in
(4)
This page was built for publication: On Gasparyan's inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356550)
