Related papers: Polynomials with Maximum Lead Coefficient Bounded …

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…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…

The main goal of this paper is to characterize limit key polynomials for a valuation $\nu$ on $K[x]$. We consider the set $\Psi_\alpha$ of key polynomials for $\nu$ of degree $\alpha$. We set $p$ be the exponent characteristic of $\nu$. Our…

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$.

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Let M denote the maximal function along the polynomial curve p(t)=(t,t^2,...,t^d) in R^d: M(f)=sup_{r>0} (1/2r) \int_{|t|<r} |f(x-p(t))| dt. We show that the L^2-norm of this operator grows at most logarithmically with the parameter d:…

We provide a bound on the maximum degree of the Jones polynomial of any positive link with second Jones coefficient equal to $\pm 1$. This builds on the result of our previous work, in which we found such a bound for positive fibered links.

Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of…

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…

Let $N=p_1p_2... p_n$ be a product of $n$ distinct primes. Define $P_N(x)$ to be the polynomial $(1-x^N)\prod_{1\leq i<j\leq n}(1-x^{N/(p_ip_j)})/\prod_{i=1}^n (1-x^{N/p_i})$. (When $n=2$, $P_{pq}(x)$ is the $pq$-th cyclotomic polynomial,…

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

Let $S(x,t)$ denote the Weyl sum with associated polynomial $xn + tn^2$. Suppose that $|S(x,t)|$ attains its maximum for given $x$ at $t = t(x)$. We give upper and lower bounds of the same order of magnitude for the $L^p$ norm of…

A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Consider a logharmonic polynomial; that is, a product of the form $p(z)\overline{q(z)}$, where $p$, $q$ are holomorphic polynomials. Assume $q$ is linear and denote by $n$ the degree of $p$. It was recently shown in arXiv:2302.04339…