相关论文: On the bias of cubic polynomials

We initiate a systematic study of nonnegative polynomials $P$ such that $P^k$ is not a sum of squares for any odd $k\geq 1$, calling such $P$ \emph{stubborn}. We develop a new invariant of a real isolated zero of a nonnegative polynomial in…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…

We prove that there is an absolute constant $c > 0$ such that every polynomial $P$ of the form $$P(z) = \sum_{j=0}^{n}{a_jz^j}\,, \quad |a_0| = 1\,, \quad |a_j| \leq M\,, \quad a_j \in \Bbb{C}\,, \quad M \geq 1\,,$$ has at most…

Let $\mathbf{P}^{m}_{b}(x)$ be a $2m+1$-degree polynomial in $x$ and $b \in \mathbb{R}$ \[ \mathbf{P}^{m}_{b}(x) = \sum_{k=0}^{b-1} \sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r \] where $\mathbf{A}_{m,r}$ are real coefficients. In this…

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

A conjecture of Kac states that the polynomial counting the number of absolutely indecomposable representations of a quiver over a finite field with given dimension vector has positive coefficients and furthermore that its constant term is…

The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the…

For the family $P:=x^n+a_1x^{n-1}+\cdots +a_n$ of complex polynomials in the variable $x$ we study its {\em discriminant} $R:=$Res$(P,P',x)$, $R\in \mathbb{C}[a]$, $a=(a_1,\ldots ,a_n)$. When $R$ is regarded as a polynomial in $a_k$, one…

The Jacobian Conjecture states that any locally invertible polynomial system in C^n is globally invertible with polynomial inverse. C. W. Bass et al. (1982) proved a reduction theorem stating that the conjecture is true for any degree of…

The paper deals with root problems for two classes of univariate polynomials both of geometric origin. The first class discussed, the class of Steiner polynomial, consists of polynomials, each associated with a compact convex set V in R^n.…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

We present a necessary and sufficient condition for a cubic polynomial to be positive for all positive reals. We identify the set where the cubic polynomial is nonnegative but not all positive for all positive reals, and explicitly give the…

The following theorem is proved. {\bf Theorem.} {\it Let $P(x) = \sum_{k=0}^{2n} a_k x^k$ be a polynomial with positive coefficients. If the inequalities $\frac{a_{2k+1}^2}{a_{2k}a_{2k+ 2}} < \frac{1}{cos^2(\frac{\pi}{n+2})} $ hold for all…

A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…

We establish the \emph{inverse conjecture for the Gowers norm over finite fields}, which asserts (roughly speaking) that if a bounded function $f: V \to \C$ on a finite-dimensional vector space $V$ over a finite field $\F$ has large Gowers…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…