Inverse Operators, q-Fractional Integrals, and q-Bernoulli Polynomials

We introduce operators of q-fractional integration through inverses of the Askey–Wilson operator and use them to introduce a q-fractional calculus. We establish the semigroup property for fractional integrals and fractional derivatives. We study properties of the kernel of q-fractional integral and show how they give rise to a q-analogue of Bernoulli polynomials, which are now polynomials of two variables, x and y. As q→1 the polynomials become polynomials in x−y, a convolution kernel in one variable. We also evaluate explicitly a related kernel of a right inverse of the Askey–Wilson operator on an L² space weighted by the weight function of the Askey–Wilson polynomials.     

Representations for the first associated q-classical orthogonal polynomials

Let {p_k(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation D_q(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {p_k⁽¹⁾(x;q)} be associated polynomials of the polynomials {p_k(x; q)}. Explicit forms of the coefficients b_n,k and c_n,k in the expansions

are given in terms of basic hypergeometric functions. Here _k(x) equals x^k if σ⁺(0)=0, or (x;q)_k if σ⁺(1)=0, where σ⁺(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by p_n−1⁽¹⁾(x;q) in a special form, recurrence relations (in k) for b_n,k and c_n,k are obtained in terms of σ and τ.     

Schur functions and the invariant polynomials characterizing U(n) tensor operators

We give a direct formulation of the invariant polynomials _μG_q⁽ⁿ⁾(, Δ_i,;, x_{i,i + 1},) characterizing U(n) tensor operators p, q, …, q, 0, …, 0 in terms of the symmetric functions S_λ known as Schur functions. To this end, we show after the change of variables Δ_i = γ_i − δ_i and x_{i, i + 1} = δ_i − δ_{i + 1} that_μG_q⁽ⁿ⁾(,Δ_i;, x_{i, i + 1},) becomes an integral linear combination of products of Schur functions S_α(, γ_i,) · S_β(, δ_i,) in the variables {γ₁,…, γ_n} and {δ₁,…, δ_n}, respectively. That is, we give a direct proof that _μG_q⁽ⁿ⁾(,Δ_i,;, x_{i, i + 1},) is a bisymmetric polynomial with integer coefficients in the variables {γ₁,…, γ_n} and {δ₁,…, δ_n}. By making further use of basic properties of Schur functions such as the Littlewood-Richardson rule, we prove several remarkable new symmetries for the yet more general bisymmetric polynomials _μ^mG_q⁽ⁿ⁾(γ₁,…, γ_n; δ₁,…, δ_m). These new symmetries enable us to give an explicit formula for both _μ^mG₁⁽ⁿ⁾(γ; δ) and ₁G₂⁽ⁿ⁾(γ; δ). In addition, we describe both algebraic and numerical integration methods for deriving general polynomial formulas for _μ^mG_q⁽ⁿ⁾(γ; δ).     

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→∞.     

The rate of convergence of q-Bernstein polynomials for

In the note, we obtain the estimates for the rate of convergence for a sequence of q-Bernstein polynomials {B_n,q(f)} for 0<q<1 by the modulus of continuity of f, and the estimates are sharp with respect to the order for Lipschitz continuous functions. We also get the exact orders of convergence for a family of functions , and the orders do not depend on α, unlike the classical case.     

Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(x−1)

Let q be an odd prime power and p be an odd prime with gcd(p,q)=1. Let order of q modulo p be f, and q^f=1+pλ. Here expressions for all the primitive idempotents in the ring R_pⁿ=GF(q)[x]/(x^pn−1), for any positive integer n, are obtained in terms of cyclotomic numbers, provided p does not divide λ if n2. The dimension, generating polynomials and minimum distances of minimal cyclic codes of length pⁿ over GF(q) are also discussed.     

Carlitz’s q-Bernoulli and q-Euler numbers and polynomials and a class of generalized q-Hurwitz zeta functions

In this paper, we systematically recover the identities for the q-eta numbers η_k and the q-eta polynomials η_k(x), presented by Carlitz [L. Carlitz, q-Bernoulli numbers and polynomials, Duke Math. J. 15 (1948) 987–1000], which we define here via generating series rather than via the difference equations of Carlitz. Following a method developed by Kaneko et al. [M. Kaneko, N. Kurokawa, M. Wakayama, A variation of Euler’s approach to the Riemann zeta function, Kyushu J. Math. 57 (2003) 175–192] for a canonical q-extension of the Riemann zeta function, we investigate a similarly constructed q-extension of the Hurwitz zeta function. The details of this investigation disclose some interesting connections among q-eta polynomials, Carlitz’s q-Bernoulli polynomials -polynomials, and the q-Bernoulli polynomials that emerge from the q-extension of the Hurwitz zeta function discussed here.     

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.     

L1-optimal estimates for a regression type function in R

Let X₁, X₂, …, X_n be random vectors that take values in a compact set in R^d, d ≥ 1. Let Y₁, Y₂, …, Y_n be random variables (“the responses”) which conditionally on X₁ = x₁, …, X_n = x_n are independent with densities f(y | x_i, θ(x_i)), i = 1, …, n. Assuming that θ lives in a sup-norm compact space Θ_q,d of real valued functions, an optimal L₁-consistent estimator of θ is constructed via empirical measures. The rate of convergence of the estimator to the true parameter θ depends on Kolmogorov's entropy of Θ_q,d.     

q-Rook Polynomials and Matrices over Finite Fields

Connections betweenq-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel'sq-hit polynomial. Both this new statisticmatand another statistic for theq-hit polynomial ξ recently introduced by Dworkin are shown to induce different multiset Mahonian permutation statistics for any Ferrers board. In addition, for the triangular boards they are shown to generate different families of Euler–Mahonian statistics. For these boards the ξ family includes Denert's statisticden, and gives a new proof of Foata and Zeilberger's Theorem that (exc, den) is equidistributed with (des, maj). Thematfamily appears to be new. A proof is also given that theq-hit polynomials are symmetric and unimodal.     

The homogeneous q-difference operator

We introduce a q-differential operator D_xy on functions in two variables which turns out to be suitable for dealing with the homogeneous form of the q-binomial theorem as studied by Andrews, Goldman, and Rota, Roman, Ihrig, and Ismail, et al. The homogeneous versions of the q-binomial theorem and the Cauchy identity are often useful for their specializations of the two parameters. Using this operator, we derive an equivalent form of the Goldman–Rota binomial identity and show that it is a homogeneous generalization of the q-Vandermonde identity. Moreover, the inverse identity of Goldman and Rota also follows from our unified identity. We also obtain the q-Leibniz formula for this operator. In the last section, we introduce the homogeneous Rogers–Szegö polynomials and derive their generating function by using the homogeneous q-shift operator.     

Minimal cyclic codes of length pq

Explicit expressions for all the 3n+2 primitive idempotents in the ring R_pⁿq=GF(ℓ)[x]/(x^pnq−1), where p,q,ℓ are distinct odd primes, ℓ is a primitive root modulo pⁿ and q both, , are obtained. The dimension, generating polynomials and the minimum distance of the minimal cyclic codes of length pⁿq over GF(ℓ) are also discussed.     

Q-operator and factorised separation chain for Jack polynomials

Applying Baxter's method of the Q-operator to the set of Sekiguchi's commuting partial differential operators we show that Jack polynomials P_λ^(1/g) (χ₁, …, χ_n) …, χ_n) are eigenfunctions of a one-parameter family of integral operators Q_z. The operators Q_z are expressed in terms of the Dirichlet-Liouville n-dimensional beta integral. From a composition of n operators Q_zk we construct an integral operator S_n factorising Jack polynomials into products of hypergeometric polynomials of one variable. The operator S_n admits a factorisation described in terms of restricted Jack polynomials P_λ^(1/g) (x₁, …, x_k, 1, … 1). Using the operator Q_z for z = 0 we give a simple derivation of a previously known integral representation for Jack polynomials.     

Algebraic Independence Results Related to 〈 q , r 〉-Number Systems

We define 〈q, r〉-linear arithmetical functions attached to the 〈q, r〉-number systems and give a necessary and sufficient condition for their generating power series to be algebraically independent over \Bbb C(z){\Bbb C}(z) . We also deduce algebraic independence of the functions values at a nonzero algebraic number in the circle of convergence.     

On the Convergence and Iterates of q-Bernstein Polynomials

The convergence properties of q-Bernstein polynomials are investigated. When q1 is fixed the generalized Bernstein polynomials _nf of f, a one parameter family of Bernstein polynomials, converge to f as n→∞ if f is a polynomial. It is proved that, if the parameter 0<q<1 is fixed, then _nf→f if and only if f is linear. The iterates of _nf are also considered. It is shown that _n^Mf converges to the linear interpolating polynomial for f at the endpoints of [0,1], for any fixed q>0, as the number of iterates M→∞. Moreover, the iterates of the Boolean sum of _nf converge to the interpolating polynomial for f at n+1 geometrically spaced nodes on [0,1].     

The limiting case of Haglund's (q,t)-Schröder theorem and an involution formula

As a generalization of Haglund's statistic on Dyck paths [Conjectured statistics for the q,t-Catalan numbers, Adv. Math. 175 (2) (2003) 319–334; A positivity result in the theory of Macdonald polynomials, Proc. Nat. Acad. Sci. 98 (2001) 4313–4316], Egge et al. introduced the (q,t)-Schröder polynomial S_n,d(q,t), which evaluates to the Schröder number when q=t=1 [A Schröder generalization of Haglund's statistic on Catalan paths, Electron. J. Combin. 10 (2003) 21pp (Research Paper 16, electronic)]. In their paper, S_n,d(q,t) was conjectured to be equal to the coefficient of a hook shape on the Schur function expansion of the symmetric function e_n, which Haiman [Vanishing theorems and character formulas for the Hilbert scheme of points in the plane, Invent. Math. 149 (2002) 371–407] has shown to have a representation-theoretic interpretation. This conjecture was recently proved by Haglund [A proof of the q,t-Schröder conjecture, Internat. Math. Res. Not. (11) (2004) 525–560]. However, because that proof makes heavy use of symmetric function identities and plethystic machinery, the combinatorics behind it is not understood. Therefore, it is worthwhile to study it combinatorially. This paper investigates the limiting case of the (q,t)-Schröder Theorem and obtains interesting results by looking at some special cases.     

The n-width of the unit ball of H

Let E be a compact subset of the open unit disc Δ and let H^q be the Hardy space of analytic functions f on Δ for which stf¦^q has a harmonic majorant. We determine the value of the Kolmogorov, Gel'fand, and linear n-widths in L^p(E, μ) of the restriction to E of the unit ball of H^q when p q or when 1 q < p < ∞ and E is “small”.     

Automorphism groups of certain simple 2-(q,3,λ) designs constructed from finite fields

Let F be a finite field of characteristic not 2, and SF a subset with three elements. Consider the collection

S={S·a+b | a,bF, a≠0}.

Then (F,S) is a simple 2-design and the parameter λ of (F,S) is 1, 2, 3 or 6. We find in this paper the full automorphism group of (F,S). Namely, if we put U={r | {0,1,r}S} and K the subfield of F generated by U, then the automorphisms of (F,S) are the maps of the form xg(α(x))+b, xF, where bF, α : F→F is a field automorphism fixing U, and g is a linear transformation of F considered as a vector space over K.     

The Number of Permutation Polynomials of a Given Degree Over a Finite Field

We relate the number of permutation polynomials in F_q[x] of degree d≤q−2 to the solutions (x₁,x₂,…,x_q) of a system of linear equations over F_q, with the added restriction that x_i≠0 and x_i≠x_j whenever i≠j. Using this we find an expression for the number of permutation polynomials of degree p−2 in F_p[x] in terms of the permanent of a Vandermonde matrix whose entries are the primitive pth roots of unity. This leads to nontrivial bounds for the number of such permutation polynomials. We provide numerical examples to illustrate our method and indicate how our results can be generalised to polynomials of other degrees.