Christoffel-Darboux-type formulae and a recurrence for biorthogonal polynomials

It is proved that biorthogonal polynomials obey two different kinds of Christoffel-Darboux-type formulae, one linking polynomials with a different parameter and one combining polynomials with different degrees. This is used to produce a mixed recurrence relation, which is valid for all biorthogonal polynomials. This recurrence relation establishes several results on interlacing property of zeros of successive biorthogonal polynomials and leads to a new result on the interlace of zeros of orthogonal polynomials (of equal degrees) with respect to two distributionsdψ(x) andx ^p dψ(x), 0<p≤1, with support in either [0, 1] or [1, ∞).     

Deterministic sampling of sparse trigonometric polynomials

One can recover sparse multivariate trigonometric polynomials from a few randomly taken samples with high probability (as shown by Kunis and Rauhut). We give a deterministic sampling of multivariate trigonometric polynomials inspired by Weil’s exponential sum. Our sampling can produce a deterministic matrix satisfying the statistical restricted isometry property, and also nearly optimal Grassmannian frames. We show that one can exactly reconstruct every M-sparse multivariate trigonometric polynomial with fixed degree and of length D from the determinant sampling X, using the orthogonal matching pursuit, and with |X| a prime number greater than (MlogD)². This result is optimal within the (logD)² factor. The simulations show that the deterministic sampling can offer reconstruction performance similar to the random sampling.     

A note on the kernels of higher derivations

Let k ? k′ be a field extension. We give relations between the kernels of higher derivations on k[X] and k′[X], where k[X]:= k[x ₁,…, x _n ] denotes the polynomial ring in n variables over the field k. More precisely, let D = {D _n } _n=0 ^∞ a higher k-derivation on k[X] and D′ = {D′ _n } _n=0 ^∞ a higher k′-derivation on k′[X] such that D′ _m (x _i ) = D _m (x _i ) for all m ? 0 and i = 1, 2,…, n. Then (1) k[X] ^D = k if and only if k′[X] ^D′ = k′; (2) k[X] ^D is a finitely generated k-algebra if and only if k′[X] ^D′ is a finitely generated k′-algebra. Furthermore, we also show that the kernel k[X] ^D of a higher derivation D of k[X] can be generated by a set of closed polynomials.     

On the geometry of generalized quadrics

Let {f₀,…,f_n;g₀,…,g_n} be a sequence of homogeneous polynomials in 2n+2 variables with no common zeros in P²ⁿ⁺¹ and suppose that the degrees of the polynomials are such that is a homogeneous polynomial. We shall refer to the hypersurface X defined by Q as a generalized quadric. In this note, we prove that generalized quadrics in for n≥1 are reduced.     

Multivariate Stieltjes type theorems and location of common zeros of multivariate orthogonal polynomials

Invariant factors of bivariate orthogonal polynomials inherit most of the properties of univariate orthogonal polynomials and play an important role in the research of Stieltjes type theorems and location of common zeros of bivariate orthogonal polynomials. The aim of this paper is to extend our study of invariant factors from two variables to several variables. We obtain a multivariate Stieltjes type theorem, and the relationships among invariant factors, multivariate orthogonal polynomials and the corresponding Jacobi matrix. We also study the location of common zeros of multivariate orthogonal polynomials and provide some examples of tri-variate.     

An extended class of orthogonal polynomials defined by a Sturm-Liouville problem

We present two infinite sequences of polynomial eigenfunctions of a Sturm-Liouville problem. As opposed to the classical orthogonal polynomial systems, these sequences start with a polynomial of degree one. We denote these polynomials as X₁-Jacobi and X₁-Laguerre and we prove that they are orthogonal with respect to a positive definite inner product defined over the compact interval [−1,1] or the half-line [0,∞), respectively, and they are a basis of the corresponding L² Hilbert spaces. Moreover, we prove a converse statement similar to Bochner's theorem for the classical orthogonal polynomial systems: if a self-adjoint second-order operator has a complete set of polynomial eigenfunctions , then it must be either the X₁-Jacobi or the X₁-Laguerre Sturm-Liouville problem. A Rodrigues-type formula can be derived for both of the X₁ polynomial sequences.     

On the simpleness of zeros of Stokes multipliers

The aim of this paper is to discuss the simpleness of zeros of Stokes multipliers associated with the differential equation -Φ^″(X)+W(X)Φ(X)=0, where W(X)=X^m+a₁X^m-1+?+a_m is a real monic polynomial. We show that, under a suitable hypothesis on the coefficients a_k, all the zeros of the Stokes multipliers are simple.     

Equilibrium probability calculations for a discrete-time bulk queue model

Many problems in management science and telecommunications can be solved by the analysis of aD ^X/D^m/1 queueing model. In this paper, we use the zeros, both inside and outside the unit circle, of the denominator of the generating function of the model to obtain an explicit closed-form solution for the equilibrium probabilities of the number of customers in the system. The moments of the number of customers in the queue or in the system are also studied. When there are infinitely many zeros outside the unit circle, we propose an approximation method using polynomials. This method yields correct values for a finite number of the probabilities, the number depending on the degree of the polynomial approximation.     

Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms

The following two types of greedy algorithms are considered: the pure greedy algorithm (PGA) and the orthogonal greedy algorithm (OGA). From the standpoint of estimating the rate of convergence on the entire class A ₁(D), the orthogonal greedy algorithm is optimal and significantly exceeds the pure greedy algorithm. The main result in the present paper is the assertion that the situation can also be opposite for separate elements of the class A ₁(D) (and even of the class A ₀(D)): the rate of convergence of the orthogonal greedy algorithm can be significantly lower than the rate of convergence of the pure greedy algorithm.     

Chain sequences and symmetric generalized orthogonal polynomials

In this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K_n^(λ,M,k) associated with the probability measure dφ(λ,M,k;x), which is the Gegenbauer measure of parameter λ+1 with two additional mass points at ±k. When k=1 we obtain information on the polynomials K_n^(λ,M) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K_n^(λ,M,k) in relation to M and k are also given.     

Orthogonal polynomials for Jacobi-exponential weights (1−x 2) ρ e −Q(x) on (−1,1)

This paper deals with orthogonal polynomials for Jacobi-exponential weights (1?x ²) ^ρ e ^?Q(x) on (?1,1) and gives bounds on orthogonal polynomials, zeros, and Christofel functions. In addition, restricted range inequalities are also obtained.     

Asymptotically extremal polynomials with respect to varying weights and application to Sobolev orthogonality

We study the asymptotic behavior of the zeros of a sequence of polynomials whose weighted norms, with respect to a sequence of weight functions, have the same nth root asymptotic behavior as the weighted norms of certain extremal polynomials. This result is applied to obtain the (contracted) weak zero distribution for orthogonal polynomials with respect to a Sobolev inner product with exponential weights of the form e−φ(x), giving a unified treatment for the so-called Freud (i.e., when φ has polynomial growth at infinity) and Erdös (when φ grows faster than any polynomial at infinity) cases. In addition, we provide a new proof for the bound of the distance of the zeros to the convex hull of the support for these Sobolev orthogonal polynomials.     

Zeros of Sobolev orthogonal polynomials following from coherent pairs

Let {S_n^λ} denote the monic orthogonal polynomial sequence with respect to the Sobolev inner product$\text{〈f,g〉}{}_{\mathrm{S}}\text{=}\text{∫}\text{−∞}\text{∞}\text{fg}\text{d}\text{ψ}{}_0\text{+λ}\text{∫}\text{−∞}\text{∞}\text{f′g′}\text{d}\text{ψ}{}_1\text{,}$where {dψ₀,dψ₁} is a so-called coherent pair and λ>0. Then S_n^λ has n different, real zeros. The position of these zeros with respect to the zeros of other orthogonal polynomials (in particular Laguerre and Jacobi polynomials) is investigated. Coherent pairs are found where the zeros of S_n−1^λ separate the zeros of S_n^λ.     

Applications of the monotonicity of extremal zeros of orthogonal polynomials in interlacing and optimization problems

We investigate monotonicity properties of extremal zeros of orthogonal polynomials depending on a parameter. Using a functional analysis method we prove the monotonicity of extreme zeros of associated Jacobi, associated Gegenbauer and q-Meixner-Pollaczek polynomials. We show how these results can be applied to prove interlacing of zeros of orthogonal polynomials with shifted parameters and to determine optimally localized polynomials on the unit ball.     

Commutative presemifields and semifields

Strong conditions are derived for when two commutative presemifields are isotopic. It is then shown that any commutative presemifield of odd order can be described by a planar Dembowski-Ostrom polynomial and conversely, any planar Dembowski-Ostrom polynomial describes a commutative presemifield of odd order. These results allow a classification of all planar functions which describe presemifields isotopic to a finite field and of all planar functions which describe presemifields isotopic to Albert's commutative twisted fields. A classification of all planar Dembowski-Ostrom polynomials over any finite field of order p³, p an odd prime, is therefore obtained. The general theory developed in the article is then used to show the class of planar polynomials X¹⁰+aX⁶−a²X² with a≠0 describes precisely two new commutative presemifields of order e³ for each odd e?5.     

Inverse problems and index formulae for Dirac operators

We consider a Dirac-type operator DP on a vector bundle V over a compact Riemannian manifold (M,g) with a non-empty boundary. The operator DP is specified by a boundary condition P(u_|∂M)=0 where P is a projector which may be a non-local, i.e., a pseudodifferential operator. We assume the existence of a chirality operator which decomposes L²(M,V) into two orthogonal subspaces X₊⊕X₋. Under certain conditions, the operator DP restricted to X₊ and X₋ defines a pair of Fredholm operators which maps X₊→X₋ and X₋→X₊ correspondingly, giving rise to a superstructure on V. In this paper we consider the questions of determining the index of DP and the reconstruction of and DP from the boundary data on ∂M. The data used is either the Cauchy data, i.e., the restrictions to ∂M×R₊ of the solutions to the hyperbolic Dirac equation, or the boundary spectral data, i.e., the set of the eigenvalues and the boundary values of the eigenfunctions of DP. We obtain formulae for the index and prove uniqueness results for the inverse boundary value problems. We apply the obtained results to the classical Dirac-type operator in M×C⁴, M⊂R³.     

On the unlinking conjecture of independent polynomial functions

The celebrated U-conjecture states that under the N_n(0,I_n) distribution of the random vector X=(X₁,…,X_n) in Rⁿ, two polynomials P(X) and Q(X) are unlinkable if they are independent [see Kagan et al., Characterization Problems in Mathematical Statistics, Wiley, New York, 1973]. Some results have been established in this direction, although the original conjecture is yet to be proved in generality. Here, we demonstrate that the conjecture is true in an important special case of the above, where P and Q are convex nonnegative polynomials with P(0)=0.     

Deformation quantization in algebraic geometry

We study deformation quantizations of the structure sheaf O_X of a smooth algebraic variety X in characteristic 0. Our main result is that when X is D-affine, any formal Poisson structure on X determines a deformation quantization of O_X (canonically, up to gauge equivalence). This is an algebro-geometric analogue of Kontsevich's celebrated result.