Related papers: A solid angle polynomial with negative coefficient…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of sparse polynomials. In particular, nonnegativity is characterized…
In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with…
We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…
Let $\mathbb{Z}_p[x]$ be the set of all functions whose coefficients are in the field of $p$-adic integers $\mathbb{Z}_p$. This work considers a problem of finding a root of a polynomial equation $P(x)=0$ where $P(x)\in\mathbb{Z}_p[x]$. The…
This paper is now part of the new paper "Series with Hermite polynomials and applications" arXiv:1710.00687.
This paper has been withdrawn by the author.
In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…
We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…
We establish an analogue of the Goldbach conjecture for Laurent polynomials with positive integer coefficients.
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…
We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…
We derive a large deviation principle for the empirical measure of zeros of random polynomials with i.i.d. exponential coefficients.
In this article, we consider weighted sums of generalized polygonal numbers with coefficients $1$ or $2$. We show that for any $m\ge10$, those weighted sums of generalized $m$-gonal numbers represent every non-negative integers if they only…
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…
This paper has been withdrawn by the author because overcame by arXiv:0910.4694
We investigate the recurrence coefficients of discrete orthogonal polynomials on the non-negative integers with hypergeometric weights and show that they satisfy a system of non-linear difference equations and a non-linear second order…
In this paper, we obtain an annulus containing all the zeros of the polynomial involving binomial coefficients and generalized Fibonacci numbers. Our result generalize some of the recently obtained results in this direction.
The interior angle vector ($\widehat{\alpha}$-vector) of a polytope is a metric analogue of the $f$-vector in which faces are weighted by their solid angle. For simplicial polytopes, Dehn-Sommerville-type relations on the…
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…