Dual generalized Bernstein basis

The generalized Bernstein basis in the space Π_n of polynomials of degree at most n, being an extension of the q-Bernstein basis introduced by Philips [Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511–518], is given by the formula [S. Lewanowicz, P. Woźny, Generalized Bernstein polynomials, BIT Numer. Math. 44 (2004) 63–78],

We give explicitly the dual basis functions for the polynomials , in terms of big q-Jacobi polynomials P_k(x;a,b,ω/q;q), a and b being parameters; the connection coefficients are evaluations of the q-Hahn polynomials. An inverse formula—relating big q-Jacobi, dual generalized Bernstein, and dual q-Hahn polynomials—is also given. Further, an alternative formula is given, representing the dual polynomial (0jn) as a linear combination of min(j,n-j)+1 big q-Jacobi polynomials with shifted parameters and argument. Finally, we give a recurrence relation satisfied by , as well as an identity which may be seen as an analogue of the extended Marsden's identity [R.N. Goldman, Dual polynomial bases, J. Approx. Theory 79 (1994) 311–346].     

An Extension of the Pizzetti Formula for Polyharmonic Functions

We represent the integral over the unit ball B in R ⁿ of any poly-harmonic function u(x) of degree m as a linear combination with constant coefficients of the integrals of its Laplacians ^j u (j = 0,...,m - 1) over any fixed(n - 1)-dimensional hypersphere S() of radius (0 1). In case = 0 theformula reduces to the classical Pizzetti formula. In particular, the cubature formula derived here integrates exactly all algebraic polynomials of degree 2m - 1.     

On the multiplicity of the eigenvalues of a graph

Given a graph G with characteristic polynomial ϕ(t), we consider the ML-decomposition ϕ(t) = q ₁(t)q ₂(t)² ... q _m (t)^m, where each q _i (t) is an integral polynomial and the roots of ϕ(t) with multiplicity j are exactly the roots of q _j (t). We give an algorithm to construct the polynomials q _i (t) and describe some relations of their coefficients with other combinatorial invariants of G. In particular, we get new bounds for the energy E(G) = |λ_i| of G, where λ₁, λ₂, ..., λ_n are the eigenvalues of G (with multiplicity). Most of the results are proved for the more general situation of a Hermitian matrix whose characteristic polynomial has integral coefficients. This work was done during a visit of the second named author to UNAM.     

Coincidence of Least Uniform Deviations of Functions from Polynomials and Rational Fractions

For a given nonincreasing vanishing sequence {a _n } _{n = 0} of nonnegative real numbers, we find necessary and sufficient conditions for a sequence {n _k } _{k = 0} to have the property that for this sequence there exists a function f continuous on the interval [0,1] and satisfying the condition that , k = 0,1,2,..., where E _n (f) and R _n,m (f) are the best uniform approximations to the function f by polynomials whose degree does not exceed n and by rational functions of the form r _n,m (x) = p _n (x)/q _m (x), respectively.     

Generalized n-gons and Chebychev polynomials

Two sequences of orthogonal polynomials are given whose weight functions consist of an absolutely continuous part and two point masses. Combinatorial proofs of the orthogonality relations are given. The polynomials include natural q-analogs of the Chebychev polynomials. The technique uses association schemes of generalized n-gons to find approximating discrete orthogonality relations. The Feit-Higman Theorem is a corollary of these orthogonality relations for the polynomials.     

Generalized Bernstein Polynomials

We introduce polynomials B ⁿ _i (x;ω|q), depending on two parameters q and ω, which generalize classical Bernstein polynomials, discrete Bernstein polynomials defined by Sablonnière, as well as q-Bernstein polynomials introduced by Phillips. Basic properties of the new polynomials are given. Also, formulas relating B ⁿ _i (x;ω|q), big q-Jacobi and q-Hahn (or dual q-Hahn) polynomials are presented. This revised version was published online in July 2006 with corrections to the Cover Date.     

q-Bernstein polynomials and their iterates

Let B_n( f,q;x), n=1,2,… be q-Bernstein polynomials of a function f : [0,1]→C. The polynomials B_n( f,1;x) are classical Bernstein polynomials. For q≠1 the properties of q-Bernstein polynomials differ essentially from those in the classical case. This paper deals with approximating properties of q-Bernstein polynomials in the case q>1 with respect to both n and q. Some estimates on the rate of convergence are given. In particular, it is proved that for a function f analytic in {z: |z|<q+} the rate of convergence of {B_n( f,q;x)} to f(x) in the norm of C[0,1] has the order q⁻ⁿ (versus 1/n for the classical Bernstein polynomials). Also iterates of q-Bernstein polynomials {B_n^j_n( f,q;x)}, where both n→∞ and j_n→∞, are studied. It is shown that for q(0,1) the asymptotic behavior of such iterates is quite different from the classical case. In particular, the limit does not depend on the rate of j_n→∞.     

A Remarkable q,t-Catalan Sequence and q-Lagrange Inversion

We introduce a rational function C _n(q, t) and conjecture that it always evaluates to a polynomial in q, t with non-negative integer coefficients summing to the familiar Catalan number . We give supporting evidence by computing the specializations and C _n (q) = C _n(q,1) = C _n(1,q). We show that, in fact, D _n(q) q-counts Dyck words by the major index and C _n(q) q-counts Dyck paths by area. We also show that C _n(q, t) is the coefficient of the elementary symmetric function e _nin a symmetric polynomial DH_n(x; q, t) which is the conjectured Frobenius characteristic of the module of diagonal harmonic polynomials. On the validity of certain conjectures this yields that C _n(q, t) is the Hilbert series of the diagonal harmonic alternants. It develops that the specialization DH_n(x; q, 1) yields a novel and combinatorial way of expressing the solution of the q-Lagrange inversion problem studied by Andrews [2], Garsia [5] and Gessel [11]. Our proofs involve manipulations with the Macdonald basis {P (x; q, t)} which are best dealt with in -ring notation. In particular we derive here the -ring version of several symmetric function identities.Work carried out under NSF grant support.     

Root Configurations for Hyperbolic Polynomials of Degree 3, 4, and 5

A real polynomial of one real variable is (strictly) hyperbolic if it has only real (and distinct) roots. There are 10 (resp. 116) possible non-degenerate configurations between the roots of a strictly hyperbolic polynomial of degree 4 (resp. 5) and of its derivatives (i.e., configurations without equalities between roots). The standard Rolle theorem allows 12 (resp. 286) such configurations. The result is based on the study of the hyperbolicity domain of the family P(x,a)=x ⁿ+a ₁ x ^n-1+...+a _n for n=4,5 (i.e., of the set of values of aⁿ for which the polynomial is hyperbolic) and its stratification defined by the discriminant sets Res(P ⁽ⁱ⁾,P ^(j))=0, 0 i < jn-1.     

Parametrization of Triangle Groups as Subgroups of PSL(2, q)

In this paper we are interested in triangle groups (j, k, l) where j = 2 and k = 3. The groups (j, k, l) can be considered as factor groups of the modular group PSL(2, Z) which has the presentation x, y : x² = y³ = 1. Since PSL(2,q) is a factor group of G^k,l,m if -1 is a quadratic residue in the finite field F_q, it is therefore worthwhile to look at (j, k, l) groups as subgroups of PSL(2, q) or PGL(2, q). Specifically, we shall find a condition in form of a polynomial for the existence of groups (2, 3, k) as subgroups of PSL(2, q) or PGL(2, q).Mathematics Subject Classification: Primary 20F05 Secondary 20G40.     

Voronovskaya-type formulas and saturation of convergence for q-Bernstein polynomials for

In the paper, we discuss Voronovskaya-type theorem and saturation of convergence for q-Bernstein polynomials for arbitrary fixed q, 0<q<1. We give explicit formulas of Voronovskaya-type for the q-Bernstein polynomials for 0<q<1. If , we show that the rate of convergence for the q-Bernstein polynomials is o(qⁿ) if and only ifWe also prove that if f is convex on [0,1] or analytic on (-ε,1+ε) for some ε>0, then the rate of convergence for the q-Bernstein polynomials is o(qⁿ) if and only if f is linear.     

On the Decay of Infinite Products of Trigonometric Polynomials

We consider infinite products of the form f(=_k=1 m _k(2^-k), where {m _k} is an arbitrary sequence of trigonometric polynomials of degree at most n with uniformly bounded norms such that m _k(0)= 1 for all k. We show that f() can decrease at infinity not faster than O(^-n) and present conditions under which this maximal decay is attained. This result can be applied to the theory of nonstationary wavelets and nonstationary subdivision schemes. In particular, it restricts the smoothness of nonstationary wavelets by the length of their support. This also generalizes well-known similar results obtained for stable sequences of polynomials (when all m _k coincide). By means of several examples, we show that by weakening the boundedness conditions one can achieve exponential decay.     

Narayana numbers and Schur–Szeg? composition

In the present paper we find a new interpretation of Narayana polynomials N_n(x) which are the generating polynomials for the Narayana numbers where stands for the usual binomial coefficient, i.e. . They count Dyck paths of length n and with exactly k peaks, see e.g. [R.A. Sulanke, The Narayana distribution, in: Lattice Path Combinatorics and Applications (Vienna, 1998), J. Statist. Plann. Inference 101 (1–2) (2002) 311–326 (special issue)] and they appeared recently in a number of different combinatorial situations, see for e.g. [T. Doslic, D. Syrtan, D. Veljan, Enumerative aspects of secondary structures, Discrete Math. 285 (2004) 67–82; A. Sapounakis, I. Tasoulas, P. Tsikouras, Counting strings in Dyck paths, Discrete Math. 307 (2007) 2909–2924; F. Yano, H. Yoshida, Some set partitions statistics in non-crossing partitions and generating functions, Discrete Math. 307 (2007) 3147–3160]. Strangely enough Narayana polynomials also occur as limits as n→∞ of the sequences of eigenpolynomials of the Schur–Szeg? composition map sending (n−1)-tuples of polynomials of the form (x+1)ⁿ⁻¹(x+a) to their Schur–Szeg? product, see below. We present below a relation between Narayana polynomials and the classical Gegenbauer polynomials which implies, in particular, an explicit formula for the density and the distribution function of the asymptotic root-counting measure of the polynomial sequence {N_n(x)}.     

The explicit construction of irreducible polynomials over finite fields

For a finite field GF(q) of odd prime power order q, and n 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials of degree n2 ^m (m = 1, 2, 3, ...) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presentations of GF (q ⁿ 2).     

Primitive normal polynomials with a prescribed coefficient

In this paper, we established the existence of a primitive normal polynomial over any finite field with any specified coefficient arbitrarily prescribed. Let n15 be a positive integer and q a prime power. We prove that for any aF_q and any 1m<n, there exists a primitive normal polynomial f(x)=xⁿ−σ₁xⁿ⁻¹++(−1)ⁿ⁻¹σ_n−1x+(−1)ⁿσ_n such that σ_m=a, with the only exceptions σ₁≠0. The theory can be extended to polynomials of smaller degree too.     

Finite difference methods for two-point boundary value problems involving high order differential equations

We discuss the construction of finite difference schemes for the two-point nonlinear boundary value problem:y ⁽²ⁿ⁾+f(x,y)=0,y ^(2j)(a)=A _2j ,y ^(2j)(b)=B _2j ,j=0(1)n–1,n2. In the case of linear differential equations, these finite difference schemes lead to (2n+1)-diagonal linear systems. We consider in detail methods of orders two, four and six for two-point boundary value problems involving a fourth order differential equation; convergence of these methods is established and illustrated by numerical examples.     

Matrix orthogonal polynomials associated with perturbations of block Toeplitz matrices

Let {c _j } _j=0 ⁿ be a sequence of matrix moments associated with a matrix of measures supported on the unit circle, and let {P _j } _j=0 ⁿ be its corresponding sequence of monic matrix orthogonal polynomials. In this contribution, we consider a perturbation on the moments and find an explicit relation for the perturbed orthogonal polynomials in terms of {P _j } _j=0 ⁿ . We also obtain an expression for the corresponding second kind polynomials.     

On (q 2 + q + 2, q + 2)-arcs in the Projective Plane PG(2, q)

A (k,n)-arc in PG(2,q) is usually defined to be a set of k points in the plane such that some line meets in n points but such that no line meets in more than n points. There is an extensive literature on the topic of (k,n)-arcs. Here we keep the same definition but allow to be a multiset, that is, permit to contain multiple points. The case k=q ²+q+2 is of interest because it is the first value of k for which a (k,n)-arc must be a multiset. The problem of classifying (q ²+q+2,q+2)-arcs is of importance in coding theory, since it is equivalent to classifying 3-dimensional q-ary error-correcting codes of length q ²+q+2 and minimum distance q ². Indeed, it was the coding theory problem which provided the initial motivation for our study. It turns out that such arcs are surprisingly rich in geometric structure. Here we construct several families of (q ²+q+2,q+2)-arcs as well as obtain some bounds and non-existence results. A complete classification of such arcs seems to be a difficult problem.     

On the q-Bernstein polynomials of rational functions with real poles

The paper aims to investigate the convergence of the q  -Bernstein polynomials _Bn,q(f;x)$B_{n,q}(f;x)$ attached to rational functions in the case q>1$q>1$. The problem reduces to that for the partial fractions (x−α)^−j${(x-\alpha )}^{-j}$, j∈N$j\in \mathbb{N}$. The already available results deal with cases, where either the pole α   is simple or α≠q^−m$\alpha \ne q^{-m}$, m∈_N0$m\in {\mathbb{N}}_0$. Consequently, the present work is focused on the polynomials _Bn,q(f;x)$B_{n,q}(f;x)$ for the functions of the form f(x)=(x−q^−m)^−j$f(x)={(x-q^{-m})}^{-j}$ with j?2$j?2$. For such functions, it is proved that the interval of convergence of {_Bn,q(f;x)}$\{B_{n,q}(f;x)\}$ depends not only on the location, but also on the multiplicity of the pole – a phenomenon which has not been considered previously.