Polynomials of Least Deviation from Zero in Sobolev p-Norm

The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev p-norm ($$1<p<\infty $$ 1 < p < ∞ ) for the case $$p=1$$ p = 1 . Some relevant examples are indicated. The second part deals with the location of zeros of polynomials of least deviation in discrete Sobolev p-norm. The asymptotic distribution of zeros is established on general conditions. Under some order restriction in the discrete part, we prove that the n-th polynomial of least deviation has at least $$n-\mathbf {d}^*$$ n - d ∗ zeros on the convex hull of the support of the measure, where $$\mathbf {d}^*$$ d ∗ denotes the number of terms in the discrete part.

On the growth and zeros of polynomials attached to arithmetic functions

In this paper we investigate growth properties and the zero distribution of polynomials attached to arithmetic functions g and h, where g is normalized, of moderate growth, and $$0<h(n) \le h(n+1)$$ 0 < h ( n ) ≤ h ( n + 1 ) . We put $$P_0^{g,h}(x)=1$$ P 0 g , h ( x ) = 1 and $$\begin{aligned} P_n^{g,h}(x) := \frac{x}{h(n)} \sum _{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{aligned}$$ P n g , h ( x ) : = x h ( n ) ∑ k = 1 n g ( k ) P n - k g , h ( x ) . As an application we obtain the best known result on the domain of the non-vanishing of the Fourier coefficients of powers of the Dedekind $$\eta $$ η -function. Here, g is the sum of divisors and h the identity function. Kostant’s result on the representation of simple complex Lie algebras and Han’s results on the Nekrasov–Okounkov hook length formula are extended. The polynomials are related to reciprocals of Eisenstein series, Klein’s j-invariant, and Chebyshev polynomials of the second kind.

Orbit Growth of Shift Spaces Induced by Bouquet Graphs and Dyck Shifts

For a discrete dynamical system, the prime orbit and Mertens’ orbit counting functions describe the growth of its closed orbits in a certain way. The asymptotic behaviours of these counting functions can be determined via Artin–Mazur zeta function of the system. Specifically, the existence of a non-vanishing meromorphic extension of the zeta function leads to certain asymptotic results. In this paper, we prove the asymptotic behaviours of the counting functions for a certain type of shift spaces induced by directed bouquet graphs and Dyck shifts. We call these shift spaces as the bouquet-Dyck shifts. Since their respective zeta function involves square roots of polynomials, the meromorphic extension is difficult to be obtained. To overcome this obstacle, we employ some theories on zeros of polynomials, including the well-known Eneström–Kakeya Theorem in complex analysis. Finally, the meromorphic extension will imply the desired asymptotic results.

AN ITERATIVE FORMULA FOR SIMULTANEOUS LOCATION OF THE ZEROS OF A POLYNOMIAL

Needless to say that the search for efficient algorithms for determining zeros of polynomials has been continually raised in many applications. In this paper we give a cubic iteration method for determining simultaneously all the zeros of a polynomial – assumed distinct – starting with ‘reasonably close’ initial approximations – also assumed distinct. The polynomial – in question – is expressed in its Taylor series expansion in terms of the initial approximations and their correction terms. A formula with cubic rate of convergence – based on retaining terms up to 2ndorder of the expansion in the correction terms – is derived.