Related papers: Explicit bounds for composite lacunary polynomials

We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

We prove that for any even algebraic polynomial $p$ one can find a cosine polynomial with an arbitrary small $l_1$-norm of coefficients such that the first coefficients of its representation as an algebraic polynomial in $\cos x$ coincide…

In this paper, we introduce h(x)-Fibonacci polynomials in an arbitrary finite-dimensional unitary algebra over a field K (K = R,C), which generalize both h(x)-Fibonacci quaternion polynomials and h(x)-Fibonacci octonion polynomials. For…

The valence of a function f at a point $z_0$ is the number of distinct, finite solutions to $f(z) = z_0.$ In this paper, we bound the valence of complex-valued harmonic polynomials in the plane for some special harmonic polynomials of the…

We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…

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 integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

Suppose that h in F[x,y,z], char F=2, defines a nodal cubic. In earlier papers we made a precise conjecture as to the Hilbert-Kunz functions attached to the powers of h. Assuming this conjecture we showed that a class of characteristic 2…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

In this paper, we study polynomials of the form $f(x)=(x^n+x^{n-1}+...+1)^l$ for $l=1,2,3,4$ to generate a pattern titled "unique coefficient pattern". Namely, we analyze each unique coefficient patterns of $f(x)$ and generate functions…

Explicit formulae for the B\'ezier coefficients of the constrained dual Bernstein basis polynomials are derived in terms of the Hahn orthogonal polynomials. Using difference properties of the latter polynomials, efficient recursive scheme…

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…

Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…