Related papers: A Positivstellensatz for Conditional SAGE Signomia…

We combine our previous results on magnetic pseudo-differential operators for H\"ormander symbols dominated by tempered weights [arXiv:2511.07184] with the magnetic Weyl super calculus of Lee and Lein [arXiv:2201.11487, arXiv:2405.19964].…

Let $\mathfrak C$ be a class of finite groups which is closed for subgroups, quotients and direct products. Given a profinite group $G$ and an element $x\in G$, we denote by $P_{\mathfrak{C}}(x,G)$ the probability that $x$ and a randomly…

Let G be a compact Lie group and let X be an oriented Witt G-pseudomanifold. Using intersection cohomology it is possible to define Sign(G,X) in R(G), the G-signature of X. Let g be an element in G. Assuming that the inclusion of the fixed…

Consider the closed convex hull $K$ of a monomial curve given parametrically as $(t^{m_1},\ldots,t^{m_n})$, with the parameter $t$ varying in an interval $I$. We show, using constructive arguments, that $K$ admits a lifted semidefinite…

In this paper we continue our study of a complex variables version of Hilbert's seventeenth problem by generalizing some of the results from [CD]. Given a bihomogeneous polynomial $f$ of several complex variables that is positive away from…

We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.

We prove that every matrix-valued rational function $F$, which is regular on the closure of a bounded domain $\mathcal{D}_\mathbf{P}$ in $\mathbb{C}^d$ and which has the associated Agler norm strictly less than 1, admits a…

In this paper we prove new bounds for sums of convex or concave functions. Specifically, we prove that for all $A,B \subseteq \mathbb R$ finite sets, and for all $f,g$ convex or concave functions, we have $$|A + B|^{38}|f(A) + g(B)|^{38}…

We introduce the concept of numeraires of convex sets in the nonnegative orthant of the topological vector space of all random variables built over a probability space. A necessary and sufficient condition for an element of a convex set to…

The Boolean satisfiability (SAT) problem lies at the core of many applications in combinatorial optimization, software verification, cryptography, and machine learning. While state-of-the-art solvers have demonstrated high efficiency in…

We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…

Let $\mathbb{Q}$ (resp. $\mathbb{R}$) be the field of rational (resp. real) numbers and $X = (X_1, \ldots, X_n)$ be variables. Deciding the non-negativity of polynomials in $\mathbb{Q}[X]$ over $\mathbb{R}^n$ or over semi-algebraic domains…

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

We show that for a convex solid set of positive random variables to be tight, or equivalently bounded in probability, it is necessary and sufficient that it is radially bounded, i.e. that every ray passing through one of its elements…

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…

We present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.

In this paper, we consider higher order paired symmetric tensors and strongly paired symmetric tensors. Elasticity tensors and higher order elasticity tensors in solid mechanics are strongly paired symmetric tensors. A (strongly) paired…

This work is concerned with different aspects of spectrahedra and their projections, sets that are important in semidefinite optimization. We prove results on the limitations of so called Lasserre and theta body relaxation methods for…

We introduce Selective Greedy Equivalence Search (SGES), a restricted version of Greedy Equivalence Search (GES). SGES retains the asymptotic correctness of GES but, unlike GES, has polynomial performance guarantees. In particular, we show…

New sufficient conditions, concerned with the coefficients of harmonic functions $f(z)=h(z)+\bar{g(z)}$ in the open unit disk $\mathbb{U}$ normalized by $f(0)=h(0)=h'(0)-1=0$, for $f(z)$ to be harmonic close-to-convex functions are…