ON SIMULTANEOUS APPROXIMATION TO A DIFFERENTIABLE FUNCTION AND ITS DERIVATIVE BY INVERSE PAL-TYPE INTERPOLATION POLYNOMIALS

Let ξn-1<ξn-2 <ξn-2 <… < ξ1 be the zeros of the the (n -1)-th Legendre polynomial Pn-1(x) and - 1 = xn < xn-1 <… < x1 = 1 the zeros of the polynomial W n(x) =- n(n - 1) Pn-1(t)dt = (1 -x2)P'n-1(x). By the theory of the inverse Pal-Type interpolation, for a function f(x) ∈ C[-1 1], there exists a unique polynomial Rn(x) of degree 2n - 2 (if n is even) satisfying conditions Rn(f,ξk) = f(∈ek)(1≤ k≤ n - 1) ;R'n(f,xk) = f'(xk)(1≤ k≤ n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {Rn(f,x)} (n is even) and the main result of this paper is that if f ∈ C'[1,1], r≥2, n≥ + 2> and n is even thenholds uniformly for all x ∈ [- 1,1], where h(x) = 1 +     

The 2-pebbling property for dense graphs

Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The pebbling number f(G) is the smallest number m such that for every distribution of m pebbles and every vertex v,a pebble can be moved to v. A graph G is said to have the 2-pebbling property if for any distribution with more than 2f(G) q pebbles, where q is the number of vertices with at least one pebble, it is possible,using pebbling moves, to get two pebbles to any vertex. Snevily conjectured that G(s,t) has the 2-pebbling property, where G(s, t) is a bipartite graph with partite sets of size s and t (s ≥ t). Similarly, the-pebbling number f (G) is the smallest number m such that for every distribution of m pebbles and every vertex v, pebbles can be moved to v. Herscovici et al. conjectured that f(G) ≤ 1.5n + 8-6 for the graph G with diameter 3, where n = |V (G)|. In this paper, we prove that if s ≥ 15 and G(s, t) has minimum degree at least (s+1)/ 2 , then f (G(s, t)) = s + t, G(s, t) has the 2-pebbling property and f (G(s, t)) ≤ s + t + 8(-1). In other words, we extend a result due to Czygrinow and Hurlbert, and show that the above Snevily conjecture and Herscovici et al. conjecture are true for G(s, t) with s ≥ 15 and minimum degree at least (s+1)/ 2 .     

Stability of Periodic Orbits and Return Trajectories of Continuous Multi-valued Maps on Intervals

Let I be a compact interval of real axis R, and(I, H) be the metric space of all nonempty closed subintervals of I with the Hausdorff metric H and f : I → I be a continuous multi-valued map. Assume that Pn =(x_0, x_1,..., xn) is a return tra jectory of f and that p ∈ [min Pn, max Pn] with p ∈ f(p). In this paper, we show that if there exist k(≥ 1) centripetal point pairs of f(relative to p)in {(x_i; x_i+1) : 0 ≤ i ≤ n-1} and n = sk + r(0 ≤ r ≤ k-1), then f has an R-periodic orbit, where R = s + 1 if s is even, and R = s if s is odd and r = 0, and R = s + 2 if s is odd and r 0. Besides,we also study stability of periodic orbits of continuous multi-valued maps from I to I.     

关于完全三部图色唯一性的一个注记

Let P(G,λ) be the chromatic polynomial of a simple graph G. A graph G is chromatically unique if for any simple graph H, P(H,λ) = P(G,λ) implies that H is isomorphic to G. Many sufficient conditions guaranteeing that some certain complete tripartite graphs are chromatically unique were obtained by many scholars. Especially, in 2003, Zou Hui-wen showed that if n 31m2 + 31k2 + 31mk+ 31m? 31k+ 32√m2 + k2 + mk, where n,k and m are non-negative integers, then the complete tripartite graph K(n - m,n,n + k) is chromatically unique (or simply χ-unique). In this paper, we prove that for any non-negative integers n,m and k, where m ≥ 2 and k ≥ 0, if n ≥ 31m2 + 31k2 + 31mk + 31m - 31k + 43, then the complete tripartite graph K(n - m,n,n + k) is χ-unique, which is an improvement on Zou Hui-wen's result in the case m ≥ 2 and k ≥ 0. Furthermore, we present a related conjecture.     

Restricted Fault Diameter of Hypercube Networks

This paper studies restricted fault diameter of the n-dimensional hypercube networks Qn (n ≥ 2).It is shown that for arbitrary two vertices x and y with the distance d in Qn and any set F with at most 2n-3 vertices in Qn - {x, y}, if F contains neither of neighbor-sets of x and y in Qn, then the distance between x andy in Qn - F is given by D(Qn-F;x,y){=1 , for=1;≤d 4 , for 2≤d≤n-2,n≥4;≤n 1, for d=n-1,n≥3; =n, for d=n. Furthermore, the upper bounds are tight. As an immediately consequence, Qn can tolerate up to 2n-3 vertices failures and remain diameter 4 if n = 3 and n 2 if n ≥ 4 provided that for each vertex x in Qn, all the neighbors of x do not fail at the same time. This improves Esfahanian‘s result.     

ON DISTRIBUTIONAL n-CHAOS

Let(X, f) be a topological dynamical system, where X is a nonempty compact and metrizable space with the metric d and f : X → X is a continuous map. For any integer n ≥ 2, denote the product space by X(n)= X ×× X n times. We say a system(X, f) is generally distributionally n-chaotic if there exists a residual set D ? X(n)such that for any point x =(x1,, xn) ∈ D,lim infk→∞#({i : 0 ≤ i ≤ k- 1, min{d(fi(xj), fi(xl)) : 1 ≤ j = l ≤ n} δ0})k= 0for some real number δ0 0 and lim sup k→∞#({i : 0 ≤ i ≤ k- 1, max{d(fi(xj), fi(xl)) : 1 ≤ j = l ≤ n} δ})k= 1for any real number δ 0, where #() means the cardinality of a set. In this paper, we show that for each integer n ≥ 2, there exists a system(X, σ) which satisfies the following conditions:(1)(X, σ) is transitive;(2)(X, σ) is generally distributionally n-chaotic, but has no distributionally(n + 1)-tuples;(3) the topological entropy of(X, σ) is zero and it has an IT-tuple.     

McCoy环的扩张(英文)

A ring R is said to be right McCoy if the equation f(x)g(x)=0,where f(x)and g(x)are nonzero polynomials of R[x],implies that there exists nonzero s∈R such that f(x)s=0.It is proven that no proper(triangular)matrix ring is one-sided McCoy.It is shown that for many polynomial extensions,a ring R is right McCoy if and only if the polynomial extension over R is right McCoy.     

An Erdös-Ko-Rado theorem for restricted signed sets

A restricted signed r-set is a pair （A, f）, where A lohtain in [n] = {1, 2,…, n} is an r-set and f is a map from A to [n] with f（i） ≠ i for all i ∈ A. For two restricted signed sets （A, f） and （B, g）, we define an order as （A, f） ≤ （B, g） if A C B and g｜A ： f A family .A of restricted signed sets on [n] is an intersecting antiehain if for any （A, f）, （B, g） ∈ A, they are incomparable and there exists x ∈ A ∩ B such that f（x） = g（x）. In this paper, we first give a LYM-type inequality for any intersecting antichain A of restricted signed sets, from which we then obtain ｜A｜≤ （r-1^n-1）（n-1）^r-1 if A. consists of restricted signed r-sets on [n]. Unless r = n = 3, equality holds if and only if A consists of all restricted signed r-sets （A, f） such that x0∈ A and f（x0） =ε0 for some fixed x0 ∈ [n], ε0 ∈ [n] ／ {x0}.     

A specific family of cyclotomic polynomials of order three

Let A(n) be the largest absolute value of any coefficient of n-th cyclotomic polynomial Φn(x).We say Φn(x) is flat if A(n) = 1.In this paper,for odd primes p q r and 2r ≡ 1(mod pq),we prove that Φpqr(x) is flat if and only if p = 3 and q ≡ 1(mod 3).     

A boundary Schwarz lemma for pluriharmonic mappings from the unit polydisk to the unit ball

In this article, we present a Schwarz lemma at the boundary for pluriharmonic mappings from the unit polydisk to the unit ball, which generalizes classical Schwarz lemma for bounded harmonic functions to higher dimensions. It is proved that if the pluriharmonic mapping f ∈ P(D~n, B~N) is C~(1+α) at z0 ∈ E_rD~n with f(0) = 0 and f(z_0) = ω_0∈B~N for any n,N ≥ 1, then there exist a nonnegative vector λ_f =(λ_1,0,…,λ_r,0,…,0)~T∈R~(2 n)satisfying λ_i≥1/(2~(2 n-1)) for 1 ≤ i ≤ r such that where z'_0 and w'_0 are real versions of z_0 and w_0, respectively.     

ON THE LORENTZ CONJECTURES UNDER THE L_1-NORM

Let f (x) ∈ C [-1, 1], p_n~* (x) be the best approximation polynomial of degree n tof (x). G. Iorentz conjectured that if for all n, p_(2n)~* (x) = p_(2n+1)~* (x), then f is even; and ifp_(2n+1)~* (x) = p_(2n+2)~* (x), p_o~* (z) = 0, then f is odd. In this paper, it is proved that, under the L_1-norm, the Lorentz conjecture is validconditionally, i. e. if (i) (1-x~2) f (x) can be extended to an absolutely convergentTehebyshev sories; (ii) for every n, f (x) - p_(2n+1)~* (x) has exactly 2n + 2 zeros (or, in thearcond situation, f (x) - p_(2n+2)~* (x) has exaetly 2n+3 zeros), then Lorentz conjecture isvalid.     

ON GENERALIZED FEYNMAN-KAC TRANSFORMATION FOR MARKOV PROCESSES ASSOCIATED WITH SEMI-DIRICHLET FORMS

Suppose that X is a right process which is associated with a semi-Dirichlet form(ε,D(ε)) on L~2(E;m).Let J be the jumping measure of(ε,D(ε)) satisfying J(E×E-d) ∞.Let u ∈ D(ε)_b:= D(ε)∩ L~∞(E;m),we have the following Fukushima's decomposition u(X_t)-u(X_0) =M_t~u+N_t~u.Define P_t~uf(x)=E_x[e~(N_t~u)f(X_t)].Let Q~u(f,g) =ε(f,g)+ε(u,fg)for f,g∈ D(ε)_b.In the first part,under some assumptions we show that(Q~u,D(ε)_b) is lower semi-bounded if and only if there exists a constant α_0≥0 such that ‖P_t~u‖2≤e~(α_0~t) for every t0.If one of these assertions holds,then(P_t~u)t≥0 is strongly continuous on L~2(E;m).If X is equipped with a differential structure,then under some other assumptions,these conclusions remain valid without assuming J(E×E-d)∞.Some examples are also given in this part.Let A_t be a local continuous additive functional with zero quadratic variation.In the second part,we get the representation of A_t and give two sufficient conditions for P_t~A f(x) = E_x[e~(A_t) f(X_t)]to be strongly continuous.     

Bounded Fatou components of transcendental entire functions with order less than 1/2

Let f be a transcendental entire function with order ρ 12and let σ be a sufficiently large constant. We prove that if there exists r0 1 such that, for all r r0 and any small ε 0,M(rσ, f) ≥ M(r, f)σ+ε,then every component of the Fatou set F(f) is bounded.     

Ramsey Number With Largen

This is an announcement that r(C2m+1, Kn) ≤ c(m) has been proved. The Rarnsey number r(H, Kn) is the smallest integer N such that every H-free graph on N vertices has independence number at least n. The study of Ramsey number r(Ck, Kn) was initiated by Bondy and Erdos[2]. They proved that for any fixed n, r(Ck, Kn) = (k - 1)(n - 1) + 1if k≥n2-1, and r(Ck, Kn)≤kn2. For fixed k≥3, it is difficult to obtain a satisfied bound of r(Ck,Kn) for n →∞. The bound of Bondy and Erdos was improved as r(Ck, Kn)≤c(k)n1+1/m,where m = [(k - 1)/2] by Erdos, Faudree, Rousseau and Schelp[4]. For even cycle, a more refined     

A class of antimagic join graphs

A labeling f of a graph G is a bijection from its edge set E(G) to the set {1, 2, . . . , |E(G)|}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has an f which is antimagic. Hartsfield and Ringel conjectured in 1990 that every connected graph other than K 2 is antimagic. In this paper, we show that if G 1 is an n-vertex graph with minimum degree at least r, and G 2 is an m-vertex graph with maximum degree at most 2r-1 (m ≥ n), then G1 ∨ G2 is antimagic.     

A Combinatorial Theorem on Ordered Circular Sequences of n_1 u''''s and n_2 v''''s with Application to Kernel-perfect Graphs

Abstract An ordered circular permutation S of u's and v's is called an ordered circular sequence of u's andv's.A kernel of a digraph G=(V,A)is an independent subset of V,say K,such that for any vertex v_i in V\Kthere is an arc from v_i to a vertex v_j in K.G is said to be kernel-perfect(KP)if every induced subgraph of Ghas a kernel. G is said to be kernel-perfect-critical(KPC)if G has no kernel but every proper induced subgraphof G has a kernel.The digraph G=(V,A)=(j_1,j_2,…,j_k)is defined by:V(G)={0,1,…,n-1},A(G)={uv│v-u≡j_i(mod n) for 1≤i≤k}. In an eariler work, we investigated the digraph G=(1,±δd,±2d,±3d,…±sd),denoted by G(n,d,r,s),whereδ=1 for d>1 or δ=0 for d=1,and n,d,r,s are positive integers with(n,d)=r and n=mr ,and gave some necessaryand sufficient conditions for G(n,d,r,s)with r≥3 and s=1 to be KP or KPC. In this paper,we prove a combinatorial theorem on ordered circular sequences of n_1 u's and n_2 v's.By usingthe theorem,we prove that,if(n,d)=r≥2 and s≥2,then G(n,d,r,s,)is     

3,4跳图的平面性

For a graph G of size ε≥1 and its edge-induced subgraphs H1 and H2 of size r(1≤r≤ε), H1 is said to be obtained from H2 by an edge jump if there exist four distinct vertices u,v,w and x in G such that (u,v)∈E(H2), (w,x)∈ E(G)-E(H2) and H1=H2-(u,v)+(w,x). In this article, the r-jump graphs (r≥3) are discussed. A graph H is said to be an r-jump graph of G if its vertices correspond to the edge induced graph of size r in G and two vertices are adjacent if and only if one of the two corresponding subgraphs can be obtained from the other by an edge jump. For k≥2, the k-th iterated r-jump graph Jrk(G) is defined as Jr(Jrk-1(G)), where Jr1(G)=Jr(G).An infinite sequence{Gi} of graphs is planar if every graph Gi is planar. It is shown that there does not exist a graph G for which the sequence {J3k(G)} is planar, where k is any positive integer. Meanwhile,lim gen(J3k(G))=∞,where gen(G) denotes the genus of a graph G, if the sequencek→∞J3k(G) is defined for every positive integer k. As for the 4-jump gra     

On approximation of smooth functions from null spaces of optimal linear differential operators with constant coefficients

For a real valued function f defined on a finite interval I we consider the problem of approximating f from null spaces of differential operators of the form Ln(ψ) = n ∑ k=0 akψ(k), where the constant coefficients ak ∈ R may be adapted to f . We prove that for each f ∈ C(n)(I), there is a selection of coefficients {a1, ,an} and a corresponding linear combination Sn( f ,t) = n ∑ k=1 bkeλkt of functions ψk(t) = eλkt in the nullity of L which satisfies the following Jackson’s type inequality: f (m) Sn(m )( f ,t) ∞≤ |an|2n|Im|1/1q/ep|λ|λn|n|I||nm1 Ln( f ) p, where |λn| = mka x|λk|, 0 ≤ m ≤ n 1, p,q ≥ 1, and 1p + q1 = 1. For the particular operator Mn(f) = f + 1/(2n) f(2n) the rate of approximation by the eigenvalues of Mn for non-periodic analytic functions on intervals of restricted length is established to be exponential. Applications in algorithms and numerical examples are discussed.     

On the rates of the other law of the logarithm

Let X, X1 , X2 , . . . be i.i.d. random variables, and set Sn = X1 +···+Xn , Mn = maxk≤n |Sk|, n ≥1. Let an = o( (n)(1/2)/logn). By using the strong approximation, we prove that, if EX = 0, VarX = σ2 0 and E|X| 2+ε ∞ for some ε 0, then for any r 1, lim ε1/(r-1)(1/2) [ε-2-(r-1)]∞∑n=1 nr-2 P{Mn ≤εσ (π2n/(8log n))(1/2) + an } = 4/π . We also show that the widest a n is o( n(1/2)/logn).     

ON THE NEVANLINNA DIRECTION OF ALGEBROID FUNCTIONS

In this paper, we prove that for an algebroid function w(z), the singular direction arg z =φ0 , satisfying that for arbitrary ε(0 < ε < π 2 ) and any given a ∈ C, lim r → + ∞ n(r,φ0-ε,φ0 +ε,w=a)/ log r = +∞ holds with at most 2v possible exceptional values of a, is the Nevanlinna direction of w(z).