Negative result in pointwise 3-convex polynomial approximation

Let Δ³ be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function f ∈ C ^r [−1, 1] ⋂ Δ³ [−1, 1] such that ∥f ^(r)∥ _{C[−1, 1]} ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ³ [−1, 1], there exists x such that

Polynomials of best approximation inC[−1,1]

Equivalences between the condition |P _n ^(k) (x)|≦K(n ⁻¹√1−x ²+1/n ²) ^k n ^-a, whereP _n(x) is the bestn-th degree polynomial approximation tof(x), and the Peetre interpolation space betweenC[−1,1] and the space (1−x ²) ^k f ^(2k)(x)∈C[−1,1] is established. A similar result is shown forE _n(f)= ‖f−P _n‖ _C[−1,1]. Rates other thann ^-a are also discussed. Supported by NSERC grant A4816 of Canada.     

Are the degrees of best (co)convex and unconstrained polynomial approximation the same?

Let ℂ[−1,1] be the space of continuous functions on [−,1], and denote by Δ² the set of convex functions f ∈ ℂ[−,1]. Also, let E _n (f) and E _n ⁽²⁾ (f) denote the degrees of best unconstrained and convex approximation of f ∈ Δ² by algebraic polynomials of degree < n, respectively. Clearly, En (f) ≦ E _n ⁽²⁾ (f), and Lorentz and Zeller proved that the inverse inequality E _n ⁽²⁾ (f) ≦ cE _n (f) is invalid even with the constant c = c(f) which depends on the function f ∈ Δ². In this paper we prove, for every α > 0 and function f ∈ Δ², that

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

 Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ ⁿ :Ex≤1,x≥0}, P(C)={x∈ℜ ⁿ :Cx≤1,x≥0}, α _E (G)=max{1 ^T x subject to x∈P(E)}, and α _C (G)= max{1 ^T x subject to x∈P(C)}. In this paper we prove that if α _E (G)=α _C (G), then γ(G)=θ(G). Received: May 20, 1998?Final version received: April 12, 1999     

On simultaneous approximation to a differentiable function and its derivative by inverse Pal-Type interpolation polynomials

Let ξ_{n −1} < ξ_{n −2} < ξ_{n − 2} < ... < ξ₁ be the zeros of the the (n−1)-th Legendre polynomial P_n−1(x) and −1=x_n<x_n−1<...<x₁=1, the zeros of the polynomial . By the theory of the inverse Pal-Type interpolation, for a function f(x)∈C _[−1,1] ¹ , there exists a unique polynomial R_n(x) of degree 2n−2 (if n is even) satisfying conditions R_n(f, ξ_k) = f (ε_k) (1 ⩽ k ⩽ n −1); R¹ _n(f,x_k)=f¹(x_k)(1≤k≤n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {R_n(f, x)} (n is even) and the main result of this paper is that if f∈C _[1,1] ^r , r≥2, n≥r+2, and n is even then |R¹ _n(f,x)−f¹(x)|=0(1)|W_n(x)|h(x)·n^3−r·E_2n−r−3(f^(r)) holds uniformly for all x∈[−1,1], where .     

Propertyf −1(S) =g −1(S) for entire and meromorphicP-adic functions

LetW be an algebraically closed filed of characteristic zero, letK be an algebraically closed field of characteristic zero, complete for an ultrametric absolute value, and letA(K) (resp. ℳ(K)) be the set of entire (resp. meromorphic) functions inK. For everyn≥7, we show that the setS _n(b) of zeros of the polynomialx ⁿ−b (b≠0) is such that, iff, g ∈W[x] or iff, g ∈A(K), satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), thenf ⁿ=g ⁿ. For everyn≥14, we show thatS _n(b) is such that iff, g ∈W({tx}) or iff, g ∈ ℳ(K) satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), then eitherf ⁿ=g ⁿ, orfg is a constant. Analogous properties are true for complex entire and meromorphic functions withn≥8 andn≥15, respectively. For everyn≥9, we show that the setY _n(c) of zeros of the polynomial , (withc≠0 and 1) is an ursim ofn points forW[x], and forA(K). For everyn≥16, we show thatY _n(c) is an ursim ofn points forW(x), and for ℳ(K). We follow a method based on thep-adic Nevanlinna Theory and use certain improvement of a lemma obtained by Frank and Reinders.     

Generalized derivations with Engel condition on multilinear polynomials

Let R be a prime ring with extended centroid C, δ a nonzero generalized derivation of R, f(x ₁, ..., x _n ) a nonzero multilinear polynomial over C, I a nonzero right ideal of R and k ≥ a fixed integer. If [δ(f(r ₁, ..., r _n )), f(r ₁, ..., r _n )] _k = 0, for all r ₁, ..., r _n ∈ I, then either δ(x) = ax, with (a-γ)I = 0 and a suitable γ ∈ C or there exists an idempotent element e ∈ soc(RC) such that IC = eRC and one of the following holds (1) if char(R) = 0 then f(x ₁, ..., x _n ) is central valued in eRCe (2) if char(R) = p > 0 then is central valued in eRCe, for a suitable s ≥ 0, unless when char(R) = 2 and eRCe satisfies the standard identity s ₄ (3) δ(x) = ax−xb, where (a+b+α)e = 0, for α ∈ C, and f(x ₁, ..., x _n )² is central valued in eRCe.     

An Application of a Mountain Pass Theorem

We are concerned with the following Dirichlet problem: −Δu(x) = f(x, u), x∈Ω, u∈H ¹ ₀(Ω), (P) where f(x, t) ∈C (×ℝ), f(x, t)/t is nondecreasing in t∈ℝ and tends to an L ^∞-function q(x) uniformly in x∈Ω as t→ + ∞ (i.e., f(x, t) is asymptotically linear in t at infinity). In this case, an Ambrosetti-Rabinowitz-type condition, that is, for some θ > 2, M > 0, 0 > θF(x, s) ≤f(x, s)s, for all |s|≥M and x∈Ω, (AR) is no longer true, where F(x, s) = ∫ ^s ₀ f(x, t)dt. As is well known, (AR) is an important technical condition in applying Mountain Pass Theorem. In this paper, without assuming (AR) we prove, by using a variant version of Mountain Pass Theorem, that problem (P) has a positive solution under suitable conditions on f(x, t) and q(x). Our methods also work for the case where f(x, t) is superlinear in t at infinity, i.e., q(x) ≡ +∞. Received June 24, 1998, Accepted January 14, 2000.     

Derivations with power central values on multilinear polynomials in prime rings

Let R be a prime ring of char R ≠ = 2 with center Z(R) and with extended centroid C, d a nonzero derivation of R and f(x ₁, ..., x _n ) a nonzero multilinear polynomial over C. Suppose that x ^s d(x)x ^t ∈ Z(R) for all x ∈ {d(f(x ₁, ..., x _n ))|x ₁, ..., x _n ∈ ρ}, where ρ is a nonzero right ideal of R and s ≥ 0, t ≥ 0 are fixed integers. If d(ρ)ρ ≠ = 0, then ρ C = eRC for some idempotent e in the socle of RC and f(x ₁, ..., x _n ) ^N is central-valued in eRCe, where N = s + t + 1.      

Spline monotone approximation with linear differential operators

Let f∈C³[a,b] and L be a linear differential operator such that L(f)≥0. Then there exists a sequence Q_n, n≥1, of polynomial splines with equally spaced knots, such that Q^(r), approximates f^(r), 0≤r≤s, simultaneously in the uniform norm. This approximation is given through inequalities with rates, involving a measure of smoothness to f^(s); so that L (Q_n)≥0. The encountered cases are the continuous, periodic and discrete.     

On the order of growth of solutions of algebraic differential equations

Assume thatf is an integer transcendental solution of the differential equationP _n (z, f, f′)=P _n−1(z, f, f′, ... f ^(p)), whereP _n andP _n−1 are polynomials in all variables, the degree ofP _n with respect tof andf′ is equal ton, and the degree ofP _n−1 with respect tof, f′, ... f ^(p) is at mostn−1. We prove that the order ρ of growth off satisfies the relation 1/2≤ρ<∞. We also prove that if ρ=1/2, then, for a certain real ν, in the domain {z: ν<argz<ν+2π}/E _*, whereE _* is a certain set of disks with finite sum of radii, the estimate lnf(z)=z ^1/2 (β+o(1)), β∈C, holds forz=re ^iϕ,r≥r(ϕ)≥0. Furthermore, on the ray {z: argz=ν}, the following relation is true: ln‖f(re ^iν)‖=o(r ^1/2),r→+∞,r>0, , where Δ is a certain set on the semiaxisr>0 with mes Δ<∞. “L'vivs'ka Politekhnika” University, Lvov. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 51, No. 1, pp. 69–77, January, 1999.     

Optimal properties of contraction semigroups in banach spaces

Suppose that(T _t )_t>0 is aC ₀ semi-group of contractions on a Banach spaceX, such that there exists a vectorx∈X, ‖x‖=1 verifyingJ ⁻¹(Jx)={x}, whereJ is the duality mapping fromX toP(X ^*). If |<T _t x,f>|→1, whent→+∞ for somef∈X ^*, ‖f‖≤1 thenx is an eigenvector of the generatorA, associated with a purcly imaginary eigenvalue. Because of Lin's example [L], the hypothesis onx∈X is the best possible. If the hypothesisJ ⁻¹(Jx)={x} is not verified, we can prove that ifJx is a singleton and ifJ ⁻¹(Jx) is weakly compact, then if |<T _t x, f>|→1, whent→+∞ for somef∈X ^*, ‖f‖≤1, there existsy∈J ⁻¹(Jx) such thaty is an eigenvector of the generatorA, associated with a purely imaginary eigenvalue. We give also a counter-example in the case whereX is one of the spaces ℓ₁ orL ₁.     

On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations

An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y {0,1}ⁿ, d_H (f(x), f(y)) ≥ d_H (x, y) + d, if d_H (x, y) ≤ (n + k) − d and d_H (f(x), f(y)) = n + k, if d_H (x, y) > (n + k) − d. In this paper, we construct an (n,3,2)-mapping for any positive integer n ≥ 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P(n, r) denote the maximum size of an (n, r)-permutation array and A(n, r) denote the same setting for binary codes. Applying (n,3,2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode) with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359–365, Chang et al. (2003). IEEE Trans Inf Theory 49:1054–1059; Huang et al. (submitted)]. More precisely, we obtain that, for n ≥ 8, P(n, r) ≥ A(n − 2, r − 3) > A(n − 1,r − 2) = A(n, r − 1) when n is even and P(n, r) ≥ A(n − 2, r − 3) = A(n − 1, r − 2) > A(n, r − 1) when n is odd. This improves the best bound A(n − 1,r − 2) so far [Huang et al. (submitted)] for n ≥ 8. The work was supported in part by the National Science Council of Taiwan under contract NSC-93-2213-E-009-117     

On linguistic dynamical systems,families of graphs of large girth,and cryptography

The paper is devoted to the study of a linguistic dynamical system of dimension n ≥ 2 over an arbitrary commutative ring K, i.e., a family F of nonlinear polynomial maps f _α : K ⁿ → K ⁿ depending on “time” α ∈ {K − 0} such that f _α ⁻¹ = f _−αM, the relation f _α1 (x) = f _α2 (x) for some x ∈ Kⁿ implies α₁ = α₂, and each map f _α has no invariant points. The neighborhood {f _α (υ)∣α ∈ K − {0}} of an element v determines the graph Γ(F) of the dynamical system on the vertex set Kⁿ. We refer to F as a linguistic dynamical system of rank d ≥ 1 if for each string a = (α₁, υ, α₂), s ≤ d, where α_i + α_i+1 is a nonzero divisor for i = 1, υ, d − 1, the vertices υ _a = f _α1 × ⋯ × f _αs (υ) in the graph are connected by a unique path. For each commutative ring K and each even integer n ≠= 0 mod 3, there is a family of linguistic dynamical systems L_n(K) of rank d ≥ 1/3n. Let L(n, K) be the graph of the dynamical system L_n(q). If K = F_q, the graphs L(n, F_q) form a new family of graphs of large girth. The projective limit L(K) of L(n, K), n → ∞, is well defined for each commutative ring K; in the case of an integral domain K, the graph L(K) is a forest. If K has zero divisors, then the girth of K drops to 4. We introduce some other families of graphs of large girth related to the dynamical systems L_n(q) in the case of even q. The dynamical systems and related graphs can be used for the development of symmetric or asymmetric cryptographic algorithms. These graphs allow us to establish the best known upper bounds on the minimal order of regular graphs without cycles of length 4n, with odd n ≥ 3. Bibliography: 42 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 326, 2005, pp. 214–234.     

On the almost monotone convergence of sequences of continuous functions

A sequence (f _n ) _n of functions f _n : X → ℝ almost decreases (increases) to a function f: X → ℝ if it pointwise converges to f and for each point x ∈ X there is a positive integer n(x) such that f _n+1(x) ≤ f _n (x) (f _n+1(x) ≥ f _n (x)) for n ≥ n(x). In this article I investigate this convergence in some families of continuous functions.     

A note on Lagrange interpolation of functions of generalized bounded variation

In this paper we solve a remained problem in [2], whether the following estimate approximation for the classf∈[-1, 1]∩BV by Lagrange interpolation based on the Jacobi abscissas: L _n ^(a,d) (f,x)−f(x)=O(1/n) holds, if α≠β α,β≥−1. The project is supported by the Natural Science Foundation of Zhejiang Province.     

Another Note on Polynomial vs Rational Approximation

LetEbe a subspace ofC(X) and letR(E)=g/h : g, hE; h>0}. We make a simple, yet intriguing observation: if zero is a best approximation toffromE, then zero is a best approximation toffromR(E). We also prove that if {E_n} is dense inC(X) then for almost allf(in the sense of category)[formula]That extends the results of P. Borwein and S. Zhou who proved it for the case whenE_nis the space of algebraic or trigonometric polynomials of degreen.     

Multipliers for logarithmic Cauchy integrals in the ball

Let B _n denote the unit ball in \mathbbC \mathbb{C} ⁿ , n ≥ 1. Let K \mathcal{K} ₀(n) denote the class of functions defined for z ∈ B _n as a constant plus the integral of the kernel log(1/(1 −〈z, ζ〉)) against a complex Borel measure on the sphere {ζ ∈ \mathbbC \mathbb{C} ⁿ ,: |ζ| = 1}. Properties of holomorphic functions g such that fg ∈ K \mathcal{K} ₀(n) for all f ∈ K \mathcal{K} ₀(n) are studied. The extended Cesàro operators are investigated on the spaces K \mathcal{K} ₀(n), n ≥ 1. Bibliography: 15 titles.     

A problem on simultaneous approximation and a conjecture of Hasson

In 1980, M. Hasson raised a conjecture as follows: Let N≥1, then there exists a function f₀(x)∈C _[−1,1] ^2N , for N+1≤k≤2N, such that p _n ^(k) (f₀,1)→f ₀ ^(k) (1), n→∞, where p_n(f,x) is the algebraic polynomial of best approximation of degree ≤n to f(x). In this paper, a, positive answer to this conjecture is given.     

Moderate Deviations for Random Sums of Heavy-Tailed Random Variables

Let {Xn;n≥ 1} be a sequence of independent non-negative random variables with common distribution function F having extended regularly varying tail and finite mean μ = E（X1） and let {N（t）; t ≥0} be a random process taking non-negative integer values with finite mean λ（t） = E（N（t）） and independent of {Xn; n ≥1}. In this paper, asymptotic expressions of P（（X1 ＋… ＋XN（t）） -λ（t）μ 〉 x） uniformly for x ∈[γb（t）, ∞） are obtained, where γ〉 0 and b（t） can be taken to be a positive function with limt→∞ b（t）/λ（t） = 0.