In https://mathworld.wolfram.com/DiagonallyDominantMatrix.html, I find that
A symmetric diagonally dominant real matrix with nonnegative diagonal entries is positive semidefinite.
If $A \in \mathbb{R}^{N\times N}$ is symmetric diagonally dominant real matrix with nonnegative diagonal entries, is it still ture that \begin{align} (\mathbf x^{2p-1})^T A \mathbf x \geq 0, \quad \forall \mathbf x \in \mathbb{R}^N \end{align} where $p \geq 1$ is an integer, and the $(2p-1)$-th power of the vector $\mathbf{x}$ is element wise, i.e. $\mathbf x^{2p-1} = [x_1^{2p-1}, \cdots, x_N^{2p-1}]^T$.
EDIT 1 I wrote a short matlab
code to verify the inequality
clear;
N = 10;
A0 = 2*rand(N, N) - 1; % random value in [-1, 1]
A = A0 + A0'; % construct symmetric matrix;
v = (sum(abs(A), 2) - abs(diag(A))); % diagonally dominant
for i = 1:N
A(i,i) = v(i); % Assign v to the diagonal elements
end
xv = 2*rand(N, 1000000) - 1;
p = 3;
x = min(dot((xv.^p), A * xv))
Thank you very much!