We study the cone $\mathcal{M}_{n,2d}$ of nonnegative mean polynomials---real $n$-variate forms of degree $2d$ that can be expressed as weighted power means $M_{q,p}(Y,w)$ with $q>p$. This cone simultaneously generalises the cone of sums of squares $\Sigma_{n,2d}$ and the cone of sums of nonnegative circuit polynomials $\mathcal{C}_{n,2d}$. We prove that every square of an arbitrary polynomial belongs to the mean polynomial preprime $T_{\mathrm{mean}}$, that $T_{\mathrm{mean}}$ is strongly generating, and consequently that every polynomial strictly positive on a compact semialgebraic set admits a representation with mean polynomial certificates. We exhibit the Robinson form $\hat{R}$ as a separating example that lies in $\mathcal{M}_{4,4}$ but outside $\mathrm{SOSONC}_{4,4}$. Finally, we outline a convergent hierarchy of lower bounds for polynomial optimization based on the mean polynomial cone and discuss tractable depth-truncated approximations via signomial programming.
Let $X\subset{\mathbb P}^{n-1}$ be a hypersurface of degree $d\ge3$ with ordinary double points, where $n\ge3$. The roots of Bernstein-Sato polynomial of its defining polynomial $f$ are given up to sign by 1, $(n-1)/2$, and $j/d$ for $j\in{\mathbb Z}\cap[n,nd-n-p_f]$ with $p_f$ a positive integer. Here $p_f$ is bounded...
Given a field $\mathbb{F}$ and an integer $n \geq 2$, denote by $t_n(\mathbb{F})$ the greatest possible dimension for a vector space of $n$-by-$n$ matrices over $\mathbb{F}$ in which every element is triangularizable. It was recently proved that $t_n(\mathbb{F})=\frac{n(n+1)}{2}$ if and only if $\mathbb{F}$ is not quad...
We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified for every $n\geq...
Dominique Guillot, Himanshu Gupta, P. K. Vishwakarma et al.· 0 citations
We study the simultaneous approximation of constant-degree polynomials over convex sets. For any family of $m$ degree-$d$ polynomials and any convex set ${H} \subseteq \mathbb{R}_{\ge0}^n$, we construct an $\epsilon$-Cover of the joint value set $\{(f_1(x), \dots, f_m(x)) : x \in {H}\}$ in the $\ell_\infty$-norm. This...
Martino Bernasconi, Matteo Castiglioni, Andrea Celli et al.· arXiv.org· 1 citation
Jungin Lee in 2018 proved a necessary and sufficient condition that an integral quadratic form $\sum_{i=1}^{m} a_iX_i^2$ is universal over $M_2(\mathbb{Z})$. For a positive integer $n \geq 2$, Lee defined $f(n)$ to be the smallest positive integer $m$ such that for every pairwise coprime $a_1, a_2, \ldots a_m \in \math...
Let $\mu$ be a log-concave probability measure on $\mathbb R^n$ and let $f\colon\mathbb R^n\to\mathbb R^k$ be a polynomial mapping of degree at most $d$. We show that \[ \mu(f\in A) \le C\bigl(\lambda_k(A)\bigr)^{\frac{1}{k(d-1)+1}} \] for every Borel set $A\subset\mathbb R^k$ whenever the image measure $\mu\circ f^{-1...
Egor D. Kosov, A. Zhukova· 1 citation· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
