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 τ.     

New pairs of -sequences with 4-level cross-correlation

Let ω be a primitive element of GF(2ⁿ), where . Let d=(2^2k+2^s+1-2^k+1-1)/(2^s-1), where n=2k, and s is such that 2s divides k. We prove that the binary m-sequences s(t)=tr(ω^t) and s(dt) have a four-level cross-correlation function and give the distribution of the values.     

Orthogonal factorizations of digraphs

Let G be a digraph with vertex set V(G) and arc set E(G) and let g = (g ⁻, g ⁺) and ƒ = (ƒ ⁻, ƒ ⁺) be pairs of positive integer-valued functions defined on V(G) such that g ⁻(x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ ƒ ⁺(x) for each x ∈ V(G). A (g, ƒ)-factor of G is a spanning subdigraph H of G such that g ⁻(x) ⩽ id _H (x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ od _H (x) ⩽ ƒ ⁺(x) for each x ∈ V(H); a (g, ƒ)-factorization of G is a partition of E(G) into arc-disjoint (g, ƒ)-factors. Let = {F ₁, F ₂,…, F _m} and H be a factorization and a subdigraph of G, respectively. is called k-orthogonal to H if each F _i , 1 ⩽ i ⩽ m, has exactly k arcs in common with H. In this paper it is proved that every (mg+m−1,mƒ−m+1)-digraph has a (g, f)-factorization k-orthogonal to any given subdigraph with km arcs if k ⩽ min{g ⁻(x), g ⁺(x)} for any x ∈ V(G) and that every (mg, mf)-digraph has a (g, f)-factorization orthogonal to any given directed m-star if 0 ⩽ g(x) ⩽ f(x) for any x ∈ V(G). The results in this paper are in some sense best possible.      

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

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).     

A characterization of some q-orthogonal polynomials

We show that the only orthogonal polynomials satisfying a q-difference equation of the form π(x)D _q P _n (x) = (α _n x + β _n )P _n (x) + γ _n P _n−1(x) where π(x) is a polynomial of degree 2, are the Al-Salam Carlitz 1, little and big q-Laguerre, the little and big q-Jacobi, and the q-Bessel polynomials. This is a q-analog of the work carried out in [1]. 2000 Mathematics Subject Classification Primary—33C45, 33D45     

Another Proof of Kasami's Theorem

We give a short direct proof for a famous theorem published by Kasami in 1971. In terms of Walsh analysis it states that for d = 2^2k - 2^k + 1 the Walsh spectrum of the Boolean function Tr(x ^d ) on GF(2 ⁿ ) consists precisely of the three values 0, ±2^(n+s)/2 if s = gcd(k, n) = gcd(2k, n).     

A new extension theorem for linear codes

For an [n,k,d]_q code with k3, gcd(d,q)=1, the diversity of is defined as the pair (Φ₀,Φ₁) with

All the diversities for [n,k,d]_q codes with k3, d−2 (mod q) such that A_i=0 for all i0,−1,−2 (mod q) are found and characterized with their spectra geometrically, which yields that such codes are extendable for all odd q5. Double extendability is also investigated.     

A new continuation method for complementarity problems with uniformP-functions

The complementarity problem with a nonlinear continuous mappingf from the nonnegative orthantR ₊ ⁿ ofR ⁿ intoR ⁿ can be written as the system of equationsF(x, y) = 0 and(x, y) R ₊ ²ⁿ , whereF denotes the mapping from the nonnegative orthantR ₊ ²ⁿ ofR ²ⁿ intoR ₊ ⁿ × Rⁿ defined byF(x, y) = (x ₁y₁,,x_ny_n, f₁(x) – y₁,, f_n(x) – y_n) for every(x, y) R ₊ ²ⁿ . Under the assumption thatf is a uniformP-function, this paper establishes that the mappingF is a homeomorphism ofR ₊ ²ⁿ ontoR ₊ ⁿ × Rⁿ. This result provides a theoretical basis for a new continuation method of tracing the solution curve of the one parameter family of systems of equationsF(x, y) = tF(x ⁰, y⁰) and(x, y) R ₊ ²ⁿ from an arbitrary initial point(x ⁰, y⁰) R ₊ ²ⁿ witht = 1 until the parametert attains 0. This approach is an extension of the one used in the polynomially bounded algorithm recently given by Kojima, Mizuno and Yoshise for solving linear complementarity problems with positive semi-definite matrices.     

On nonautonomous linear systems of differential and difference equations with -symmetric coefficient matrices

Let denote the set of continuous n×n matrices on an interval . We say that is a nontrivial k-involution if where ζ=e^-2πi/k, d₀+d₁++d_k-1=n, and with . We say that is R-symmetric if R(t)A(t)R^-1(t)=A(t), , and we show that if A is R-symmetric then solving x^′=A(t)x or x^′=A(t)x+f(t) reduces to solving k independent d_ℓ×d_ℓ systems, 0ℓk-1. We consider the asymptotic behavior of the solutions in the case where . Finally, we sketch analogous results for linear systems of difference equations.     

On Dirichlet Series for Sums of Squares

Hardy and Wright (An Introduction to the Theory of Numbers, 5th edn., Oxford, 1979) recorded elegant closed forms for the generating functions of the divisor functions _k (n) and _k ²(n) in the terms of Riemann Zeta function (s) only. In this paper, we explore other arithmetical functions enjoying this remarkable property. In Theorem 2.1 below, we are able to generalize the above result and prove that if f _i and g _i are completely multiplicative, then we have where L _f(s) := _{n = 1} f(n)n ^–s is the Dirichlet series corresponding to f. Let r _N(n) be the number of solutions of x ₁ ² + ··· + x _N ² = n and r _2,P (n) be the number of solutions of x ² + Py ² = n. One of the applications of Theorem 2.1 is to obtain closed forms, in terms of (s) and Dirichlet L-functions, for the generating functions of r _N(n), r _N ²(n), r _2,P (n) and r _2,P (n)² for certain N and P. We also use these generating functions to obtain asymptotic estimates of the average values for each function for which we obtain a Dirichlet series.     

Stirling polynomials

An investigation is made of the polynomials f_k(n) = S(n + k, n) and g_k(n) = (?1)^ks(n, n ? k), where S and s denote the Stirling numbers of the second and first kind, respectively. The main result gives a combinatorial interpretation of the coefficients of the polynomial (1 ? x)^2k+1Σ_n=0^∞f_k(n)xⁿ analogous to the well-known combinatorial interpretation of the Eulerian numbers in terms of descents of permutations.     

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.     

Positive linear operators generated by analytic functions

Let φ be a power series with positive Taylor coefficients {a _k } _k=0^∞ and non-zero radius of convergence r ≤ ∞. Let ξ _x , 0 ≤ x < r be a random variable whose values α _k , k = 0, 1, …, are independent of x and taken with probabilities a _k x ^k /φ(x), k = 0, 1, …. The positive linear operator (A _φ f)(x):= E[f(ξ _x )] is studied. It is proved that if E(ξ _x ) = x, E(ξ _x ²) = qx ² + bx + c, q, b, c ∈ R, q > 0, then A _φ reduces to the Szász-Mirakyan operator in the case q = 1, to the limit q-Bernstein operator in the case 0 < q < 1, and to a modification of the Lupaş operator in the case q > 1.     

A note on properties of locally finitely convergent sequences with respect to median filter

Let F_k be a mapping from R^Z to R^Z, satisfying that for x∈R^Z and n∈Z, F_k(x)(n) is the (k+1)th largest value (median value) of the 2k+1 numbers x(n−k),…,x(n),…,x(n+k). In [3] [W.Z. Ye, L. Wang, L.G. Xu, Properties of locally convergent sequences with respect to median filter, Discrete Mathematics 309 (2009) 2775–2781], we conjectured that for k∈{2,3}, if there exists n₀∈Z such that x is locally finitely convergent with respect to F_k on {n₀,…,n₀+k−1}, then x is finitely convergent with respect to F_k. In this paper, we obtain some sufficient conditions for a sequence finitely converging with respect to median filters. Based on these results, we prove that the conjecture is true.     

Factorization of Trinomials over Galois Fields of Characteristic 2

We study the parity of the number of irreducible factors of trinomials over Galois fields of characteristic 2. As a consequence, some sufficient conditions for a trinomial being reducible are obtained. For example,xⁿ+ax^k+bGF(2^t)[x] is reducible if bothn,tare even, except possibly whenn= 2k,kodd. The caset= 1 was treated by R. G. Swan (Pacific J. Math.12,No. 2 (1962), 1099–1106), who showed thatxⁿ+x^k+ 1 is reducible overGF(2) if 8|n.     

Properties of convergence for -Bernstein polynomials

In this paper, we discuss properties of the ω,q-Bernstein polynomials introduced by S. Lewanowicz and P. Woźny in [S. Lewanowicz, P. Woźny, Generalized Bernstein polynomials, BIT 44 (1) (2004) 63–78], where fC[0,1], ω,q>0, ω≠1,q⁻¹,…,q⁻ⁿ⁺¹. When ω=0, we recover the q-Bernstein polynomials introduced by [G.M. Phillips, Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511–518]; when q=1, we recover the classical Bernstein polynomials. We compute the second moment of , and demonstrate that if f is convex and ω,q(0,1) or (1,∞), then are monotonically decreasing in n for all x[0,1]. We prove that for ω(0,1), q_n(0,1], the sequence converges to f uniformly on [0,1] for each fC[0,1] if and only if lim_n→∞q_n=1. For fixed ω,q(0,1), we prove that the sequence converges for each fC[0,1] and obtain the estimates for the rate of convergence of by the modulus of continuity of f, and the estimates are sharp in the sense of order for Lipschitz continuous functions.     

Pseudo-randomness of van der Corput’s sequences

The aim of this paper is to find main terms of the star D _N ^* and extremal D _N discrepancies of the two dimensional sequence (x _n , x _n+1), n = 0, 1, 2, ..., N − 1, where x _n , n = 0, 1, 2, ..., is the van der Corput sequence. This give a quantitative form of a well-known result that van der Corput sequence is not pseudorandom. This research was supported by the Slovak Academy of Sciences Vega Grant No. 2/7138/27.     

The number of components of complements to level surfaces of partially harmonic polynomials

In this paperk-harmonic polynomials in ℝ ⁿ , i.e. polynomials satisfying the Laplace equation with respect tok variables: ∂²/∂x ₁ ² +...+∂²/∂x _k ² F=0 are considered; here 1≤k≤n andn≥2. For a polynomialF (of degreem) of this type, it is proved that the number of components of the complements of its level sets does not exceed 2m ⁿ⁻¹+O(m ⁿ⁻²). Under the assumptions that the singular set of the level surface is compact or that the leading homogeneous part of thek-harmonic polynomialF is nondegenerate, sharper estimates are also established. Translated fromMatematicheskie Zametki, Vol. 62, No. 6, pp. 831–835, December, 1997 Translated by S. S. Anisov     

The asymptotic formula in Waring’s problem for one square and seventeen fifth powers

Let R _k,s (n) denote the number of solutions of the equation n = x² + y₁^k + y₂^k + ?+ y_s^k{n= x^2 + y_1^k + y_2^k + \cdots + y_s^k} in natural numbers x, y ₁, . . . , y _s . By a straightforward application of the circle method, an asymptotic formula for R _k,s (n) is obtained when k ≥ 3 and s ≥ 2 ^k–1 + 2. When k ≥ 6, work of Heath-Brown and Boklan is applied to establish the asymptotic formula under the milder constraint s ≥ 7 · 2 ^k–4 + 3. Although the principal conclusions provided by Heath-Brown and Boklan are not available for smaller values of k, some of the underlying ideas are still applicable for k = 5, and the main objective of this article is to establish an asymptotic formula for R _5,17(n) by this strategy.