Related papers: On the bad points of positive semidefinite polynom…
A variant of the Archimedean Positivstellensatz is proved which is based on Archimedean semirings or quadratic modules of generating subalgebras. It allows one to obtain representations of strictly positive polynomials on compact…
In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…
We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…
We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…
The first part of this paper is devoted to an analysis of moment problems in R^n with supports contained in a closed set defined by finitely many polynomial inequalities. The second part of the paper uses the representation results of…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
We prove that every Diophantine quadruple in $\mathbb{R}[X]$ is regular. More precisely, we prove that if $\{a, b, c, d\}$ is a set of four non-zero polynomials from $\mathbb{R}[X]$, not all constant, such that the product of any two of its…
Using an elementary identity, we prove that for infinitely many polynomials $P(x)\in \mathbb{Z}[X]$ of fourth degree, the equation $\prod\limits_{k=1}^{n}P(k)=y^2$ has finitely many solutions in $\mathbb{Z}$. We also give an example of a…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.
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…
The purpose of this article is twofold. On the one hand, we prove asymptotic formulas for the quantitative distribution of rational points on any smooth non-split projective quadratic surface. We obtain the optimal error term for the real…
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…
It is well known that the sum of points of the period five cycle of the quadratic polynomial $f_{c}(x)=x^{2}+c$ is generally not one-valued. In this paper we will show that the sum of cycle points of the curves of period five is at most…
We study dimensions of the faces of the cone of nonnegative polynomials and the cone of sums of squares; we show that there are dimensional differences between corresponding faces of these cones. These dimensional gaps occur in all cases…
We study the set of common F_q-rational zeros of systems of multivariate symmetric polynomials with coefficients in a finite field F_q. We establish certain properties on these polynomials which imply that the corresponding set of zeros…
We study self-morphisms of smooth real projective algebraic curves that have only real periodic points. In the case of the projective line we provide a convenient characterization of such morphisms. We derive a semialgebraic description of…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
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$…
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…