Properties of convergence for the q-Meyer-König and Zeller operators

In this paper, we discuss properties of convergence for the q-Meyer-König and Zeller operators Mn,q. Based on an explicit expression for Mn,q(t²,x) in terms of q-hypergeometric series, we show that for qn∈(0,1], the sequence (Mn,qn(f))_n?1 converges to f uniformly on [0,1] for each f∈C[0,1] if and only if limn→∞qn=1. For fixed q∈(0,1), we prove that the sequence (Mn,q(f)) converges for each f∈C[0,1] and obtain the estimates for the rate of convergence of (Mn,q(f)) by the modulus of continuity of f, and the estimates are sharp in the sense of order for Lipschitz continuous functions. We also give explicit formulas of Voronovskaya type for the q-Meyer-König and Zeller operators for fixed 0<q<1. If 0<q<1, f∈C¹[0,1], we show that the rate of convergence for the Meyer-König and Zeller operators is o(qn) if and only if

     

On the evaluation of some Selberg-like integrals

Several methods of evaluation are presented for a family {In,d,p} of Selberg-like integrals that arise in the computation of the algebraic-geometric degrees of a family of spherical nilpotent orbits associated to the symmetric space of a simple real Lie group. Adapting the technique of Nishiyama, Ochiai and Zhu, we present an explicit evaluation in terms of certain iterated sums over permutation groups. The resulting formula, however, is only valid when the integrand involves an even power of the Vandermonde determinant. We then apply, to the general case, the theory of symmetric functions and obtain an evaluation of the integral In,d,p as a product of polynomial of fixed degree times a particular product of gamma factors; thereby identifying the asymptotics of the integrals with respect to their parameters. Lastly, we derive a recursive formula for evaluation of another general class of Selberg-like integrals, by applying some of the technology of generalized hypergeometric functions.     

Augmented truncation approximations of discrete-time Markov chains

Let P be a positive recurrent infinite transition matrix with invariant distribution π and be a truncated and arbitrarily augmented stochastic matrix with invariant distribution _(n)π. We investigate the convergence ‖_(n)π−π‖→0, as n→∞, and derive a widely applicable sufficient criterion. Moreover, computable bounds on the error ‖_(n)π−π‖ are obtained for polynomially and geometrically ergodic chains. The bounds become rather explicit when the chains are stochastically monotone.     

Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing

We consider sequences of graphs (Gn) and define various notions of convergence related to these sequences: “left convergence” defined in terms of the densities of homomorphisms from small graphs into Gn; “right convergence” defined in terms of the densities of homomorphisms from Gn into small graphs; and convergence in a suitably defined metric.In Part I of this series, we show that left convergence is equivalent to convergence in metric, both for simple graphs Gn, and for graphs Gn with nodeweights and edgeweights. One of the main steps here is the introduction of a cut-distance comparing graphs, not necessarily of the same size. We also show how these notions of convergence provide natural formulations of Szemerédi partitions, sampling and testing of large graphs.     

Variational problems of nonlinear elasticity in certain classes of mappings with finite distortion

We study the problem of minimizing the functional \(I(\phi ) = \int\limits_\Omega {W(x,D\phi )dx}\) on a new class of mappings. We relax summability conditions for admissible deformations to φ ∈ W _n ¹ (Ω) and growth conditions on the integrand W(x, F). To compensate for that, we require the condition \(\frac{{\left| {D\phi (x)} \right|^n }} {{J(x,\phi )}} \leqslant M(x) \in L_s (\Omega )\), s > n ? 1, on the characteristic of distortion. On assuming that the integrand W(x, F) is polyconvex and coercive, we obtain an existence theorem for the problem of minimizing the functional I(φ) on a new family of admissible deformations A.     

Convergence and computation of simultaneous rational quadrature formulas

We discuss the convergence and numerical evaluation of simultaneous quadrature formulas which are exact for rational functions. The problem consists in integrating a single function with respect to different measures using a common set of quadrature nodes. Given a multi-index n, the nodes of the integration rule are the zeros of the multi-orthogonal Hermite–Padé polynomial with respect to (S, α, n), where S is a collection of measures, and α is a polynomial which modifies the measures in S. The theory is based on the connection between Gauss-type simultaneous quadrature formulas of rational type and multipoint Hermite–Padé approximation. The numerical treatment relies on the technique of modifying the integrand by means of a change of variable when it has real poles close to the integration interval. The output of some tests show the power of this approach in comparison with other ones in use.     

An estimate on the convergence of Baskakov-Bézier operators

In the present paper we estimate the rate of convergence on functions of bounded variation for the Bézier variant of the Baskakov operators Bn,α(f,x). Here we have studied the rate of convergence of Bn,α(f,x) for the case 0<α<1.     

On the guaranteed convergence of new two-point root-finding methods for polynomial zeros

We presented new two-point methods for the simultaneous approximation of all n simple (real or complex) zeros of a polynomial of degree n. We proved that the R-order of convergence of the total-step version is three. Moreover, computationally verifiable initial conditions that guarantee the convergence of one of the proposed methods are stated. These conditions are stated in the spirit of Smale’s point estimation theory; they depend only on available data, the polynomial coefficients, polynomial degree n and initial approximations \(x_{1}^{(0)},\ldots ,x_{n}^{(0)}\) , which is of practical importance. Using the Gauss-Seidel approach we state the corresponding single-step version and consequently its prove that the lower bound of its R-order of convergence is at least 2 + y _n > 3, where y _n ∈ (1, 2) is the unique positive root of the equation y ⁿ ? y ? 2 = 0. Two numerical examples are given to demonstrate the convergence behavior of the considered methods, including global convergence.     

Two-point Taylor expansions in the asymptotic approximation of double integrals. Application to the second and fourth Appell functions

The main difficulty in Laplace's method of asymptotic expansions of double integrals is originated by a change of variables. We consider a double integral representation of the second Appell function F₂(a,b,b^′,c,c^′;x,y) and illustrate, over this example, a variant of Laplace's method which avoids that change of variables and simplifies the computations. Essentially, the method only requires a Taylor expansion of the integrand at the critical point of the phase function. We obtain in this way an asymptotic expansion of F₂(a,b,b^′,c,c^′;x,y) for large b, b^′, c and c^′. We also consider a double integral representation of the fourth Appell function F₄(a,b,c,d;x,y). We show, in this example, that this variant of Laplace's method is uniform when two or more critical points coalesce or a critical point approaches the boundary of the integration domain. We obtain in this way an asymptotic approximation of F₄(a,b,c,d;x,y) for large values of a,b,c and d. In this second example, the method requires a Taylor expansion of the integrand at two points simultaneously. For this purpose, we also investigate in this paper Taylor expansions of two-variable analytic functions with respect to two points, giving Cauchy-type formulas for the coefficients of the expansion and details about the regions of convergence.     

Convergent sequences of composition operators

Composition operators Cφ on the Hilbert Hardy space H² over the unit disk are considered. We investigate when convergence of sequences {φn} of symbols, (i.e., of analytic selfmaps of the unit disk) towards a given symbol φ, implies the convergence of the induced composition operators, Cφn→Cφ. If the composition operators Cφn are Hilbert-Schmidt operators, we prove that convergence in the Hilbert-Schmidt norm, ‖Cφn−CφHS_‖→0 takes place if and only if the following conditions are satisfied: ‖φn−φ_‖2→0, ∫1/(1−²|φ|)<∞, and ∫1/(1−²|φn|)→∫1/(1−²|φ|). The convergence of the sequence of powers of a composition operator is studied.     

Asymptotic energy concentration in the phase space of the weak solutions to the Navier-Stokes equations

We study the asymptotic behavior of the energy of weak solutions of Navier-Stokes equations as t→∞. We characterize the space of the initial data which causes a concentration of the kinetic energy in the phase space. Moreover, an explicit convergence rate is obtained.     

Product decompositions of the symmetric group induced by separable permutations

In this paper we consider the rank generating function of a separable permutation π in the weak Bruhat order on the two intervals [id,π] and [π,w₀], where w₀=n,n−1,…,1. We show a surprising result that the product of these two generating functions is the generating function for the symmetric group with the weak order. We then obtain explicit formulas for the rank generating functions on [id,π] and [π,w₀], leading to the rank-symmetry and unimodality of the two graded posets.     

Effective rates of convergence for Lipschitzian pseudocontractive mappings in general Banach spaces

This paper gives an explicit and effective rate of convergence for an asymptotic regularity result ‖Tx_n−x_n‖→0 due to Chidume and Zegeye in 2004 [14] where (x_n) is a certain perturbed Krasnoselski-Mann iteration schema for Lipschitz pseudocontractive self-mappings T of closed and convex subsets of a real Banach space. We also give a qualitative strengthening of the theorem by Chidume and Zegeye, by weakening the assumption of the existence of a fixed point. For the bounded case, our bound is polynomial in the data involved.     

Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations

We find an explicit combinatorial interpretation of the coefficients of Kerov character polynomials which express the value of normalized irreducible characters of the symmetric groups S(n) in terms of free cumulants R₂,R₃,… of the corresponding Young diagram. Our interpretation is based on counting certain factorizations of a given permutation.     

Convolution identities and lacunary recurrences for Bernoulli numbers

We extend Euler's well-known quadratic recurrence relation for Bernoulli numbers, which can be written in symbolic notation as n(B₀+B₀)=−nBn−1−(n−1)Bn, to obtain explicit expressions for n(Bk+Bm) with arbitrary fixed integers k,m?0. The proof uses convolution identities for Stirling numbers of the second kind and for sums of powers of integers, both involving Bernoulli numbers. As consequences we obtain new types of quadratic recurrence relations, one of which gives B6k depending only on B2k,B2k+2,…,B4k.     

Estimation of Spectral Bounds in Gradient Algorithms

We consider the solution of linear systems of equations Ax=b, with A a symmetric positive-definite matrix in ? ^n×n , through Richardson-type iterations or, equivalently, the minimization of convex quadratic functions (1/2)(Ax,x)?(b,x) with a gradient algorithm. The use of step-sizes asymptotically distributed with the arcsine distribution on the spectrum of A then yields an asymptotic rate of convergence after k<n iterations, k→∞, that coincides with that of the conjugate-gradient algorithm in the worst case. However, the spectral bounds m and M are generally unknown and thus need to be estimated to allow the construction of simple and cost-effective gradient algorithms with fast convergence. It is the purpose of this paper to analyse the properties of estimators of m and M based on moments of probability measures ν _k defined on the spectrum of A and generated by the algorithm on its way towards the optimal solution. A precise analysis of the behavior of the rate of convergence of the algorithm is also given. Two situations are considered: (i) the sequence of step-sizes corresponds to i.i.d. random variables, (ii) they are generated through a dynamical system (fractional parts of the golden ratio) producing a low-discrepancy sequence. In the first case, properties of random walk can be used to prove the convergence of simple spectral bound estimators based on the first moment of ν _k . The second option requires a more careful choice of spectral bounds estimators but is shown to produce much less fluctuations for the rate of convergence of the algorithm.     

On convergence of closed convex sets

In this paper we introduce a convergence concept for closed convex subsets of a finite-dimensional normed vector space. This convergence is called C-convergence. It is defined by appropriate notions of upper and lower limits. We compare this convergence with the well-known Painlevé-Kuratowski convergence and with scalar convergence. In fact, we show that a sequence (An)_n∈NC-converges to A if and only if the corresponding support functions converge pointwise, except at relative boundary points of the domain of the support function of A, to the support function of A.     

Geometric and topological rigidity for compact submanifolds of odd dimension

We investigate rigidity problems for odd-dimensional compact submanifolds.We show that if Mn(n 5)is an odd-dimensional compact submanifold with parallel mean curvature in Sn+p,and if RicM(n-2-1n)(1+H2)and Hδn,whereδn is an explicit positive constant depending only on n,then M is a totally umbilical sphere.Here H is the mean curvature of M.Moreover,we prove that if Mn(n 5)is an odd-dimensional compact submanifold in the space form Fn+p(c)with c 0,and if RicM(n-2-εn)(c+H2),whereεn is an explicit positive constant depending only on n,then M is homeomorphic to a sphere.     

On multiple caps in finite projective spaces

In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k, 2)-caps to caps with larger n. We give explicit constructions for good caps with small n. In particular, we determine the largest size of a (k, 3)-cap in PG(3, 5), which turns out to be 44. The results on caps in PG(3, 5) provide a solution to four of the eight open instances of the main coding theory problem for q = 5 and k = 4.