Movement of Intransitive Permutation Groups Having Maximum Degree

Let G be a permutation group on a set Ω with no fixed points in,and m be a positive integer.Then the movement of G is defined as move(G):=sup Γ {|Γg\Γ| | g ∈ G}.It was shown by Praeger that if move(G) = m,then |Ω| 3m + t-1,where t is the number of G-orbits on.In this paper,all intransitive permutation groups with degree 3m+t-1 which have maximum bound are classified.Indeed,a positive answer to her question that whether the upper bound |Ω| = 3m + t-1 for |Ω| is sharp for every t > 1 is given.     

On the difference between the number of prime divisors at consecutive integers

Suppose thatg(n) is equal to the number of divisors ofn, counting multiplicity, or the number of divisors ofn, a≠0 is an integer, andN(x,b)=|{n∶n≤x, g(n+a)−g(n)=b orb+1}|. In the paper we prove that sup _b N(x,b)≤C(a)x)(log log 10 _x )^−1/2 and that there exists a constantC(a,μ)>0 such that, given an integerb |b|≤μ(log logx)^1/2,x≥x _o, the inequalityN(x,b)≥C(a,μ)x(log logx(^−1/2) is valid. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 579–595, October, 1999.     

Existence of singular solutions of a degenerate equation in R 2

Let a₁,a₂, . . . ,a_m ∈ ℝ², 2≤f ∈ C([0,∞)), g_i ∈ C([0,∞)) be such that 0≤g_i(t)≤2 on [0,∞) ∀i=1, . . . ,m. For any p>1, we prove the existence and uniqueness of solutions of the equation u_t=Δ(logu), u>0, in satisfying and logu(x,t)/log|x|→−f(t) as |x|→∞, logu(x,t)/log|x−a_i|→−g_i(t) as |x−a_i|→0, uniformly on every compact subset of (0,T) for any i=1, . . . ,m under a mild assumption on u₀ where We also obtain similar existence and uniqueness of solutions of the above equation in bounded smooth convex domains of ℝ² with prescribed singularities at a finite number of points in the domain.     

On the Structure of Graphs with Bounded Asteroidal Number

 A set A⊆V of the vertices of a graph G=(V,E) is an asteroidal set if for each vertex a∈A, the set A\{a} is contained in one component of G−N[a]. The maximum cardinality of an asteroidal set of G, denoted by an (G), is said to be the asteroidal number of G. We investigate structural properties of graphs of bounded asteroidal number. For every k≥1, an (G)≤k if and only if an (H)≤k for every minimal triangulation H of G. A dominating target is a set D of vertices such that D∪S is a dominating set of G for every set S such that G[D∪S] is connected. We show that every graph G has a dominating target with at most an (G) vertices. Finally, a connected graph G has a spanning tree T such that d _T (x,y)−d _G (x,y)≤3·|D|−1 for every pair x,y of vertices and every dominating target D of G. Received: July 3, 1998 Final version received: August 10, 1999     

Removable singularities and non-uniqueness of solutions of a singular diffusion equation

 We prove that the solution u of the equation u _t =Δlog u, u>0, in (Ω\{x ₀})×(0,T), Ω⊂ℝ², has removable singularities at {x ₀}×(0,T) if and only if for any 0<α<1, 0<a<b<T, there exist constants ρ₀, C ₁, C ₂>0, such that C ₁ |x−x ₀|^α≤u(x,t)≤C ₂|x−x ₀|^−α holds for all 0<|x−x ₀|≤ρ₀ and a≤t≤b. As a consequence we obtain a sufficient condition for removable singularities at {∞}×(0,T) for solutions of the above equation in ℝ²×(0,T) and we prove the existence of infinitely many finite mass solutions for the equation in ℝ²×(0,T) when 0≤u ₀∉L ¹ (ℝ²) is radially symmetric and u ₀L _loc ¹(ℝ²). Received: 16 December 2001 / Revised version: 20 May 2002 / Published online: 10 February 2003 Mathematics Subject Classification (1991): 35B40, 35B25, 35K55, 35K65     

Problem with periodicity conditions for a degenerating equation of mixed type

For the equation K(t)u _xx + u _tt − b ² K(t)u = 0 in the rectangular domain D = “(x, t)‖ 0 < x < 1, −α < t < β”, where K(t) = (sgnt)|t| ^m , m > 0, and b > 0, α > 0, and β > 0 are given real numbers, we use the spectral method to obtain necessary and sufficient conditions for the unique solvability of the boundary value problem u(0, t) = u(1, t), u _x (0, t) = u _x (1, t), −α ≤ t ≤ β, u(x, β) = φ(x), u(x,−α) = ψ(x), 0 ≤ x ≤ 1.     

Cycles in Partially Square Graphs

. In this work we consider finite undirected simple graphs. If G=(V,E) is a graph we denote by α(G) the stability number of G. For any vertex x let N[x] be the union of x and the neighborhood N(x). For each pair of vertices ab of G we associate the set J(a,b) as follows. J(a,b)={u∈N[a]∩N[b]∣N(u)⊆N[a]∪N[b]}. Given a graph G, its partially squareG ^* is the graph obtained by adding an edge uv for each pair u,v of vertices of G at distance 2 whenever J(u,v) is not empty. In the case G is a claw-free graph, G ^* is equal to G ². If G is k-connected, we cover the vertices of G by at most ⌈α(G ^*)/k⌉ cycles, where α(G ^*) is the stability number of the partially square graph of G. On the other hand we consider in G ^* conditions on the sum of the degrees. Let G be any 2-connected graph and t be any integer (t≥2). If ∑ _{x ∈ S} deg _G (x)≥|G|, for every t-stable set S⊆V(G) of G ^* then the vertex set of G can be covered with t−1 cycles. Different corollaries on covering by paths are given. Received: January 22, 1997 Final version received: February 15, 2000     

Growth and Hölder conditions for the sample paths of Feller processes

Let (A,D(A)) be the infinitesimal generator of a Feller semigroup such that C _c ^∞(ℝ ⁿ )⊂D(A) and A|C _c ^∞(ℝ ⁿ ) is a pseudo-differential operator with symbol −p(x,ξ) satisfying |p(•,ξ)|_∞≤c(1+|ξ|²) and |Imp(x,ξ)|≤c ₀Rep(x,ξ). We show that the associated Feller process {X _t } _{t ≥0} on ℝ ⁿ is a semimartingale, even a homogeneous diffusion with jumps (in the sense of [21]), and characterize the limiting behaviour of its trajectories as t→0 and ∞. To this end, we introduce various indices, e.g., β_∞ ^x :={λ>0:lim _{|ξ|→∞ | x − y |≤2/|ξ|}|p(y,ξ)|/|ξ|^λ=0} or δ_∞ ^x :={λ>0:liminf _{|ξ|→∞ | x − y |≤2/|ξ| |ε|≤1}|p(y,|ξ|ε)|/|ξ|^λ=0}, and obtain a.s. (ℙ ^x ) that lim _{t →0} t ^−1/λ _{s ≤ t} |X _s −x|=0 or ∞ according to λ>β_∞ ^x or λ<δ_∞ ^x . Similar statements hold for the limit inferior and superior, and also for t→∞. Our results extend the constant-coefficient (i.e., Lévy) case considered by W. Pruitt [27]. Received: 21 July 1997 / Revised version: 26 January 1998     

Additive Latin transversals and group rings

LetA={a ₁, …,a _k} and {b ₁, …,b _k} be two subsets of an abelian groupG, k≤|G|. Snevily conjectured that, when |G| is odd, there is a numbering of the elements ofB such thata _i+b _i,1≤i≤k are pairwise distinct. By using a polynomial method, Alon affirmed this conjecture for |G| prime, even whenA is a sequence ofk<|G| elements. With a new application of the polynomial method, Dasgupta, Károlyi, Serra and Szegedy extended Alon’s result to the groupsZ _p ^r andZ _p ^rin the casek<p and verified Snevily’s conjecture for every cyclic group. In this paper, by employing group rings as a tool, we prove that Alon’s result is true for any finite abelianp-group withk<√2p, and verify Snevily’s conjecture for every abelian group of odd order in the casek<√p, wherep is the smallest prime divisor of |G|. This work has been supported partly by NSFC grant number 19971058 and 10271080.     

Restricted sumsets and a conjecture of Lev

LetA, B, S be finite subsets of an abelian groupG. Suppose that the restricted sumsetC={α+b: α ∈A, b ∈B, and α − b ∉S} is nonempty and somec∈C can be written asa+b witha∈A andb∈B in at mostm ways. We show that ifG is torsion-free or elementary abelian, then |C|≥|A|+|B|−|S|−m. We also prove that |C|≥|A|+|B|−2|S|−m if the torsion subgroup ofG is cyclic. In the caseS={0} this provides an advance on a conjecture of Lev. This author is responsible for communications, and supported by the National Science Fund for Distinguished Young Scholars (No. 10425103) and the Key Program of NSF (No. 10331020) in China.     

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 ₁.     

Bichromatic and Equichromatic Lines in ℂ2 and ℝ2

Let G and R each be a finite set of green and red points, respectively, such that |G|=n, |R|=n−k, G∩R=∅, and the points of G∪R are not all collinear. Let t be the total number of lines determined by G∪R. The number of equichromatic lines (a subset of bichromatic) is at least (t+2n+3−k(k+1))/4. A slightly weaker lower bound exists for bichromatic lines determined by points in ℂ². For sufficiently large point sets, a proof of a conjecture by Kleitman and Pinchasi is provided. A lower bound of (2t+14n−k(3k+7))/14 is demonstrated for bichromatic lines passing through at most six points. Lower bounds are also established for equichromatic lines passing through at most four, five, or six points.     

Near-interpolation

Summary.  A parametric curve fL ₂ ^(m) ([a,b]ℝ ^d ) is a ``near-interpolant' to prescribed data z <sub>ij</sub> ℝ <sup>d</sup> at data sites t <sub>i</sub> [a,b] within tolerances 0<ɛ <sub>ij</sub> ≤∞ if |f <sup>(j−1)</sup> (t <sub>i</sub> )−z <sub>ij</sub> |≤ɛ <sub>ij</sub> for i=1:n and j=1:m, and a ``best near-interpolant' if it also minimizes ∫ _a ^b |f ^(m) |². In this paper optimality conditions are derived for these best near-interpolants. Based on these conditions it is shown that the near-interpolants are actually smoothing splines with weights that appear as Lagrange multipliers corresponding to the constraints. The optimality conditions are applied to the computation of near-interpolants in the last sections of the paper. Received September 4, 2001 / Revised version received July 22, 2002 / Published online October 29, 2002 Mathematics Subject Classification (1991): 41A05, 41A15, 41A29     

On the Average Number of Unitary Factors of Finite Abelian Groups (II)

Let t(G) be the number of unitary factors of finite abelian group G. In this paper we prove T(x)=∑ _|G|≤x t(G) = main terms for any exponent pair (κ1/2 + 2κ), which improves on the exponent 9/25 obtained by Xiaodong Cao and the author. Received December 8, 1998, Revised April 27, 1998, Accepted June 12, 1998     

Exact Rates of Convergence of Functional Limit Theorems for Csörgő;-Révész Increments of a Wiener Process

Let {W(t); t≥ 0} be a standard Wiener process and S be the Strassen set of functions. We investigate the exact rates of convergence to zero (as T→∞) of the variables $ \sup _{{0 \leqslant t \leqslant T - \alpha _{T} }} \inf _{{f \in S}} \sup _{{0 \leqslant x \leqslant 1}} {\left| {Y_{{t,T}} {\left( x \right)} - f{\left( x \right)}} \right|} Let {W(t); t≥ 0} be a standard Wiener process and S be the Strassen set of functions. We investigate the exact rates of convergence to zero (as T→∞) of the variables sup_{0≤ t ≤ T − aT} inf _f∈S sup_{0≤ x ≤1}|Y _t,T (x) −f(x)| and inf_{0≤ t ≤ T−aT} sup_{0≤ x ≤1}|Y _t,T (x−f(x)| for any given f∈S, where Y _t,T (x) = (W(t+xa _T ) −W(t)) (2a _T (log Ta _T ⁻¹ + log log T))^−1/2. We establish a relation between how small the increments are and the functional limit results of Cs?rg{\H o}-Révész increments for a Wiener process. Similar results for partial sums of i.i.d. random variables are also given. Received September 10, 1999, Accepted June 1, 2000     

NEIGHBORHOOD UNION OF INDEPENDENT SETS AND HAMILTONICITY OF CLAW-FREE GRAPHS

Let G be a graph,for any u∈V(G),let N(u) denote the neighborhood of u and d(u)=|N(u)| be the degree of u. For any U V(G) ,let N(U)=Uu,∈UN(u), and d(U)=|N(U)|.A graph G is called claw-free if it has no induced subgraph isomorphic to K1.3. One of the fundamental results concerning cycles in claw-free graphs is due to Tian Feng,et al. : Let G be a 2-connected claw-free graph of order n,and d(u) d(v) d(w)≥n-2 for every independent vertex set {u,v,w} of G, then G is Hamiltonian. It is proved that, for any three positive integers s ,t and w,such that if G is a (s t w-1)connected claw-free graph of order n,and d(S) d(T) d(W)＞n-(s t w) for every three disjoint independent vertex sets S,T,W with |S |=s, |T|=t, |W|=w,and S∪T∪W is also independent ,then G is Hamiltonian. Other related results are obtained too.     

Stochastic Equations with Time-Dependent Drift Driven by Levy Processes

The stochastic equation dX _t =dS _t +a(t,X _t )dt, t≥0, is considered where S is a one-dimensional Levy process with the characteristic exponent ψ(ξ),ξ∈ℝ. We prove the existence of (weak) solutions for a bounded, measurable coefficient a and any initial value X ₀=x ₀∈ℝ when (ℛe  ψ(ξ))⁻¹=o(|ξ|⁻¹) as |ξ|→∞. These conditions coincide with those found by Tanaka, Tsuchiya and Watanabe (J. Math. Kyoto Univ. 14(1), 73–92, 1974) in the case of a(t,x)=a(x). Our approach is based on Krylov’s estimates for Levy processes with time-dependent drift. Some variants of those estimates are derived in this note.     

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

 Let D be a semicomplete multipartite digraph, with partite sets V ₁, V ₂,…, V _c, such that |V ₁|≤|V ₂|≤…≤|V _c|. Define f(D)=|V(D)|−3|V _c|+1 and . We define the irregularity i(D) of D to be max|d ⁺(x)−d ⁻(y)| over all vertices x and y of D (possibly x=y). We define the local irregularity i _l(D) of D to be max|d ⁺(x)−d ⁻(x)| over all vertices x of D and we define the global irregularity of D to be i _g(D)=max{d ⁺(x),d ⁻(x) : x∈V(D)}−min{d ⁺(y),d ⁻(y) : y∈V(D)}. In this paper we show that if i _g(D)≤g(D) or if i _l(D)≤min{f(D), g(D)} then D is Hamiltonian. We furthermore show how this implies a theorem which generalizes two results by Volkmann and solves a stated problem and a conjecture from [6]. Our result also gives support to the conjecture from [6] that all diregular c-partite tournaments (c≥4) are pancyclic, and it is used in [9], which proves this conjecture for all c≥5. Finally we show that our result in some sense is best possible, by giving an infinite class of non-Hamiltonian semicomplete multipartite digraphs, D, with i _g(D)=i(D)=i _l(D)=g(D)+?≤f(D)+1. Revised: September 17, 1998     

On Some Three-Color Ramsey Numbers

 In this paper we study three-color Ramsey numbers. Let K _i,j denote a complete i by j bipartite graph. We shall show that (i) for any connected graphs G ₁, G ₂ and G ₃, if r(G ₁, G ₂)≥s(G ₃), then r(G ₁, G ₂, G ₃)≥(r(G ₁, G ₂)−1)(χ(G ₃)−1)+s(G ₃), where s(G ₃) is the chromatic surplus of G ₃; (ii) (k+m−2)(n−1)+1≤r(K _1,k , K _1,m , K _n )≤ (k+m−1)(n−1)+1, and if k or m is odd, the second inequality becomes an equality; (iii) for any fixed m≥k≥2, there is a constant c such that r(K _k,m , K _k,m , K _n )≤c(n/logn), and r(C _2m , C _2m , K _n )≤c(n/logn) ^m/(m−1) for sufficiently large n. Received: July 25, 2000 Final version received: July 30, 2002 RID="*" ID="*" Partially supported by RGC, Hong Kong; FRG, Hong Kong Baptist University; and by NSFC, the scientific foundations of education ministry of China, and the foundations of Jiangsu Province Acknowledgments. The authors are grateful to the referee for his valuable comments. AMS 2000 MSC: 05C55     

Algebras whose equivalence relations are congruences

It is proved that all the equivalence relations of a universal algebra A are its congruences if and only if either |A| ≤ 2 or every operation f of the signature is a constant (i.e., f(a ₁ , . . . , a _n ) = c for some c ∈ A and all the a ₁ , . . . , a _n ∈ A) or a projection (i.e., f(a ₁ , . . . , a _n ) = a _i for some i and all the a ₁ , . . . , a _n ∈ A). All the equivalence relations of a groupoid G are its right congruences if and only if either |G| ≤ 2 or every element a ∈ G is a right unit or a generalized right zero (i.e., x _a  = y _a for all x, y ∈ G). All the equivalence relations of a semigroup S are right congruences if and only if either |S| ≤ 2 or S can be represented as S = A∪B, where A is an inflation of a right zero semigroup, and B is the empty set or a left zero semigroup, and ab = a, ba = a ² for a ∈ A, b ∈ B. If G is a groupoid of 4 or more elements and all the equivalence relations of it are right or left congruences, then either all the equivalence relations of the groupoid G are left congruences, or all of them are right congruences. A similar assertion for semigroups is valid without the restriction on the number of elements.