A method of constructing Krall's polynomials

We propose a method of constructing orthogonal polynomials P_n(x) (Krall's polynomials) that are eigenfunctions of higher-order differential operators. Using this method we show that recurrence coefficients of Krall's polynomials P_n(x) are rational functions of n. Let P_n^(a,b;M)(x) be polynomials obtained from the Jacobi polynomials P_n^(a,b)(x) by the following procedure. We add an arbitrary concentrated mass M at the endpoint of the orthogonality interval with respect to the weight function of the ordinary Jacobi polynomials. We find necessary conditions for the parameters a,b in order for the polynomials P_n^(a,b;M)(x) to obey a higher-order differential equation. The main result of the paper is the following. Let a be a positive integer and b⩾−1/2 an arbitrary real parameter. Then the polynomials P_n^(a,b;M)(x) are Krall's polynomials satisfying a differential equation of order 2a+4.     

Polynomial sums over automorphs of a positive definite binary quadratic form

Let P(X) be a homogeneous polynomial in X = (x, y), Q(X) a positive definite integral binary quadratic form, and G the group of integral automorphs of Q(X). Let A(m) = {N ∈ $\text{Z}$ × $\text{Z}$ : Q(N) = m}. It is shown that if Σ_N∈A(m)P(N) = 0 for each m = 1, 2, 3,… then Σ_U∈GP(UX) ≡ 0.     

Weighted Least Square Convergence of Lagrange Interpolation on the Unit Circle

In the paper, a result of Walsh and Sharma on least square convergence of Lagrange interpolation polynomials based on the n-th roots of unity is extended to Lagrange interpolation on the sets obtained by projecting vertically the zeros of (1-x)²=P ^(a,β) _n(x),a>0,β>0,(1-x)P^(a,β) _n(x),a>0,β>-1,(1+x)P P^(a,β) _n(x),a>-1,β0 and P^(a,β) _n(x),a>-1,β>-1, respectively, onto the unit circle, where P^(a,β) _n(x),a>-1,β>-1, stands for the n-th Jacobi polynomial. Moreover, a result of Saff and Walsh is also extended.     

A companion matrix analogue for orthogonal polynomials

Given a set of orthogonal polynomials {P_i(x)}, it is shown that associated with a polynomial a(x)=∑a_ip_i(x) there is a matrix A which possesses several of the properties of the usual companion form matrix C. An alternative and possibly preferable form A' is also suggested. A similarity transformation between A [orA'] and C is given. If b(x) is another polynomial then the matrix b(A) [or b(A')] has properties like those of b(C), relating to the greatest common divisor of a(x) and b(x).     

Nonlinear functional equations satisfied by orthogonal polynomials

Let c be a linear functional defined by its moments c(xⁱ)=c_i for i=0,1,…. We proved that the nonlinear functional equations P(t)=c(P(x)P(αx+t)) and P(t)=c(P(x)P(xt)) admit polynomial solutions which are the polynomials belonging to the family of formal orthogonal polynomials with respect to a linear functional related to c. This equation relates the polynomials of the family with those of the scaled and shifted family. Other types of nonlinear functional equations whose solutions are formal orthogonal polynomials are also presented. Applications to Legendre and Chebyshev polynomials are given. Then, orthogonality with respect to a definite inner product is studied. When c is an integral functional with respect to a weight function, the preceding functional equations are nonlinear integral equations, and these results lead to new characterizations of orthogonal polynomials on the real line, on the unit circle, and, more generally, on an algebraic curve.     

Permutation Polynomials Modulo 2w

We give an exact characterization of permutation polynomials modulo n=2^w, w≥2: a polynomial P(x)=a₀+a₁x +···+a_dx^d with integral coefficients is a permutation polynomial modulo n if and only if a₁ is odd, (a₂+a₄+a₆+···) is even, and (a₃+a₅+a₇+···) is even. We also characterize polynomials defining latin squares modulo n=2^w, but prove that polynomial multipermutations (that is, a pair of polynomials defining a pair of orthogonal latin squares) modulo n=2^wdo not exist.     

The Virtual Poincaré Polynomials of Homogeneous Spaces

We factor the virtual Poincaré polynomial of every homogeneous space G/H, where G is a complex connected linear algebraic group and H is an algebraic subgroup, as t^2u (t²–1)^r Q_G/H(t²) for a polynomial Q_G/H with nonnegative integer coefficients. Moreover, we show that Q_G/H(t²) divides the virtual Poincaré polynomial of every regular embedding of G/H, if H is connected.     

Continuous symmetrized Sobolev inner products of order N (I)

Given a symmetrized Sobolev inner product of order N, the corresponding sequence of monic orthogonal polynomials {Qn} satisfies that Q2n(x)=Pn(x²), Q2n+1(x)=xRn(x²) for certain sequences of monic polynomials {Pn} and {Rn}. In this paper, we deduce the integral representation of the inner products such that {Pn} and {Rn} are the corresponding sequences of orthogonal polynomials. Moreover, we state a relation between both inner products which extends the classical result for symmetric linear functionals.     

Oscillation of partial difference equations with continuous variables

In this paper, we consider the partial difference equation with continuous variables of the form P₁z(x + a, y + b) + p₂z (x + a, y) + p₃z (x, y + b) − p₄z (x, y) + P (x, y) z (x − τ, y − σ) = 0, where P ϵ C(R⁺ × R⁺, R⁺ − {0}), a, b, τ, σ are real numbers and p_i (i = 1, 2, 3, 4) are nonnegative constants. Some sufficient conditions for all solutions of this equation to be oscillatory are obtained.     

Mixed interpolation methods with arbitrary nodes

Previous work on interpolation by linear combinations of the form aC(x) + bS(x) + ∑_i=0ⁿ⁻²α_ixⁱ, where C and S are given functions and the coefficients a, b, and {α_j} are determined by the interpolation conditions, was restricted to uniformly spaced interpolation nodes. Here we derive both Newtonian and Lagrangian formulae for the interpolant for arbitrarily chosen distinct nodes. In the Newtonian form the interpolating function is expressed as the sum of the interpolating polynomial based on the given nodes and two correction terms involving an auxiliary function for which a recurrence relation is obtained. Each canonical function for the Lagrangian form may be expressed as a product of the corresponding Lagrange polynomial and a function which depends on divided differences of C(x) and S(x).     

The numerical solution of fredholm integral equations with rapidly varying kernels

Approximating a solution to the Fredholm integral equation ø(x)=α(x) + ∫ ^b_aK(x, y)ø(y) dy by the Nyström method involves some numerical quadrature for approximating the integral, producing a linear system satisfied by approximate function values of ø. This paper discusses the use of generalized product-interpolatory formulas which model ø as one mth-degree polynomial on each subinterval and model K as a (possibly large) sequence of nth-degree polynomials. In cases where K is varying much more rapidly than ø this allows for ø to be sampled much less often than K. Since K is modeled as a sequence of polynomials, its frequent sampling does not require a prohibitive increase in the degree of the interpolating polynomials. Coefficient formulas and examples are given for the (m,n) cases (1,1), (1,2), (2,1) and (2,2).     

On the structure of cluster point sets of iteratively generated sequences

LetX be a closed subset of a topological spaceF; leta(·) be a continuous map fromX intoX; let {x _i} be a sequence generated iteratively bya(·) fromx ₀ inX, i.e.,x _i+1 =a(x _i),i=0, 1, 2, ...; and letQ(x ₀) be the cluster point set of {x _i}. In this paper, we prove that, if there exists a pointz inQ(x ₀) such that (i)z is isolated with respect toQ(x ₀), (ii)z is a periodic point ofa(·) of periodp, and (iii)z possesses a sequentially compact neighborhood, then (iv)Q(x ₀) containsp points, (v) the sequence {x _i} is contained in a sequentially compact set, and (vi) every point inQ(x ₀) possesses properties (i) and (ii). The application of the preceding results to the caseF=E ⁿ leads to the following: (vii) ifQ(x ₀) contains one and only one point, then {x _i} converges; (viii) ifQ(x ₀) contains a finite number of points, then {x _i} is bounded; and (ix) ifQ(x ₀) containsp points, then every point inQ(x ₀) is a periodic point ofa(·) of periodp.     

On polynomials orthogonal to all powers of a given polynomial on a segment

In this paper we investigate the following “polynomial moment problem”: for a given complex polynomial P(z) and distinct a,b∈C to describe polynomials q(z) orthogonal to all powers of P(z) on [a,b]. We show that for given P(z), q(z) the condition that q(z) is orthogonal to all powers of P(z) is equivalent to the condition that branches of the algebraic function Q(P⁻¹(z)), where , satisfy a certain system of linear equations over Z. On this base we provide the solution of the polynomial moment problem for wide classes of polynomials. In particular, we give the complete solution for polynomials of degree less than 10.     

An approximation technique for nonlinear integral operations

Approximation results for J. S. Mac Nerney's theory of nonlinear integral operations are established. For the nonlinear product integral _xΠ^y (1 + V)P, approximations of the form Π_{i = 1}ⁿ [1 + L_q(x_i?1, x_i)]P are considered, where L₁(u, v)P = ∝_u^vVP and L_q(u, v)P = ∝_u^vV(r, s)[1 + L_q?1(s, v)]P for q = 2, 3,…. Error bounds are obtained for the difference between the product integral and the preceding product.     

A new family of Padé-type approximants in

This paper gives the definition and some properties of a new family of Padé-type approximants (PTA) for k-variate formal power series (FPS). These PTA have the form P(t)/Q(t) where Q(t) = Π^r_{i = 0}(1 ? x(i)·t), {x(i), 0 ? i ? r} being a given set of points in

, and x·t is the scalar product of x and t in

. Some results about the approximation order, the unicity and some invariance properties of these PTA are proved together with a convergence result when the FPS is defined by a Stieltjes integral.     

A group of integral points in a matrix parallelepiped

Let A be an n×n integral matrix with determinant D>0, and let P(A) be the n-parallelepiped determined by the columns {A_i}ⁿ_i=1 of A,

$\text{P(A)=}\text{∑}\text{i=1}\text{n}\text{x}{}_{\mathrm{i}}\text{A}{}_{\mathrm{i}}\text{0<x}{}_{\mathrm{i}}\text{<1}$

Let L be the set of integral vectors in P(A), and let G(A) be the subset of L consisting of vectors whose coefficients x_i satisfy 0?x_i<1. We show that G(A), equipped with addition modulo 1 on the coefficients x_i, is an Abelian group of order D, whose invariant factors are the invariant factors of the integral matrix A. We give a formula for |L|, and show that |L| is not a similarity invariant.     

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 a partition problem of Frobenius

We consider the following problem, which was raised by Frobenius: Given n relatively prime positive integers, what is the largest integer M(a₁, a₂, …, a_n) omitted by the linear form Σ_i=1ⁿa_ix_i, where the x_i are variable nonnegative integers. We give the solution for certain special cases when n = 3.     

Polynomial addition sets and polynomial digraphs

Let G be a group of order v, and f(x) be a nonzero integral polynomial. A (v, k, f(x))-polynomial addition set in G is a subset D of G with k distinct elements such that f(Σ_d∈Dd) = λΣ_g∈Gg for some integer λ. We discuss some general properties of polynomial addition sets. The relation between polynomial addition sets and polynomial Cayley digraphs is studied and, in particular, some new results on Cayley xⁿ-digraphs and strongly regular Cayley graphs are obtained. Finally, a complete list of polynomial addition sets with certain restrictions on parameters is given.