On a Class of Polynomials with Integer Coefficients

Univalent harmonic mappings with integer or half-integer coefficients

Let ${\mathcal S}$ denote the set of all univalent analytic functions $f(z)=z+\sum_{n=2}^{\infty}a_n z^n$ on the unit disk $|z|<1$. In 1946 B. Friedman found that the set $\mathcal S$ of those functions which have integer coefficients consists of only nine functions. In a recent paper Hiranuma and Sugawa proved that the similar set obtained for the functions with half-integer coefficients consists of twelve functions in addition to the nine. In this paper, the main aim is to discuss the class of all sense-preserving univalent harmonic mappings $f$ on the unit disk with integer or half-integer …

On Hurwitz stable polynomials with integer coefficients

Let H(N) denote the set of all polynomials with positive integer coefficients which have their zeros in the open left half-plane. We are looking for polynomials in H(N) whose largest coefficients are as small as possible and also for polynomials in H(N) with minimal sum of the coefficients. Let h(N) and s(N) denote these minimal values. Using Fekete's subadditive lemma we show that the N-th square roots of h(N) and s(N) have a limit as N goes to infinity and that these two limits coincide. We also derive tight bounds for the common value of the limits.

Small polynomials with integer coefficients

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials. Their factors, zero distribution and asymptotics are the main subjects of this paper. In particular, we show that the integer Chebyshev polynomials for any infinite subset of the real line must have infinitely many distinct factors, which answers a question of Borwein and Erdélyi. Furthermore, it is proved that the accumulation set for their zeros must be of po…

满足增长约束的整值多项式

Integer-valued polynomials satisfying growth constraints

针对整值多项式（IVPs）的增长约束问题，本文给出了具指数增长阈值的IVPs数量的更精细估计，并研究整数上非对称增长条件的类似问题，发现其临界阈值由显式域的对数容量确定。