Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

Romanovski polynomials in selected physics problems

We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.     

Differentiators and the geometry of polynomials

In 1959, Davis introduced the concept of a differentiator of an operator on a finite-dimensional Hilbert space. We prove that every such operator possesses a differentiator. We also use the theory of differentiators to solve several problems in the geometry of polynomials. For instance, we answer in the affirmative a twenty year old unsolved conjecture of Schoenberg, a related conjecture of Katsoprinakis and a fifty year old unsolved conjecture of De Bruijn and Springer.     

变换中含有孤立稳定点的第二积分换元定理

在不定积分第二积分换元定理的条件中,要求变换x=φ(t)不含有稳定点,即:φ′(t)≠0.当变换x=φ(t)中含有孤立稳定点时,给出了变换中含有孤立稳定点的第二积分换元定理.拓宽了第二积分换元定理的应用范围.     

Co-Orthogonal Codes

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.     

Lattice animals: Supplementation of perimeter polynomial data by graph-theoretic methods

Application of graph-theoretic methods to new perimeter polynomials for connected clusters on a lattice yields extra data on the total number of clusters and for the coefficients in the series expansion for the mean size of clusters at low densities. The lattices studied are the square, the square with next nearest neighbors, the triangular, and the simple cubic.     

（0,1;0）-INTERPOLATION ON INFINITE INTERVAL （-∞, ＋∞）

In this paper, we study the explicit representation and convergence of （0, 1;0）-interpolation on infisite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values areprescribed at two set of points namely the zeros of Hn（x） and H′n （x） and the first derivatives at the zerosof H′n（x）.     

On irreversibility of von Neumann additive cellular automata on grids

The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids (σ⁺-automata). This question is partially answered here with the proposal of a sufficient condition for the irreversibility of σ⁺-automata.     

Asymptotic Behavior of Sobolev-Type Orthogonal Polynomials on a Rectifiable Jordan Curve or Arc

Our object of study is the asymptotic behavior of the sequence of polynomials orthogonal with respect to the discrete Sobolev inner product <formula> \langle f, g \rangle = ∈t_{E} f(ξ) \overline{g(ξ)} ρ(ξ) |d ξ|+ f(Z) A g(Z)^H, </formula> where E is a rectifiable Jordan curve or arc in the complex plane f(Z) = (f(z_1), \ldots, f^{(l_1)}(z_1) , \ldots , f(z_m) , \ldots ,f^{(l_m)}(z_m)), A is an M \times M Hermitian matrix, M l ₁ + ⋅s + l _m + m , |d ξ| denotes the arc length measure, ρ is a nonnegative function on E , and z _i ∈Ω, i=1,2,\ldots,m , where Ω is the exterior region to E . July 23, 1999. Dates revised: September 11, 2000 and February 16, 2001. Date accepted: February 26, 2001.     

一种拟Grünwald插值算子的L_p收敛速度

1引言 2006年3月 高等学校计算数学学报 设f(x)为卜1，1}上的连续函数，则以第二类Chebyshev多项式认(x)(Un(eoso)= 烈共坐)的全部零点{ 乙工工1口 式为 其中 k x无=Cos了一下丁7r 了L十1 犷_，为插值结点组的了的Gr如wald插值多项 G。(，，x)=艺了(x、)‘孟(x)， n. 11 一一 k