相关论文: A Positivstellensatz for Conditional SAGE Signomia…

We prove a Fej\'er-Riesz type factorization for positive matrix-valued noncommutative trigonometric polynomials on $\mathscr{W}\times\mathfrak{Y}$, where $\mathscr{W}$ is either the free semigroup $\langle x \rangle_g$ or the free product…

In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…

Rational functions of total degree $l$ in n variables have a representation in the Bernstein form defined over $n$ dimensional simplex. The range of a rational function is bounded by the smallest and the largest rational Bernstein…

This article studies algebraic certificates of positivity for noncommutative (nc) operator-valued polynomials on matrix convex sets, such as the solution set $D_L$, called a free Hilbert spectrahedron, of the linear operator inequality…

This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on…

Sabok showed that the set of codes for $G_\delta$ Ramsey positive subsets of $[\omega]^\omega$ is $\mathbf{\Sigma}^1_2$-complete. We extend this result by providing sufficient conditions for the set of codes for $G_\delta$ Ramsey positive…

In this paper, we obtain sufficient and necessary conditions of some classical convex sets as positively invariant sets for a continuous dynamical system, namely positive invariance conditions. The approach is based on Nagumo Theorem by…

This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…

For given set of $m$ positive numbers satisfying the conditions: $$ a_1 \geq a_2 \geq , ... \geq a_m \geq 0, $$ the inequality $$ \sum_{s=1}^{m} (-1)^{s-1}a^r_s \geq \left[ \sum_{s=1}^{m} (-1)^{s-1}a_s\right]^r, \quad r > 1, $$ was proved…

This paper studies Positivstellens\"atze and moment problems for sets $K$ that are given by universal quantifiers. Let $Q$ be a closed set and let $g = (g_1,...,g_s)$ be a tuple of polynomials in two vector variables $x$ and $y$. Then $K$…

Inspired by the papers by Angelo and Xu, Q.J Math., 74, pp. 767-777, and improvements by Kerr and Klurman, arXiv:2211.05540, we study the probability that the weighted sums of a Rademacher random multiplicative function, $\sum_{n\leq…

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

Qualification conditions (also termed constraint qualifications) help avoid pathological behavior at domain boundaries in convex analysis. By generalizing facial reduction from conic programming to general convex programs of the form $f(x)…

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

We revisit the problem of constructing predictive confidence sets for which we wish to obtain some type of conditional validity. We provide new arguments showing how ``split conformal'' methods achieve near desired coverage levels with high…

We seek simple conditions on a pair of labeled posets that determine when the difference of their $(P,\omega)$-partition enumerators is $F$-positive, i.e., positive in Gessel's fundamental basis. This is a quasisymmetric analogue of the…

Several signal recovery tasks can be relaxed into semidefinite programs with rank-one minimizers. A common technique for proving these programs succeed is to construct a dual certificate. Unfortunately, dual certificates may not exist under…

We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…

We consider the convex set of ( unital ) positive ( completely ) maps from a $C^*$ algebra $\cla$ to a von-Neumann sub-algebra $\clm$ of $\clb(\clh)$, the algebra of bounded linear operators on a Hilbert space $\clh$ and study its extreme…

The main result of this paper is that an entire function $f$ that is in $L^2(\mathbb C^n,\psi)$ with respect to the weight $\psi(z)=2mH_S(z)+\gamma\log(1+|z|^2)$ is a polynomial with exponents in $m\widehat S_\Gamma$. Here $H_S$ is the…