Related papers: Using Sums-of-Squares to Prove Gaussian Product In…
The long-standing Gaussian product inequality (GPI) conjecture states that $E [\prod_{j=1}^{n}|X_j|^{\alpha_j}]\geq\prod_{j=1}^{n}E[|X_j|^{\alpha_j}]$ for any centered Gaussian random vector $(X_1,\dots,X_n)$ and any non-negative real…
The long-standing Gaussian product inequality (GPI) conjecture states that, for any centered $\mathbb{R}^n$-valued Gaussian random vector $(X_1, \dots, X_n)$ and any positive reals $\alpha_1, \dots, \alpha_n$, ${\bf…
In this short note, we find an equivalent combinatorial condition only involving finite sums under which a centered Gaussian random vector with multinomial covariance matrix satisfies the Gaussian product inequality (GPI) conjecture. These…
The Gaussian product inequality (GPI) conjecture is one of the most famous inequalities associated with Gaussian distributions and has attracted a lot of concerns. In this note, we investigate the quantitative versions of the…
A combinatorial proof of the Gaussian product inequality (GPI) is given under the assumption that each component of a centered Gaussian random vector $\boldsymbol{X} = (X_1, \ldots, X_d)$ of arbitrary length can be written as a linear…
The Gaussian product inequality is a long-standing conjecture. In this paper, we investigate the three-dimensional inequality $E[X_1^{2}X_2^{2m_2}X_3^{2m_3}]\ge E[X_1^{2}]E[X_2^{2m_2}]E[X_3^{2m_3}]$ for any centered Gaussian random vector…
We prove the three-dimensional Gaussian product inequality (GPI) $E[X_1^{2}X_2^{2m_2}X_3^{2m_3}]\ge E[X_1^{2}]E[X_2^{2m_2}]E[X_3^{2m_3}]$ for any centered Gaussian random vector $(X_1,X_2,X_3)$ and $m_2,m_3\in\mathbb{N}$. We discover a…
For an $n$-dimensional real-valued centered Gaussian random vector $(X_1,\ldots,X_n)$ with any covariance matrix, the following moment product conjecture is proved in this paper \[ \mathbb{E}\prod_{j=1}^nX_j^{2m_j}\geq…
We prove the 3-dimensional Gaussian product inequality, i.e., for any real-valued centered Gaussian random vector $(X,Y,Z)$ and $m\in \mathbb{N}$, it holds that…
We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…
This note establishes that the opposite Gaussian product inequality (GPI) of the type proved by Russell & Sun (2022a) in two dimensions, and partially extended to higher dimensions by Zhou et al. (2024), continues to hold for an arbitrary…
This note reports partial results related to the Gaussian product inequality (GPI) conjecture for the joint distribution of traces of Wishart matrices. In particular, several GPI-related results from Wei (2014) and Liu et al. (2015) are…
Let $X_{m} = G_{1}\ldots G_{m}$ denote the product of $m$ independent random matrices of size $N \times N$, with each matrix in the product consisting of independent standard Gaussian variables. Denoting by $N_{\mathbb{R}}(m)$ the total…
This paper extends various results related to the Gaussian product inequality (GPI) conjecture to the setting of disjoint principal minors of Wishart random matrices. This includes product-type inequalities for matrix-variate analogs of…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
The Gaussian product inequality is an important conjecture concerning the moments of Gaussian random vectors. While all attempts to prove the Gaussian product inequality in full generality have been unsuccessful to date, numerous partial…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…
In this paper, using combinatorial and analytic methods, we prove an exact calculating formula on the $2m$-th power mean value of the generalized quadratic Gauss sums for $m\geq 2$. This solves a conjecture of He and Zhang [`On the $2k$-th…
The main purpose of this article is to study higher power mean values of generalized quadratic Gauss sums using estimates for character sums, analytic method and algebraic geometric methods. In this article, we prove two conjectures which…