Related papers: Improved Bounds on Sarkozy's Theorem for Quadratic…

We improve the Cauchy radius of both scalar and matrix polynomials, which is an upper bound on the moduli of the zeros and eigenvalues, respectively, by using appropriate polynomial multipliers.

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

D. Dimitrov has posed the problem of finding polynomials that set the sharpness of the Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal. We disprove Dimitrov's conjecture for polynomials of degree 3,…

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…

We consider the quadratic optimization problem $\max_{x \in C}\ x^T Q x + q^T x$, where $C\subseteq\mathbb{R}^n$ is a box and $r := \mathrm{rank}(Q)$ is assumed to be $\mathcal{O}(1)$ (i.e., fixed). We show that this case can be solved in…

We obtain new estimates on the level of distribution of the set $\{Q(n)\}$ where $Q\in{\mathbb Z}[X]$ is irreducible quadratic, for well-factorable moduli, improving a result due to Iwaniec. As a by-product of our arguments, we study the…

We extend Sullivan's complex a priori bounds to real quadratic polynomials with essentially bounded combinatorics. Combined with the previous results of the first author, this yields complex bounds for all real quadratics. Local…

We sharpen the bound $n^{2k}$ on the maximum modulus of the $k^{{\rm th}}$ radial derivative of the Zernike circle polynomials (disk polynomials) of degree $n$ to $n^2(n^2-1^2)\cdot ... \cdot(n^2-(k-1)^2)/2^k(1/2)_k$. This bound is obtained…

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

We study the boundary of the cone of real polynomials that can be decomposed as a sum of squares (SOS) of real polynomials. This cone is included in the cone of nonnegative polynomials and both cones share a part of their boundary, which…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

We find a new lower bound for the maximal number of zeros to harmonic polynomials, $p(z)+\overline{q(z)}$, when ${\rm deg}\, p = n$ and ${\rm deg}\, q = n-2$.

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

For positive integers $n$, the truncated binomial expansions of $(1+x)^n$ which consist of all the terms of degree $\le r$ where $1 \le r \le n-2$ appear always to be irreducible. For fixed $r$ and $n$ sufficiently large, this is known to…

We present an elementary proof that the Schur polynomial corresponding to an increasing sequence of exponents (c_0,..., c_{n-1}) with c_0 = 0 is irreducible over every field of characteristic p whenever the numbers d_i = c_{i+1} - c_i are…

We give an example of a polynomial of degree 4 in 5 variables that is the sum of squares of 8 polynomials and cannot be decomposed as the sum of 7 squares. This improves the current existing lower bound of 7 polynomials for the Pythagoras…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

Continuing the line of thought of an earlier work, we provide the first infinite family of quadratic number fields with everywhere unramified Galois extensions of Galois group $SL_2(5)$, the (unique) smallest nonsolvable group for which…