Relative asymptotics and Fourier series of orthogonal polynomials with a discrete Sobolev inner product

Let μ be a finite positive Borel measure supported in [−1,1] and introduce the discrete Sobolev-type inner product

where the mass points a_k belong to [−1,1], M_k,i0, i=0,…,N_k−1, and M_k,Nk>0. In this paper, we study the asymptotics of the Sobolev orthogonal polynomials by comparison with the orthogonal polynomials with respect to the measure μ and we prove that they have the same asymptotic behaviour. We also study the pointwise convergence of the Fourier series associated to this inner product provided that μ is the Jacobi measure. We generalize the work done by F. Marcellán and W. Van Assche where they studied the asymptotics for only one mass point in [−1,1]. The same problem with a finite number of mass points off [−1,1] was solved by G. López, F. Marcellán and W. Van Assche in a more general setting: they consider the constants M_k,i to be complex numbers. As regards the Fourier series, we continue the results achieved by F. Marcellán, B. Osilenker and I.A. Rocha for the Jacobi measure and mass points in .     

Expected Sums of General Parking Functions

A (u₁, u₂, . . . )-parking function of length n is a sequence (x₁, x₂, . . . , x_n) whose order statistics (the sequence (x₍₁₎, x₍₂₎, . . . , x_(n)) obtained by rearranging the original sequence in non-decreasing order) satisfy x_(i) u_(i). The Gonarov polynomials g _n (x; a₀, a ₁, . . . , a _n-1) are polynomials biorthogonal to the linear functionals (a _i) Dⁱ, where (a) is evaluation at a and D is differentiation. In this paper, we give explicit formulas for the first and second moments of sums of u-parking functions using Gonarov polynomials by solving a linear recursion based on a decomposition of the set of sequences of positive integers. We also give a combinatorial proof of one of the formulas for the expected sum. We specialize these formulas to the classical case when u _i=a+ (i-1)b and obtain, by transformations with Abel identities, different but equivalent formulas for expected sums. These formulas are used to verify the classical case of the conjecture that the expected sums are increasing functions of the gaps u_i+1 - u_i. Finally, we give analogues of our results for real-valued parking functions.AMS Subject Classification: 05A15, 05A19, 05A20, 05E35.     

Spectra of certain types of polynomials and tiling of integers with translates of finite sets

We investigate Fuglede's spectral set conjecture in the special case when the set in question is a union of finitely many unit intervals in dimension 1. In this case, the conjecture can be reformulated as a statement about multiplicative properties of roots of associated with the set polynomials with (0,1) coefficients. Let be an N-term polynomial. We say that {θ₁,θ₂,…,θ_N−1} is an N-spectrum for A(x) if the θ_j are all distinct and

     

Detecting Mass Points of Representing Measures

We discuss a possibility of deciding whether measures representing a moment sequence or realizing orthogonality of polynomials have atoms. This is done on the real line and in several variables.     

On the Bochner theorem on orthogonal operators

We prove the following theorem. Any isometric operator , that acts from the Hilbert space with nonnegative weight to the Hilbert space with nonnegative weight , allows for the integral representation

where the kernels and satisfy certain conditions that are necessary and sufficient for these kernels to generate the corresponding isometric operators.

     

Kazhdan-Lusztig Polynomials for 321-Hexagon-Avoiding Permutations

In (Deodhar, Geom. Dedicata, 36(1) (1990), 95–119), Deodhar proposes a combinatorial framework for determining the Kazhdan-Lusztig polynomials P _x , _w in the case where W is any Coxeter group. We explicitly describe the combinatorics in the case where (the symmetric group on n letters) and the permutation w is 321-hexagon-avoiding. Our formula can be expressed in terms of a simple statistic on all subexpressions of any fixed reduced expression for w. As a consequence of our results on Kazhdan-Lusztig polynomials, we show that the Poincaré polynomial of the intersection cohomology of the Schubert variety corresponding to w is (1+q) ^l(w) if and only if w is 321-hexagon-avoiding. We also give a sufficient condition for the Schubert variety X _w to have a small resolution. We conclude with a simple method for completely determining the singular locus of X _w when w is 321-hexagon-avoiding. The results extend easily to those Weyl groups whose Coxeter graphs have no branch points (B C _n , F ₄, G ₂).     

Symbolic Computation of Newton Sum Rules for the Zeros of Polynomial Eigenfunctions of Linear Differential Operators

A symbolic algorithm based on the generalized Lucas polynomials of first kind is used in order to compute the Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators with polynomial coefficients.     

Approximation by Algebraic Polynomials on Rectangles

A direct theorem for approximation by algebraic polynomials in two variables with different degrees in each variable in L_p-metric (1 p ) on rectangles is proved, and the dependence of the constants on various parameters is studied.     

On the computation of all extensions of a -adic field of a given degree

Let be a -adic field. It is well-known that has only finitely many extensions of a given finite degree. Krasner has given formulae for the number of extensions of a given degree and discriminant. Following his work, we present an algorithm for the computation of generating polynomials for all extensions of a given degree and discriminant.

     

Hilbert schemes, polygraphs and the Macdonald positivity conjecture

We study the isospectral Hilbert scheme , defined as the reduced fiber product of with the Hilbert scheme of points in the plane , over the symmetric power . By a theorem of Fogarty, is smooth. We prove that is normal, Cohen-Macaulay and Gorenstein, and hence flat over . We derive two important consequences.

(1) We prove the strong form of the conjecture of Garsia and the author, giving a representation-theoretic interpretation of the Kostka-Macdonald coefficients . This establishes the Macdonald positivity conjecture, namely that .

(2) We show that the Hilbert scheme is isomorphic to the -Hilbert scheme of Nakamura, in such a way that is identified with the universal family over . From this point of view, describes the fiber of a character sheaf at a torus-fixed point of corresponding to .

The proofs rely on a study of certain subspace arrangements , called polygraphs, whose coordinate rings carry geometric information about . The key result is that is a free module over the polynomial ring in one set of coordinates on . This is proven by an intricate inductive argument based on elementary commutative algebra.