On the generalized sum of squared logarithms inequality
Waldemar Pompe, Patrizio Neff

TL;DR
This paper characterizes conditions on functions ensuring inequalities involving elementary symmetric polynomials, extending the sum of squared logarithms inequality to higher dimensions and more general functions.
Contribution
It provides necessary and sufficient conditions for a class of inequalities involving symmetric polynomials, generalizing the sum of squared logarithms inequality to larger n and broader functions.
Findings
Established conditions for function f to satisfy the inequality for given symmetric polynomial constraints.
Extended the sum of squared logarithms inequality from n=2,3 to n=4 and beyond.
Identified specific cases where the inequality holds for f(x)=log^2 x and certain subsets S.
Abstract
Assume . Consider the elementary symmetric polynomials and denote by the elementary symmetric polynomials in reverse order \begin{align*} E_k(y_1,y_2,\ldots,y_n):=e_{n-k}(y_1,y_2,\ldots,y_n)=\sum_{i_1<\ldots<i_{n-k}} y_{i_1}y_{i_2}\ldots y_{i_{n-k}}\, , \quad k\in \{0,1,\ldots,n{-}1 \}\, . \end{align*} Let moreover be a nonempty subset of . We investigate necessary and sufficient conditions on the function , where is an interval, such that the inequality \begin{align} \label{abstract_inequality} f(a_1)+f(a_2)+\ldots+f(a_n)\leq f(b_1)+f(b_2)+\ldots+f(b_n) \tag{*} \end{align} holds for all and satisfying $$E_k(a)< E_k(b) \ \hbox{for } k\in S\quad \hbox{and} \quad E_k(a)=E_k(b) \ \hbox{for } k\in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Composite Structure Analysis and Optimization · Mathematical Inequalities and Applications
