Oscillatory solutions of nonhomogeneous linear differential equations

The complex oscillation of nonhomogeneous linear differential equations with transcendental coefficients is discussed. Results concerning the equation f ^(k)+a _k−1 f ^(k−1)+...+a ₀ f=F where a ₀,...,a _k−i and Fare entire functions, possessing an oscillatory solution subspace in which all solutions (with at most one exception) have infinite exponent of convergence of zeros are obtained. All solutions of the equation are also characterized when the coefficients a ₀,a ₁,...,a _k−1 are polynomials and F=h exp (p ₀), where p ₀ is a polynomial and h is an entire function. Author supported by Max-Planck-Gesellschaft and by NSFC.     

Approximation ofk-Monotone Functions

It is shown that an algebraic polynomial of degree k−1 which interpolates ak-monotone functionfatkpoints, sufficiently approximates it, even if the points of interpolation are close to each other. It is well known that this result is not true in general for non-k-monotone functions. As an application, we prove a (positive) result on simultaneous approximation of ak-monotone function and its derivatives inL_p, 0<p<1, metric, and also show that the rate of the best algebraic approximation ofk-monotone functions (with bounded (k−2)nd derivatives inL_p, 1<p<∞, iso(n^−k/p).     

Heilbronn's conjecture on Waring's number (mod p)

Let p be a prime k|p−1, t=(p−1)/k and γ(k,p) be the minimal value of s such that every number is a sum of s kth powers . We prove Heilbronn's conjecture that γ(k,p)?k1/2 for t>2. More generally we show that for any positive integer q, γ(k,p)?C(q)k1/q for ?(t)?q. A comparable lower bound is also given. We also establish exact values for γ(k,p) when ?(t)=2. For instance, when t=3, γ(k,p)=a+b−1 where a>b>0 are the unique integers with a²+b²+ab=p, and when t=4, γ(k,p)=a−1 where a>b>0 are the unique integers with a²+b²=p.     

An optimal version of an inequality involving the third symmetric means

Let (GA) _n ^[k](a), A _n (a), G _n (a) be the third symmetric mean of k degree, the arithmetic and geometric means of a ₁, …, a _n (a _i > 0, i = 1, …, n), respectively. By means of descending dimension method, we prove that the maximum of p is k−1/n−1 and the minimum of q is n/n−1(k−1/k) ^k/n so that the inequalities {fx505-1} hold.     

A bound for Wilson's theorem (II)

In this article we prove the following theorem. For any k ≥ 3, let c(k, 1) = exp{exp{k^k2}}. If v(v − 1) ≡ 0 (mod k(k −1)) and v − 1 ≡ 0 (mod k−1) and v > c(k, 1), then a B(v,k, 1) exists. © 1996 John Wiley & Sons, Inc.     

The existence of NRB[v,k] where k + 1 is an even prime power

The existence of NRB[v,k] where k ≥ 7 and k + 1 is an even prime power is considered. We will show that there exists an NRB[kn + 1, k] for all n > (3k)^b-1(kb)^3kb(b-1)+1, where k + 1 is an even prime power, k ≥ 7 and . The tools used to construct this bound include the frames extracted from a construction of J. X. Lu's for resolvable balanced incomplete block designs © 1998 John Wiley & Sons, Inc. J Combin Designs 6:43–49, 1998     

Density of Gabor Frames

A Gabor system is a set of time-frequency shifts S(g, Λ) ={e^{2 π ibx}g(x − a)}_{(a, b) Λ} of a function g L²(R^d). We prove that if a finite union of Gabor systems _{k = 1}^rS(g_k, Λ_k) forms a frame for L²(R^d) then the lower and upper Beurling densities of Λ = _{k = 1}^r Λ_k satisfy D⁻(Λ) ≥ 1 and D ⁺ (Λ) < ∞. This extends recent work of Ramanathan and Steger. Additionally, we prove the conjecture that no collection _{k = 1}^r{g_k(x − a)}_{a Γk} of pure translates can form a frame for L²(R^d).     

On the evaluation of the Eigenvalues of a banded toeplitz block matrix

Let A = (a_ij) be an n × n Toeplitz matrix with bandwidth k + 1, K = r + s, that is, a_ij = a_j−i, i, J = 1,… ,n, a_i = 0 if i > s and if i < -r. We compute p(λ)= det(A - λI), as well as p(λ)/p′(λ), where p′(λ) is the first derivative of p(λ), by using O(k log k log n) arithmetic operations. Moreover, if a_i are m × m matrices, so that A is a banded Toeplitz block matrix, then we compute p(λ), as well as p(λ)/p′(λ), by using O(m³k(log² k + log n) + m²k log k log n) arithmetic operations. The algorithms can be extended to the computation of det(A − λB) and of its first derivative, where both A and B are banded Toeplitz matrices. The algorithms may be used as a basis for iterative solution of the eigenvalue problem for the matrix A and of the generalized eigenvalue problem for A and B.     

Uniqueness of solutions of boundary-value problems for operator-differential equations on a finite segment and on a semiaxis

For the equationL ₀ x(t)+L ₁x(t)+...+L _n x ⁽ⁿ⁾(t)=O, whereL _k,k=0,1,...,n, are operators acting in a Banach space, we establish criteria for an arbitrary solutionx(t) to be zero provided that the following conditions are satisfied:x ^(1–1) (a)=0, 1=1, ..., p, andx ^(1–1) (b)=0, 1=1,...,q, for - <a< b< (the case of a finite segment) orx ^(1–1) (a)=0, 1=1,...,p, under the assumption that a solutionx(t) is summable on the semiaxista with its firstn derivatives.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 279–292, March, 1994.This research was supported by the Ukrainian State Committee on Science and Technology.     

Higher order Riesz transforms associated with Bessel operators

In this paper we investigate Riesz transforms R _μ ^(k) of order k≥1 related to the Bessel operator Δ_μ f(x)=-f”(x)-((2μ+1)/x)f’(x) and extend the results of Muckenhoupt and Stein for the conjugate Hankel transform (a Riesz transform of order one). We obtain that for every k≥1, R _μ ^(k) is a principal value operator of strong type (p,p), p∈(1,∞), and weak type (1,1) with respect to the measure dλ(x)=x ^2μ+1  dx in (0,∞). We also characterize the class of weights ω on (0,∞) for which R _μ ^(k) maps L ^p (ω) into itself and L ¹(ω) into L ^1,∞(ω) boundedly. This class of weights is wider than the Muckenhoupt class of weights for the doubling measure dλ. These weighted results extend the ones obtained by Andersen and Kerman.     

Pancyclic arcs and connectivity in tournaments

A tournament is an orientation of the edges of a complete graph. An arc is pancyclic in a tournament T if it is contained in a cycle of length l, for every 3 ≤ l ≤ |T|. Let p(T) denote the number of pancyclic arcs in a tournament T. In 4 , Moon showed that for every non‐trivial strong tournament T, p(T) ≥ 3. Actually, he proved a somewhat stronger result: for any non‐trivial strong tournament h(T) ≥ 3 where h(T) is the maximum number of pancyclic arcs contained in the same hamiltonian cycle of T. Moreover, Moon characterized the tournaments with h(T) = 3. All these tournaments are not 2‐strong. In this paper, we investigate relationship between the functions p(T) and h(T) and the connectivity of the tournament T. Let p_k(n) := min {p(T), T k‐strong tournament of order n} and h_k(n) := min{h(T), T k‐strong tournament of order n}. We conjecture that (for k ≥ 2) there exists a constant α_k> 0 such that p_k(n) ≥ α_kn and h_k(n) ≥ 2k+1. In this paper, we establish the later conjecture when k = 2. We then characterized the tournaments with h(T) = 4 and those with p(T) = 4. We also prove that for k ≥ 2, p_k(n) ≥ 2k+3. At last, we characterize the tournaments having exactly five pancyclic arcs. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 87–110, 2004     

Pinching estimates for negatively curved manifolds with nilpotent fundamental groups

Let M be a complete Riemannian metric of sectional curvature within [−a²,−1] whose fundamental group contains a k-step nilpotent subgroup of finite index. We prove that a ≥ k answering a question of M. Gromov. Furthermore, we show that for any the manifold M admits a complete Riemannian metric of sectional curvature within Received: May 2004 Revision: July 2004 Accepted: July 2004     

On value distribution of f (k)-af n

The aim of this paper is to discuss the value distribution of the function f ^(k) − af ⁿ. Under the assumption that f(z) is a transcendental meromorphic function in the complex plane and a is a non-zero constant, it is proved that if n ⩽ k + 3, then f ^(k) − af ⁿ has infinitely many zeros. The main result is obtained by using the Nevanlinna theory and the Clunie lemma of complex functions. __________ Translated from Acta Scientiarum Naturalium Universitatis NeiMongol, 2004, 35(1): 5–9     

A numerical algorithm for nonlinear parabolic equations with highly oscillating coefficients

A numerical algorithm is constructed for the solution to a class of nonlinear parabolic operators in the case of homogenization. We consider parabolic operators of the form d/dt + A_ϵ, where A_ϵ is monotone. More precisely, we consider the case when A_ϵu=−div (a(x/ϵ, e/ϵ^k) |Du|^p−2Du), where p≥2 and k>0. © 1996 John Wiley & Sons, Inc.     

THE EDGE-CHROHATIC NUMBER OF A CIRCULANT

ABSTRACT

The circulant graph C_p > a₁,…, a_k < with 0 > a₁ >…> a_k >(pt1)/2 has p vertices labeled 0,1,…,p-1 and x and y are adjacent if and only if x—y = ± a_i (mod p) for some i. We prove the following regarding the chromatic index of a circulant: if d = gcd (a₁,…, a_k, p), then x' (C_p > a_l,…,a_k) = Δ(C p > a₁,…,a_k) if and only if p/d is even.     

A constructive approach for the lower bounds on the Ramsey numbers R (s,t)

Graph G is a (k, p)‐graph if G does not contain a complete graph on k vertices K_k, nor an independent set of order p. Given a (k, p)‐graph G and a (k, q)‐graph H, such that G and H contain an induced subgraph isomorphic to some K_k?1‐free graph M, we construct a (k, p + q ? 1)‐graph on n(G) + n(H) + n(M) vertices. This implies that R (k, p + q ? 1) ≥ R (k, p) + R (k, q) + n(M) ? 1, where R (s, t) is the classical two‐color Ramsey number. By applying this construction, and some its generalizations, we improve on 22 lower bounds for R (s, t), for various specific values of s and t. In particular, we obtain the following new lower bounds: R (4, 15) ≥ 153, R (6, 7) ≥ 111, R (6, 11) ≥ 253, R (7, 12) ≥ 416, and R (8, 13) ≥ 635. Most of the results did not require any use of computer algorithms. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 231–239, 2004     

Asymptotic normality in a coupon collector's problem

Summary Let {a _s , s=1, 2, ..., N} be a set of reals and {p _s , s=1, 2, ..., N} be a set of probabilities, i.e. p _s0 and p ₁+p ₂+...+p _N =1. Let I ₁ I ₂,... be independent random variables, all with the distribution P(I=s)=p _s , s=1, 2, ..., N. Put U _v =l if I _v {I ₁, I ₂, ..., I _v –1} and U _v =0 otherwise, v=1, 2, .... The random variable Z _n = is called the bonus sum after ncoupons for a coupon collector in the situation {(p _s , a _s ), s=1, 2, ..., N}.Consider a sequence {(p _ks , a _ks ), s=l, 2, ..., N _k }, k=1, 2, ..., of collector situations, and let {Z _n ^(k) , n=1, 2, ...}, k=1, 2, ..., be the corresponding sequence of bonus sum variables. Let d be an arbitrary natural number and let , k=1, 2, ..., where 1 n _k ⁽¹⁾<n _k ⁽²⁾<< n _k ^(d) .We assume that N ^(k) t8 and that .It is shown that the random vector V ^(k) is, under general conditions, asymptotically (as kt8) normally distributed. An asymptotic expression for the covariance matrix of V ^(k) is derived.Research supported in part at Stanford University, Stanford, California under contract N0014-67-A-0112-0015.     

ON Sums of Products of Polynomials

Abstract

Given a polynomial P(t₁ ,…, t _n) = σ a_a t_a ^a1 …t_n ^an in several variables, we consider the p-norms |P|_p = (σ |a_a | ^p )^1/p (1≥ p < ∞) and |p|_∞ = max |a_a |. Our goal is to establish a generalization to the p-norms (1 ≥ p ≥ ∞) of a theorem originally obtained by P. Enflo for the l-norm.     

Coloring uniform hypergraphs with few colors

Let m(r, k) denote the minimum number of edges in an r‐uniform hypergraph that is not k‐colorable. We give a new lower bound on m(r, k) for fixed k and large r. Namely, we prove that if k ≥ 2ⁿ, then m(r, k) ≥ ?(k)k^r(r/ln r)^n/(n+1). © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Asymptotic Upper Bounds for Ramsey Functions

 We show that for any graph G with N vertices and average degree d, if the average degree of any neighborhood induced subgraph is at most a, then the independence number of G is at least Nf _{a +1}(d), where f _{a +1}(d)=∫₀ ¹(((1−t)^{1/( a +1)})/(a+1+(d−a−1)t))dt. Based on this result, we prove that for any fixed k and l, there holds r(K _k + _l ,K _n )≤ (l+o(1))n ^k /(logn) ^{k −1}. In particular, r(K _k , K _n )≤(1+o(1))n ^{k −1}/(log n) ^{k −2}. Received: May 11, 1998 Final version received: March 24, 1999