We extend the trace--determinant framework of Nayak, Sharma, and Mishra~\cite{nayak2026} for bounding the H-eigenvalues of symmetric positive definite tensors. First, we replace the Arithmetic--Geometric Mean (AM--GM) relaxation underlying previous bounds by the exact solution of the associated constrained optimization problem, yielding sharp upper and lower bounds that are attained on the admissible spectral variety. Second, we incorporate higher-order power sums as additional spectral invariants and prove a structural theorem showing that any extremizer over a $K$-invariant feasibility region has at most $K$ distinct spectral values. This reduces the problem to a finite collection of low-dimensional polynomial systems and yields a hierarchy of increasingly tight bounds. For the four-invariant case $(T,S,p_3,D)$, we develop a complete theory including solution-count estimates, a multistart Newton algorithm, and sharpness conditions. We also derive closed-form bounds in small dimensions, establish perturbation estimates, and obtain refined Lyapunov region-of-attraction bounds. Numerical experiments for dimensions up to $d=100$ show that the sharp three-invariant bound reduces the median relative overestimation gap from $53\%$ to $6\%$ while maintaining low computational cost. The framework is validated on tensors with real H-spectrum.
We study extremizers for a trilinear Stein-Weiss inequality on $\mathbb{R}^n$. Within the known boundedness region, we prove attainment under two additional assumptions: all six weight exponents are nonnegative, and at least one pair of Lebesgue exponents is admissible. The proof combines symmetric decreasing rearrange...
We develop a residue-theoretic framework for studying inverse eigenvectors of a square matrix, defined by the nonlinear equation $M\alpha=\alpha^{-1}$. Our main result is an inverse analogue of the spectral theorem: under natural transversality and properness assumptions, the identity operator admits an explicit decomp...
We study polynomial zero-avoidance over finite vector spaces by means of slice rank and partition rank. We first make the support-entropy method effective by showing how a finite dual certificate yields an explicit entropy gap whenever the coefficient support admits no probability distribution with uniform marginals. F...
Simone Costa, Stefano Della Fiore, Mattia Fontana· 0 citations
Nearest structured approximation and best structured preconditioning solve different matrix optimization problems. We determine their exact relation for Kronecker positive-definite matrices under the affine-invariant Riemannian metric. The Kronecker family is closed and geodesically convex, so every full matrix has a u...
We study sharp estimates for the $p$-capacity on complete non-compact Riemannian manifolds under lower Ricci curvature bounds. First, we establish sharp comparison inequalities for the $p$-capacity of bounded smooth domains in manifolds satisfying $\operatorname{Ric}\ge -ng.$ The estimates are expressed in terms of the...
We study high-dimensional random-matrix limits of Gaussian Kullback--Leibler unbalanced optimal transport (KL-UOT). Under equal marginal penalties, the covariance action admits an exact log-determinant representation in terms of a nonlinear ridge product, together with a positive-semidefinite extension that remains fin...
Jia-Ping Yang, Yun-Xin Zhang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.