Related papers: A sparse version of Reznick's Positivstellensatz

The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…

We present an example of a strictly positive polynomial with rational coefficients that can be decomposed as a sum of squares of polynomials over $\R$ but not over $\Q$. This answers an open question by C. Scheiderer posed as the second…

A polynomial that is nonnegative over a given interval is called a positive polynomial. The set of such positive polynomials forms a closed convex cone $K$. In this paper, we consider the likelihood ratio test for the hypothesis of…

T. M. Bisgaard proved that the $*$-algebra ${\bf C}[z,\overline{z},1/z\overline{z}]$ has the moment property, that is, each positive linear functional on this $*$-algebra is a moment functional. We generalize this result to polynomials in…

Consider the problem of minimizing a polynomial $f$ over a compact semialgebraic set ${\mathbf{X} \subseteq \mathbb{R}^n}$. Lasserre introduces hierarchies of semidefinite programs to approximate this hard optimization problem, based on…

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

We consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a square subsystem. We give several approaches that certifiably select which…

Assume that $n$ is a positive integer, $p_{j}$ ($j=1,2, \cdots, 6)$ are polynomials, $p$ is an irreducible polynomial, and $f$ is an entire function on $\mathbb{C}^{n}.$ Let $ L(f)=\sum_{j=1}^s q_{t_j}f_{z_{t_j}}$ and…

In this paper, we study the probability that some weighted partial sums of a random multiplicative function $f$ are positive. Applying the characteristic decomposition, we obtain that if $S$ is a non-empty subset of the multiplicative…

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Suppose that $k$ and $N$ are positive integers. Let $f$ be a newform on $\Gamma_0(N)$ of weight $k$ with $L$-function $L_f(s)$. Previous works have studied the zeros of the period polynomial $r_f(z)$, which is a generating function for the…

Given rational univariate polynomials f and g such that gcd(f, g) and f / gcd(f, g) are relatively prime, we show that g is non-negative on all the real roots of f if and only if g is a sum of squares of rational polynomials modulo f. We…

We provide explicit conditions for a real polynomial $f$ of degree 2d to be a sum of squares (s.o.s.), stated only in terms of the coefficients of $f$, i.e. with no lifting. All conditions are simple and provide an explicit description of a…

We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…

Ismail et al. (Constr. Approx. {\bf 15} (1999) 69--81) proved the positivity of some trigonometric polynomials with single binomial coefficients. In this paper, we prove some similar results by replacing the binomial coefficients with…

We prove a formula expressing the Kerov polynomial $\Sigma_k$ as a weighted sum over the lattice of noncrossing partitions of the set $\{1,...,k+1\}$. In particular, such a formula is related to a partial order $\mirr$ on the Lehner's…

Let $x \in \mathbb{R}$ be arbitrary and consider the `greedy' approximation of $x$ by signed harmonic sums: given $a_n = \sum_{k \leq n} \varepsilon_k/k$ with $\varepsilon_k \in \left\{-1,1\right\}$, we set $\varepsilon_{n+1} = 1$ if $a_n…

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

For a polynomial $f(x)$ in $(\mathbb{Z}_p\cap \mathbb{Q})[x]$ of degree $d>2$ let $L(f \bmod p;T)$ be the $L$-function of the exponential sum of $f \bmod p$. Let $\mathrm{NP}(f \bmod p)$ denote the Newton polygon of $L(f \bmod p;T)$. Let…