Related papers: Asymptotics of Chebyshev Polynomials, V. Residual …

Let $\mathbb{P}= \{P_1, \cdots, P_{k}\in \mathbb{R}[y]\}$ be a collection of polynomials with distinct degrees and zero constant terms. We proved that there exists $\epsilon=\epsilon(\mathbb{P})>0$ such that, for any compact set $E \subset…

In this paper we consider sequences of polynomials orthogonal with respect to certain discrete Laguerre-Sobolev inner product, with two perturbations (involving derivatives) located inside the oscillatory region for the classical Laguerre…

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

Let $r_k(N)$ denote the size of the largest subset of $[N] = \{1,\ldots,N\}$ with no $k$-term arithmetic progression. We show that for $k\ge 5$, there exists $c_k>0$ such that \[r_k(N)\ll N\exp(-(\log\log N)^{c_k}).\] Our proof is a…

We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these…

Let $E$ be a homogeneous compact set, for instance a Cantor set of positive length. Further let $\sigma$ be a positive measure with $\text{supp}(\sigma)=E$. Under the condition that the absolutely continuous part of $\sigma$ satisfies a…

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…

This article examines the asymptotic behavior of the Widom factors, denoted $\mathcal{W}_n$, for Chebyshev polynomials of finite unions of Jordan arcs. We prove that, in contrast to Widom's proposal, when dealing with a single smooth Jordan…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

In this paper we study the asymptotic zero distribution of eigenpolynomials for degenerate exactly-solvable operators. We present an explicit conjecture and partial results on the growth of the largest modulus of the roots of the unique and…

Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…

Orthogonalisation of the (ordered) base $\lbrace 1,z^{-1},z,z^{-2},z^{2}, >...c,z^{-k},z^{k},...c \rbrace$ with respect to the real inner product $(f,g) \mapsto \int_{\mathbb{R}}f(s)g(s) \exp (-\mathscr{N} V(s)) \md s$, $\mathscr{N} \in…

We present a geometric approach to the asymptotics of the Legendre polynomials $P_{k,n+1}$, based on the Szeg\"o kernel of the Fermat quadric hypersurface, and leading to complete asymptotic expansions holding on expanding subintervals of…

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 $S=\{p_1,\dots,p_s\}$ be a finite non-empty set of distinct prime numbers, let $f\in \mathbb{Z}[X]$ be a polynomial of degree $n\ge 1$, and let $S'\subseteq S$ be the subset of all $p\in S$ such that $f$ has a root in $\mathbb{Z}_p$.…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…