Extremely weakly unconditionally convergent series

It is proved that if Σ _i=1 ^∞ X _i is a non-convergent series in a Banach spaceX such that Σ _i=1 ^∞ |f(X _i )|<∞ for all extreme pointsf of the unit ball ofX*, thenX contains a subspace isomorphic toc ₀, improving a result of Bessaga and Pelczynski. The proof uses Fonf’s result that Lindenstrauss-Phelps spaces contain isomorphs ofc ₀. Supported in part by NSF-MCS-8002393.     

On p-convergent Operators on Banach Lattices

The notion of a p-convergent operator on a Banach space was originally introduced in 1993 by Castillo and S′anchez in the paper entitled "Dunford–Pettis-like properties of continuous vector function spaces". In the present paper we consider the p-convergent operators on Banach lattices, prove some domination properties of the same and consider their applications(together with the notion of a weak p-convergent operator, which we introduce in the present paper) to a study of the Schur property of order p. Also, the notion of a disjoint p-convergent operator on Banach lattices is introduced, studied and its applications to a study of the positive Schur property of order p are considered.     

An unconditionally convergent method for computing zeros of splines and polynomials

We present a simple and efficient method for computing zeros of spline functions. The method exploits the close relationship between a spline and its control polygon and is based on repeated knot insertion. Like Newton's method it is quadratically convergent, but the new method overcomes the principal problem with Newton's method in that it always converges and no starting value needs to be supplied by the user.

     

Characterizations of completeness of normed spaces through weakly unconditionally Cauchy series

In this paper we obtain two new characterizations of completeness of a normed space through the behaviour of its weakly unconditionally Cauchy series. We also prove that barrelledness of a normed space X can be characterized through the behaviour of its weakly-* unconditionally Cauchy series in X*.     

New unconditionally stable scheme for telegraph equation based on weighted Laguerre polynomials

This article proposes a new unconditionally stable scheme to solve one‐dimensional telegraph equation using weighted Laguerre polynomials. Unlike other numerical schemes, the time derivatives in the equation can be expanded analytically based on the Laguerre polynomials and basis functions. By applying a Galerkin temporal testing procedure and using the orthogonal property of weighted Laguerre polynomials, the time variable can be eliminated from computations, which results in an implicit equation. After solving the equation recursively one can obtain the numerical results of telegraph equation by using the expanded coefficients. Some numerical examples are considered to validate the accuracy and stability of this proposed scheme, and the results are compared with some existing numerical schemes.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1603–1615, 2017     

On Eisenstein polynomials and zeta polynomials

Eisenstein polynomials, which were defined by Oura, are analogues of the concept of an Eisenstein series. Oura conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In this paper, we provide new analogous properties of Eisenstein polynomials and zeta polynomials. These properties are finite analogies of certain properties of Eisenstein series.     

On difference polynomials and hereditarily irreducible polynomials

A difference polynomial is one of the form P(x, y) = p(x) ? q(y). Another proof is given of the fact that every difference polynomial has a connected zero set, and this theorem is applied to give an irreducibility criterion for difference polynomials. Some earlier problems about hereditarily irreducible polynomials (HIPs) are solved. For example, P(x, y) is called a HIP (two-variable case) if P(a(x), b(y)) is always irreducible, and it is shown that such two-variable HIPs actually exist.     

On Kernel polynomials and self-perturbation of orthogonal polynomials

Given an orthogonal polynomial system {Q _n (x)} _n=0 ^∞, define another polynomial system by where α _n are complex numbers and t is a positive integer. We find conditions for {P _n (x)} _n=0 ^∞ to be an orthogonal polynomial system. When t=1 and α₁≠0, it turns out that {Q _n (x)} _n=0 ^∞ must be kernel polynomials for {P _n (x)} _n=0 ^∞ for which we study, in detail, the location of zeros and semi-classical character. Received: November 25, 1999; in final form: April 6, 2000?Published online: June 22, 2001     

关于勒让德多项式与契贝谢夫多项式间的关系

主要研究勒让德多项式与契贝谢夫多项式之间的关系的性质,利用生成函数和函数级数展开的方法,得出了勒让德多项式与契贝谢夫多项式之间的一个重要关系,这对勒让德多项式与契贝谢夫多项式的研究有一定的推动作用．     

Ideals of homogeneous polynomials and weakly compact approximation property in Banach spaces

We show that a Banach space E has the weakly compact approximation property if and only if each continuous Banach-valued polynomial on E can be uniformly approximated on compact sets by homogeneous polynomials which are members of the ideal of homogeneous polynomials generated by weakly compact linear operators. An analogous result is established also for the compact approximation property.     

Cohen positive strongly p-summing and p-convex multilinear operators

The aim of this work is to give and study the notion of Cohen positive p-summing multilinear operators. We prove a natural analog of the Pietsch domination theorem for these classes and characterize their conjugates. As an application, we generalize a result due to Bu and Shi (J. Math. Anal. Appl. 401:174–181, 2013), and we compare this class with the class of multiple p-convex m-linear operators.

     

On self-reciprocal polynomials

In this paper we establish a sharp result concerning integral mean estimates for self-reciprocal polynomials.     

On incomplete polynomials

Approximation of a monomial by incomplete polynomials was the subject of several investigations. Here the setting is inverted (approximating a polynomial by monomials) and generalized (approximating a polynomial by incomplete polynomials).