Some results on graphs without long induced paths

Let I(t) be the set of integers with the property that in every P_t-free connected graph G, the i-center C,(G) induces a connected subgraph. What is the minimum element of I(t)? In this paper, we prove that this minimum is [2t/3] − 1 if t ≡ 0 or 2(mod3) and is [2t/3] otherwise. Furthermore, as conjectured by G. Bacsó and Z. Tuza, the set I(t) is an interval. In addition, a counterexample to a conjecture proposed by G. Bacsó and Z. Tuza is also presented. © 1996 John Wiley & Sons, Inc.     

Limit theorems for the critical age-dependent branching process with infinite variance

Let Z(t) be the population at time t of a critical age-dependent branching process. Suppose that the offspring distribution has a generating function of the form f(s) = s + (1 ? s)^1+αL(1 ? s) where α ∈ (0, 1) and L(x) varies slowly as x → 0⁺. Then we find, as t → ∞, (P{Z(t)> 0})^αL(P{Z(t)>0})～ μ/αt where μ is the mean lifetime of each particle. Furthermore, if we condition the process on non-extinction at time t, the random variable P{Z(t)>0}Z(t) converges in law to a random variable with Laplace-Stieltjes transform 1 - u(1 + u^α)^?1/α for u ?/ 0. Moment conditions on the lifetime distribution required for the above results are discussed.     

Power Values of Derivations with Annihilator Conditions on Lie Ideals in Prime Rings

Let R be a prime ring of char R ≠ 2, d a nonzero derivation of R, U a noncentral Lie ideal of R, and a ∈ R. If au ^{n ₁} d(u) ^{n ₂} u ^{n ₃} d(u) ^{n ₄} u ^{n ₅} … d(u) ^{n _k?1} u ^{n _k}  = 0 for all u ∈ U, where n ₁, n ₂,…,n _k are fixed non-negative integers not all zero, then a = 0 and if a(u ^s d(u)u ^t ) ⁿ  ∈ Z(R) for all u ∈ U, where s ≥ 0, t ≥ 0, n ≥ 1 are some fixed integers, then either a = 0 or R satisfies S ₄, the standard identity in four variables.     

Asymptotic properties of matrix differential operators

For given matrices A(s) and B(s) whose entries are polynomials in s, the validity of the following implication is investigated: ?_ylim_{t → ∞}A(D) y(t) = 0 ? lim_{t → ∞}B(D) y(t) = 0. Here D denotes the differentiation operator and y stands for a sufficiently smooth vector valued function. Necessary and sufficient conditions on A(s) and B(s) for this implication to be true are given. A similar result is obtained in connection with an implication of the form ?_yA(D) y(t) = 0, lim_{t → ∞}B(D) y(t) = 0, C(D) y(t) is bounded ? lim_{t → ∞}E(D) y(t) = 0.     

A new comparison theorem for solutions of stochastic differential equations

Let Z ₁(t) and Z ₂(t) be solutions of two stochastic differential equations. Then Z ₁(t)≦Z ₂(t) for all t?0 a.s. provided certain relations involving the coefficients and intial conditions of the equations hold. the diffusion coefficients are not required toi be the same for both equtions     

On Osgood theorem in Banach spaces

Let X be a real Banach space, ω : [0, +∞) → ? be an increasing continuous function such that ω(0) = 0 and ω(t + s) ≤ ω(t) + ω(s) for all t, s ∈ [0, +∞). According to the infinite dimensional analog of the Osgood theorem if ∫¹₀ (ω(t))^?1 dt = ∞, then for any (t₀, x₀) ∈ ?×X and any continuous map f : ?×X → X such that ∥f(t, x) – f(t, y)∥ ≤ ω(∥x – y∥) for all t ∈ ?, x, y ∈ X, the Cauchy problem (t) = f(t, x(t)), x(t₀) = x₀ has a unique solution in a neighborhood of t₀. We prove that if X has a complemented subspace with an unconditional Schauder basis and ∫¹₀ (ω(t))^?1 dt < ∞ then there exists a continuous map f : ? × X → X such that ∥f(t, x) – f(t, y)∥ ≤ ω(∥x – y∥) for all (t, x, y) ∈ ? × X × X and the Cauchy problem (t) = f(t, x(t)), x(t₀) = x₀ has no solutions in any interval of the real line.     

Positive existential definability of multiplication from addition and the range of a polynomial

We consider the problem of recovering multiplication in the integers from enrichments of its additive structure, in the positive existential context. We prove that if a conjecture by Caporaso–Harris–Mazur holds, then for all integer-valued polynomials F of degree at least 2, multiplication is positive-existentially definable in (Z; 0, 1,+, R_F, =) where R_F is the unary relation F(Z). Similar results were only known for the polynomials F(t) = t² (under the Bombieri–Lang conjecture) and F(t) = tⁿ (under a generalization of the abc conjecture).     

On the number of (r,r+1)‐ factors in an (r,r+1)‐factorization of a simple graph

For integers d≥0, s≥0, a (d, d+s)‐graph is a graph in which the degrees of all the vertices lie in the set {d, d+1, …, d+s}. For an integer r≥0, an (r, r+1)‐factor of a graph G is a spanning (r, r+1)‐subgraph of G. An (r, r+1)‐factorization of a graph G is the expression of G as the edge‐disjoint union of (r, r+1)‐factors. For integers r, s≥0, t≥1, let f(r, s, t) be the smallest integer such that, for each integer d≥f(r, s, t), each simple (d, d+s) ‐graph has an (r, r+1) ‐factorization with x (r, r+1) ‐factors for at least t different values of x. In this note we evaluate f(r, s, t). © 2009 Wiley Periodicals, Inc. J Graph Theory 60: 257‐268, 2009     

Zolotarevω-Polynomials inWH[0, 1]

The main result of this paper characterizes generalizationsof Zolotarev polynomials as extremal functions in the Kolmogorov–Landauproblemwhereω(t) is a concave modulus of continuity,r, m: 1?m?r,are integers, andB?B₀(r, m, ω). We show that theextremal functionsZ_Bhaver+1 points of alternance andthe full modulus of continuity ofZ^(r)_B: ω(Z^(r)_B; t)=ω(t) for allt∈[0, 1]. This generalizesthe Karlin's result on the extremality of classical Zolotarevpolynomials in the problem () forω(t)=tand allB?B_r.     

Spin depolarization decay rates in α-symmetric stable fields on cubic lattices

We study the asymptotic, long-time behavior of the energy function where {X_s : 0 ≤ s < ∞} is the standard random walk on the d-dimensional lattice Z^d, 1 < α ≤ 2, and f:R⁺ → R⁺ is any nondecreasing concave function. In the special case f(x) = x, our setting represents a lattice model for the study of transverse magnetization of spins diffusing in a homogeneous, α-stable, i.i.d., random, longitudinal field {λV(x) : x ∈ Z^d} with common marginal distribution, the standard α-symmetric stable distribution; the parameter λ describes the intensity of the field. Using large-deviation techniques, we show that S_c(λ α f) = lim_t→∞ E(t; λ f) exists. Moreover, we obtain a variational formula for this decay rate S_c. Finally, we analyze the behavior S_c(λ α f) as λ → 0 when f(x) = x^β for all 1 ≥ β > 0. Consequently, several physical conjectures with respect to lattice models of transverse magnetization are resolved by setting β = 1 in our results. We show that S_c(λ, α, 1) ≈ λ^α for d ≥ 3, λ^agr;(ln 1/λ)^α−1 in d = 2, and in d = 1. © 1996 John Wiley & Sons, Inc.     

Annealed deviations of random walk in random scenery

Let (Zn)_n∈N be a d-dimensional random walk in random scenery, i.e., with (Sk)_k∈N0 a random walk in Zd and (Y(z))_z∈Zd an i.i.d. scenery, independent of the walk. The walker's steps have mean zero and some finite exponential moments. We identify the speed and the rate of the logarithmic decay of for various choices of sequences n(bn) in [1,∞). Depending on n(bn) and the upper tails of the scenery, we identify different regimes for the speed of decay and different variational formulas for the rate functions. In contrast to recent work [A. Asselah, F. Castell, Large deviations for Brownian motion in a random scenery, Probab. Theory Related Fields 126 (2003) 497-527] by A. Asselah and F. Castell, we consider sceneries unbounded to infinity. It turns out that there are interesting connections to large deviation properties of self-intersections of the walk, which have been studied recently by X. Chen [X. Chen, Exponential asymptotics and law of the iterated logarithm for intersection local times of random walks, Ann. Probab. 32 (4) 2004].     

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.      

Oscillation in Linear Differential Equations with Continuous Distribution of Time Lag

The purpose of this paper is to study oscillation of solutions of the following equation where D_k ? B (C[-r, 0], R ), k = 0, 1,…,n, r > 0, const, x_t(s) = x(t + s). Under very generic conditions, we show that the oscillatory property of (1) can be determined from the behavior of the characteristic.     

Diophantine problems in variables restricted to the values 0 and 1

Let $\text{F}$x₁,…,x_s be a form of degree d with integer coefficients. How large must s be to ensure that the congruence $\text{F}$(x₁,…,x_s) ≡ 0 (mod m) has a nontrivial solution in integers 0 or 1? More generally, if $\text{F}$ has coefficients in a finite additive group G, how large must s be in order that the equation $\text{F}$(x₁,…,x_s) = 0 has a solution of this type? We deal with these questions as well as related problems in the group of integers modulo 1 and in the group of reals.     

Distance graphs with missing multiples in the distance sets

Given positive integers m, k, and s with m > ks, let D_m,k,s represent the set {1, 2, …, m} − {k, 2k, …, sk}. The distance graph G(Z, D_m,k,s) has as vertex set all integers Z and edges connecting i and j whenever |i − j| ∈ D_m,k,s. The chromatic number and the fractional chromatic number of G(Z, D_m,k,s) are denoted by χ(Z, D_m,k,s) and χf(Z, D_m,k,s), respectively. For s = 1, χ(Z, D_m,k,1) was studied by Eggleton, Erdős, and Skilton [6], Kemnitz and Kolberg [12], and Liu [13], and was solved lately by Chang, Liu, and Zhu [2] who also determined χf(Z, D_m,k,1) for any m and k. This article extends the study of χ(Z, D_m,k,s) and χf(Z, D_m,k,s) to general values of s. We prove χf(Z, D_m,k,s) = χ(Z, D_m,k,s) = k if m < (s + 1)k; and χf(Z, D_m,k,s) = (m + sk + 1)/(s + 1) otherwise. The latter result provides a good lower bound for χ(Z, D_m,k,s). A general upper bound for χ(Z, D_m,k,s) is obtained. We prove the upper bound can be improved to ⌈(m + sk + 1)/(s + 1)⌉ + 1 for some values of m, k, and s. In particular, when s + 1 is prime, χ(Z, D_m,k,s) is either ⌈(m + sk + 1)/(s + 1)⌉ or ⌈(m + sk + 1)/(s + 1)⌉ + 1. By using a special coloring method called the precoloring method, many distance graphs G(Z, D_m,k,s) are classified into these two possible values of χ(Z, D_m,k,s). Moreover, complete solutions of χ(Z, D_m,k,s) for several families are determined including the case s = 1 (solved in [2]), the case s = 2, the case (k, s + 1) = 1, and the case that k is a power of a prime. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 245–259, 1999     

Entropy and<Emphasis Type="Italic">σ</Emphasis>-algebra equivalence of certain random walks on random sceneries

LetX=X ₀,X ₁,…be a stationary sequence of random variables defining a sequence space Σ with shift mapσ and let (T _t, Ω) be an ergodic flow. Then the endomorphismT _X(x, ω)=(σ(x),T _{x 0}(ω)) is known as a random walk on a random scenery. In [4], Heicklen, Hoffman and Rudolph proved that within the class of random walks on random sceneries whereX is an i.i.d. sequence of Bernoulli-(1/2, 1/2) random variables, the entropy ofT _t is an isomorphism invariant. This paper extends this result to a more general class of random walks, which proves the existence of an uncountable family of smooth maps on a single manifold, no two of which are measurably isomorphic. This research was sustained in part by fellowship support from the National Physical Science Consortium and the National Security Agency.     

Spectral mapping theorems for exponentially bounded c-semigroups in Banach spaces

LetZ be a generator of an exponentially boundedC-semigroup {S _t } _t≥0 in a Banach space and letT _t =C ⁻¹ S _t . We show that the spectral mapping theorems such as exp(tσ(Z)) ⊂ σ(T _t ) and exp(tσ _p (Z)) ⊂ tσ _p (T _t ) ⊂ exp(tσ _p (Z)) ⋃ {0} for everyt≥0 hold. The present studies were supported by the Basic Science Research Institute Program, Ministry of Education, 1987.     

Zolotarevω-Polynomials inWH[0, 1]

The main result of this paper characterizes generalizationsof Zolotarev polynomials as extremal functions in the Kolmogorov–Landauproblem

Full-size image

whereω(t) is a concave modulus of continuity,r, m: 1mr,are integers, andBB₀(r, m, ω). We show that theextremal functionsZ_Bhaver+1 points of alternance andthe full modulus of continuity ofZ^(r)_B: ω(Z^(r)_B; t)=ω(t) for allt[0, 1]. This generalizesthe Karlin's result on the extremality of classical Zolotarevpolynomials in the problem () forω(t)=tand allBB_r.     

More on Poincaré’s and Perron’s Theorems for Difference Equations∗

Consider the scalar kth order linear difference equation: x(n + k) + pi(n)x(n + k - 1) + … + pk(n)x(n) = 0 where the limits qi=lim_n→∞Pi(n) (i=1,…,k) are finite. In this paper, we confirm the conjecture formulated recently by Elaydi. Namely, every nonzero solution x of (?) satisfies the same asymptotic relation as the fundamental solutions described earlier by Perron, ie., ?= lim sup_n→∞ |x(n)| is equal to the modulus of one of the roots of the characteristics equation χ ^k + q ₁χ ^k?1+…+qk=0. This result is a consequence of a more general theorem concerning the Poincaré difference system x(n+1)=[A+B(n]x(n), where A and B(n) (n=0,1,…) are square matrices such that ‖B(n)‖ →0 as n → ∞. As another corollary, we obtain a new limit relation for the solutions of (?).     

On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers

Extending the problem of determining Ramsey numbers Erdős and Rogers introduced the following function. For given integers 2 ≤ s < t let f _s,t (n) = min{max{|S|: S ⊆ V (H) and H[S] contains no K _s }}, where the minimum is taken over all K _t -free graphs H of order n. This function attracted a considerable amount of attention but despite that, the gap between the lower and upper bounds is still fairly wide. For example, when t=s+1, the best bounds have been of the form Ω(n ^1/2+o(1)) ≤ f _s,s+1(n) ≤ O(n ^1−ɛ(s)), where ɛ(s) tends to zero as s tends to infinity. In this paper we improve the upper bound by showing that f _s,s+1(n) ≤ O(n ^2/3). Moreover, we show that for every ɛ > 0 and sufficiently large integers 1 ≪ k ≪ s, Ω(n ^1/2−ɛ ) ≤ f _s,s+k (n) ≤ O(n ^1/2+ɛ . In addition, we also discuss some connections between the function f _s,t and vertex Folkman numbers.