Generalization of certain subclasses of multivalent functions with negative coefficients defined by using a differential operator

Making use of a differential operator, we introduce and study a certain class SC_n(j,p,q,α,λ) of p-valently analytic functions with negative coefficients. In this paper, we obtain numerous sharp results including (for example ) coefficient estimates, distortion theorem, radii of close-to convexity, starlikeness and convexity and modified Hadamard products of functions belonging to the class SC_n(j,p,q,α,λ). Finally, several applications investigate an integral operator, and certain fractional calculus operators are also considered.     

A new class of symmetric polynomials defined in terms of tableaux

A new class of symmetric polynomials in n variables z = (z₁,…, z_n), denoted t_λ(z), and labelled by partitions λ = [λ₁ … λ_n] is defined in terms of standard tableaux (equivalently, in terms of Gel'fand-Weyl patterns of the general linear group GL(n,C)). The t_λ(z) are shown to be a -basis of the ring of all symmetric polynomials in n variables. In contrast to the usual basis sets such as the Schur functions e_λ(z), which are homogeneous polynomials in the z_i, the t_λ(z) are inhomogeneous. This property is reflected in the fact that the t_λ(z) are a natural basis for the expansion of certain (inhomogeneous) symmetric polynomials constructed from rising factorials. This and several other properties of the t_λ(z) are proved. Two generalizations of the t_λ(z) are also given. The first generalizes the t_λ(z) to a 1-parameter family of symmetric polynomials, T_λ(α; z), where α is an arbitrary parameter. The T_λ(α; z) are shown to possess properties similar to those of the t_λ(z). The second generalizes the t_λ(z) to a class of skew-tableau symmetric polynomials, t_λ/μ(z), for which only a few preliminary results are given.     

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

Error bounds for least squares approximation by polynomials

Let f ε Cⁿ⁺¹[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial approximation to f with respect to the orthonormal polynomials q_k associated with a distribution dα on [−1, 1]. It is shown that if q_n+1/q_n max(q_n+1(1)/q_n(1), −q_n+1(−1)/q_n(−1)), then f − H[f] f^{n + 1} · q_n+1/q_{n + 1}^{(n + 1)}, where · denotes the supremum norm. Furthermore, it is shown that in the case of Jacobi polynomials with distribution (1 − t)^α (1 + t)^β dt, α, β > −1, the condition on q_n+1/q_n is satisfied when either max(α,β) −1/2 or −1 < α = β < −1/2.     

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.     

Estimates for the first and second derivatives of the Stieltjes polynomials

Let w_λ(x)(1−x²)^λ−1/2 and P_n^(λ) be the ultraspherical polynomials with respect to w_λ(x). Then we denote E_n+1^(λ) the Stieltjes polynomials with respect to w_λ(x) satisfyingIn this paper, we give estimates for the first and second derivatives of the Stieltjes polynomials E_n+1^(λ) and the product E_n+1^(λ)P_n^(λ) by obtaining the asymptotic differential relations. Moreover, using these differential relations we estimate the second derivatives of E_n+1^(λ)(x) and E_n+1^(λ)(x)P_n^(λ)(x) at the zeros of E_n+1^(λ)(x) and the product E_n+1^(λ)(x)P_n^(λ)(x), respectively.     

A continuous function space with a Faber basis

Let be compact with #S=∞ and let C(S) be the set of all real continuous functions on S. We ask for an algebraic polynomial sequence (P_n)_n=0^∞ with deg P_n=n such that every fC(S) has a unique representation f=∑_i=0^∞ α_iP_i and call such a basis Faber basis. In the special case of , 0<q<1, we prove the existence of such a basis. A special orthonormal Faber basis is given by the so-called little q-Legendre polynomials. Moreover, these polynomials state an example with A(S_q)≠U(S_q)=C(S_q), where A(S_q) is the so-called Wiener algebra and U(S_q) is the set of all fC(S_q) which are uniquely represented by its Fourier series.     

On the Uniform Approximation of a Class of Analytic Functions by Bruwier Series

For a class of analytic functions f(z) defined by Laplace–Stieltjes integrals the uniform convergence on compact subsets of the complex plane of the Bruwier series (B-series) ∑^∞_n=0 λ_n(f) , λ_n(f)=f⁽ⁿ⁾(nc)+cf⁽ⁿ⁺¹⁾(nc), generated by f(z) and the uniform approximation of the generating function f(z) by its B-series in cones |arg z|< is shown.     

Two-pattern strings II—frequency of occurrence and substring complexity

The previous paper in this series introduced a class of infinite binary strings, called two-pattern strings, that constitute a significant generalization of, and include, the much-studied Sturmian strings. The class of two-pattern strings is a union of a sequence of increasing (with respect to inclusion) subclasses T_λ of two-pattern strings of scope λ, λ=1,2,…. Prefixes of two-pattern strings are interesting from the algorithmic point of view (their recognition, generation, and computation of repetitions and near-repetitions) and since they include prefixes of the Fibonacci and the Sturmian strings, they merit investigation of how many finite two-pattern strings of a given size there are among all binary strings of the same length. In this paper we first consider the frequency f_λ(n) of occurrence of two-pattern strings of length n and scope λ among all strings of length n on {a,b}: we show that lim_n→∞f_λ(n)=0, but that for strings of lengths n2λ, two-pattern strings of scope λ constitute more than one-quarter of all strings. Since the class of Sturmian strings is a subset of two-pattern strings of scope 1, it was natural to focus the study of the substring complexity of two-pattern strings to those of scope 1. Though preserving the aperiodicity of the Sturmian strings, the generalization to two-pattern strings greatly relaxes the constrained substring complexity (the number of distinct substrings of the same length) of the Sturmian strings. We derive upper and lower bounds on C₁(k) (the number of distinct substring of length k) of two-pattern strings of scope 1, and we show that it can be considerably greater than that of a Sturmian string. In fact, we describe circumstances in which lim_k→∞(C₁(k)−k)=∞.     

The Helmholtz decomposition of weightedLq-spaces for Muckenhoupt weights

We consider weights of Muckenhoupt classA _q, 1<q<∞. For a bounded Lipschitz domain Ω⊂ℝⁿ we prove a compact embedding and a Poincaré inequality in weighted Sobolev spaces. These technical tools allow us to solve the weak Neumann problem for the Laplace equation in weighted spaces on ℝⁿ, ℝⁿ ₊, on bounded and on exterior domains Ω with boundary of classC ¹, which will yield the Helmholtz decomposition ofL _ω ^q(Ω)ⁿ for general ω∈A _q. This is done by transferring the method of Simader and Sohr [4] to the weighted case. Our result generalizes a result of Farwig and Sohr [2] where the Helmholtz decomposition ofL _ω ^p(Ω)ⁿ is proved for an exterior domain and weights of Muckenhoupt class without singularities or degeneracies in a neighbourhood of ϖΩ.

---

Sunto In questo lavoro consideriamo dei pesi della classe di MuckenhouptA _q, 1<q<∞. Per un dominio limitato lipschitziano Ω⊂ℝⁿ, dimostriamo una immersione compatta ed una disuguaglianza di Poincaré in spazi di Sobolev con peso. Questa tecnica ci consente di risolvere il problema debole di Neumann per l’equazione di Laplace in spazi pesati in ℝⁿ, ℝⁿ ₊ in domini limitati ed in domini esterni con frontiera di classeC ¹, che conduce alla decomposizione di Helmholtz diL _ω ^q(Ω)ⁿ per un qualsiasi ω∈A _q. Il risultato è ottenuto trasferendo il metodo di Simader e Sohr [4] al caso pesato. Quello qui presente estende un risultato di Farwig e Sohr [2] dove la decomposizione di Helmholtz diL _ω ^q(Ω)ⁿ è dimostrata per domini esterni e pesi della classe di Muckenhoupt privi di singolarità in un intorno di ϖΩ.

     

Équations du type Monge-Ampère sur les variétés Riemanniennes compactes, I

Let (V_n, g) be a C^∞ compact Riemannian manifold. For a suitable function on V_n, let us consider the change of metric: g′ = g + Hess(), and the function, as a ratio of two determinants, M() = ¦g′¦ ¦g¦⁻¹. Using the method of continuity, we first solve in C^∞ the problem: Log M() = λ + ƒ, λ > 0, ƒ ε C^∞. Then, under weak hypothesis on F, we solve the general equation: Log M() = F(P, ), F in C^∞(V_n × ¦α, β¦), using a method of iteration. Our study gives rise to an interesting a priori estimate on ¦¦, which does not occur in the complex case. This estimate should enable us to solve the equation above when λ 0, providing we can overcome difficulties related to the invertibility of the linearised operator. This open question will be treated in our next article.     

Strong limit theorems for quasi-orthogonal random fields

This is a systematic and unified treatment of a variety of seemingly different strong limit problems. The main emphasis is laid on the study of the a.s. behavior of the rectangular means ζ_mn = 1/(λ₁(m) λ₂(n)) Σ_i=1^m Σ_k=1ⁿ X_ik as either max{m, n} → ∞ or min{m, n} → ∞. Here {X_ik: i, k ≥ 1} is an orthogonal or merely quasi-orthogonal random field, whereas {λ₁(m): m ≥ 1} and {λ₂(n): n ≥ 1} are nondecreasing sequences of positive numbers subject to certain growth conditions. The method applied provides the rate of convergence, as well. The sufficient conditions obtained are shown to be the best possible in general. Results on double subsequences and 1-parameter limit theorems are also included.     

Note on multidimensional empirical processes for φ-mixing random vectors

In 1974, Sen proved weak convergence of the empirical processes (in the J₁-topology on D^p[0, 1]) for a stationary φ-mixing sequence of stochastic p( 1)-vectors. In this note, we show that Sen's theorem on weak convergence of the multidimensional empirical process for a stationary φ-mixing sequence of stochastic vectors remains true under a less restrictive condition on the mixing constants {φ_n}, i.e., φ_n = O(n^−1−δ) for some δ > 0.     

On the Behaviour of Zeros of Jacobi Polynomials

Denote by x_n,k(α,β) and x_n,k(λ)=x_n,k(λ−1/2,λ−1/2) the zeros, in decreasing order, of the Jacobi polynomial P^(α,β)_n(x) and of the ultraspherical (Gegenbauer) polynomial C^λ_n(x), respectively. The monotonicity of x_n,k(α,β) as functions of α and β, α,β>−1, is investigated. Necessary conditions such that the zeros of P^(a,b)_n(x) are smaller (greater) than the zeros of P^(α,β)_n(x) are provided. A. Markov proved that x_n,k(a,b)<x_n,k(α,β) (x_n,k(a,b)>x_n,k(α,β)) for every n and each k, 1kn if a>α and b<β (a<α and b>β). We prove the converse statement of Markov's theorem. The question of how large the function f_n(λ) could be such that the products f_n(λ)x_n,k(λ), k=1,…,[n/2] are increasing functions of λ, for λ>−1/2, is also discussed. Elbert and Siafarikas proved that f_n(λ)=(λ+(2n²+1)/(4n+2))^1/2 obeys this property. We establish the sharpness of their result.     

Polynomials of binomial type and compound Poisson processes

Let q_nand s_n, n ε N, respectively, be a set of polynomials of binomial type and a Sheffer set related to it, both having positive coefficients. Then q_n(x), x > 0 is connected with the probability that a compound Poisson process starting at zero is in state n at time τx andq_n(x)/q_n(1) is the probability generating function of the number of jumps of this process in [0, τ] given that it is in state n at time τ. The s_n admit similar interpretations when the initial distribution of the compound Poisson process is not concentrated at zero. The possible limits for n → ∞ ofq_n(x)/q_n(1)ands_n(x)/s_n(1) are studied.     

Polynomial Projections inC[−1, 1] andL(−1, 1) with Growthn, 0<γ1/2

Forγ(0, 1/2] we constructn-dimensional polynomial subspacesY_nofC[−1, 1] andL¹(−1, 1) such that the relative projection constantsλ(Y_n, C[−1, 1]) andλ(Y_n, L¹(−1, 1)) grow asn^γ. These subspaces are spanned by Chebyshev polynomials of the first and second kind, respectively. The spacesL¹_{w(α, β}wherew_{α, β}is the weight function of the Jacobi polynomials and (α, β){(−1/2, −1/2), (−1/2, 0), (0, −1/2)} are also studied.     

Multi-Resolution Analysis of Multiplicity d: Applications to Dyadic Interpolation

This paper studies the Multi-Resolution Analyses of multiplicity d (d *), that is, the families (V_n)_n of closed subspaces in ²( ) such that V_n V_{n + 1}, V_{n + 1} = DV_n, where Dƒ(x) = ƒ(2x), and such that there exists a Riesz basis for V₀ of the form {φ_i(· − k), i = 1, . . . , d,k }, with φ₁, . . . , φ_d V₀. Using the Fourier transform, we prove that (λ) = ^t[ ₁(λ), . . . , _d(λ)] = H(λ/2) (λ/2), where H is in the set _d of continuous 1-periodic functions taking values in (d, ). If d = 1, the definition corresponds to the standard Multi-Resolution Analyses, and one can characterize the regular 1-periodic complex-valued functions H (called, then, scaling filters) which yield a Multi-Resolution Analysis. In this paper, we generalize this study to d ≥ 2 by giving conditions on H _d so that there exists = ^t[ ₁, . . . , _d] in ²( , ^d) solution of (λ) = H(λ/2) (λ/2), and so that the integer translates of φ₁, . . . , φ_d form a Riesz family. Then, the latter span the space V₀ of a Multi-Resolution Analysis of multiplicity d. We show that the conditions on H focus on the zeros of det H(·) and on simple spectral hypotheses for the operator P_H defined on _d by P_HF(λ) = H(λ/2)F(λ/2)H(λ/2)* + H(λ/2 + 1/2)F(λ/2 + 1/2)H(λ/2 + 1/2)*. Finally, we explore connections with the order r dyadic interpolation schemes, where r *.     

Trace cocharacters and the Kronecker products of Schur functions

It follows from the theory of trace identities developed by Procesi and Razmyslov that the trace cocharacters arising from the trace identities of the algebra M_r(F) of r×r matrices over a field F of characteristic zero are given by TC_r,n=∑_λΛr(n)χ^λχ^λ where χ^λχ^λ denotes the Kronecker product of the irreducible characters of the symmetric group associated with the partition λ with itself and Λ_r(n) denotes the set of partitions of n with r or fewer parts, i.e. the set of partitions λ=(λ₁λ_k) with kr. We study the behavior of the sequence of trace cocharacters TC_r,n. In particular, we study the behavior of the coefficient of χ^(ν,n−m) in TC_r,n as a function of n where ν=(ν₁ν_k) is some fixed partition of m and n−mν_k. Our main result shows that such coefficients always grow as a polynomial in n of degree r−1.     

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.