Let f : z 7→ z + c be a quadratic polynomial whose Julia set J is locallyconnected. We prove that the Brolin measure of the set of biaccessible points in J is zero except when f(z) = z − 2 is the Chebyshev quadratic polynomial for which the corresponding measure is one. §

We give, over a finite field Fq, explicit factorizations into a product of irreducible polynomials, of the cyclotomic polynomials of order 3 · 2, the Dickson polynomials of the first kind of order 3 · 2 and the Dickson polynomials of the second kind of order 3 · 2 − 1.

This article provides an overview of some recent developments in quantum dynamic and spectroscopic calculations using the Chebyshev propagator. It is shown that the Chebyshev operator ( Tk (Ĥ)) can be considered as a discrete cosine type propagator ( cos(kΘ̂)), in which the angle operator ( Θ̂ = arccos Ĥ ) is a single-valued mapping of the scaled Hamiltonian ( Ĥ ) and the order (k) is an effectiv...

This pa per suggests a simple valuation method based on Chebyshev approximation at Chebyshev nodes to value American put options. It is similar to the approach taken in Sullivan (2000), where the option`s continuation region function is estimated by using a Chebyshev polynomial. However, in contrast to Sullivan (2000), the functional is fitted by using Chebyshev nodes. The suggested method is f...

Unions of graph multiplier operators are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators. The proposed method features approximations of the graph multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We...

In this paper 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 generalizations of Chebyshev polynomials. We also derive a new expression for these generalized Chebyshev polynomials for any genus g, from which the coefficients of xn can be found explicitly in terms of the branch points and the recurrence c...

This paper describes new method for the synthesis of four-bar linkages for generating a required input-to-output motion. The synthesis method is based on the direct application of Chebyshev’s Alternation Theorem for the Equation of Freudenstein. By this approach the maximum structural error which corresponds to the best approximation can be estimated in advance. Two comparative examples are her...

The hypergeometric type differential equations of the second order with polynomial coefficients and their systems are considered. The realization of the Lanczos Tau Method with minimal residue is proposed for the approximate solution of the second order differential equations with polynomial coefficients. The scheme of Tau method is extended for the systems of hypergeometric type differential e...

It is well known that high-order finite-difference methods may become unstable due to the presence of boundaries and the imposition of boundary conditions. For uniform grids, Gustafsson, Kreiss, and Sundstrom theory and the summation-by-parts method provide sufficient conditions for stability. For non-uniform grids, clustering of nodes close to the boundaries improves the stability of the resul...

This article considers the extension of V. A. Markov’s theorem for polynomial derivatives to polynomials with unit bound on the closed unit ball of any real normed linear space. We show that this extension is equivalent to an inequality for certain directional derivatives of polynomials in two variables that have unit bound on the Chebyshev nodes. We obtain a sharpening of the Markov inequality...