A Criterion of Normality Concerning Holomorphic Functions Whose Derivative Omits a Function

The authors discuss the normality concerning holomorphic functions and get the following result. Let F be a family of holomorphic functions on a domain D ⊂ ℂ, all of whose zeros have multiplicity at least k, where k ≥ 2 is an integer. And let h(z) ≢ 0 be a holomorphic function on D. Assume also that the following two conditions hold for every f ∈ F: (a) f(z) = 0 ⇒ |f ^(k)(z)| < |h(z)|; (b) f ^(k)(z) ≠ h(z). Then F is normal on D.     

Super Connectivity of Line Graphs and Digraphs

The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the conneetivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1（L） = 2λ1 （D）, and that for a connected graph G and its line graph L, if one of κ1 （L） and λ（G） exists, then κ1（L） = λ2（G）. This paper determines that κ1（B（d, n） is equal to 4d- 8 for n = 2 and d ≥ 4, and to 4d-4 for n ≥ 3 and d ≥ 3, and that κ1（K（d, n）） is equal to 4d- 4 for d 〉 2 and n ≥ 2 except K（2, 2）. It then follows that B（d,n） and K（d, n） are both super connected for any d ≥ 2 and n ≥ 1.     

On normal forms of singular Levi-flat real analytic hypersurfaces

Let F(z) = Re(P(z)) + h.o.t be such that M = (F = 0) defines a germ of real analytic Levi-flat at 0 ∈ ℂ ⁿ , n ≥ 2, where P (z) is a homogeneous polynomial of degree k with an isolated singularity at 0 ∈ ℂ ⁿ and Milnor number μ. We prove that there exists a holomorphic change of coordinate ϕ such that ϕ(M) = (Re(h) = 0), where h(z) is a polynomial of degree μ + 1 and j ₀ ^k (h) = P.     

Homotopy Types of Stabilizers and Orbits of Morse Functions on Surfaces

Let M be a smooth compact surface, orientable or not, with boundary or without it, P either the real line ℝ ¹ or the circle S ¹, and D(M) the group of diffeomorphisms of M acting on C^∞(M, P) by the rule h⋅ f = f ∘ h ⁻¹ for h ∊ D(M) and f ∊ C^∞ (M,P). Let f: M → P be an arbitrary Morse mapping, Σ _f the set of critical points of f, D(M,Σ _f ) the subgroup of D(M) preserving Σ _f , and S(f), S (f,Σ _f ), O(f), and O(f,Σ _f ) the stabilizers and the orbits of f with respect to D(M) and D(M,Σ _f ). In fact S(f) = S(f,Σ _f ).In this paper we calculate the homotopy types of S(f), O(f) and O(f,Σ _f ). It is proved that except for few cases the connected components of S(f) and O(f,Σ _f ) are contractible, π _k O(f) = π _k M for k ≥ 3, π₂ O(f) = 0, and π₁ O(f) is an extension of π₁ D(M) ⊕ Z ^k (for some k ≥ 0) with a (finite) subgroup of the group of automorphisms of the Kronrod-Reeb graph of f.We also generalize the methods of F. Sergeraert to give conditions for a finite codimension orbit of a tame smooth action of a tame Lie group on a tame Fréchet manifold to be a tame Fréchet manifold itself. In particular, we obtain that O(f) and O(f, Σ _f ) are tame Fréchet manifolds. Communicated by Peter Michor Vienna Mathematics Subject Classifications (2000): 37C05, 57S05, 57R45.     

Normal families and shared functions of meromorphic functions

Let k be a positive integer, let M be a positive number, let F be a family of meromorphic functions in a domain D, all of whose zeros are of multiplicity at least k, and let h be a holomorphic function in D, h ≢ 0. If, for every f ∈ F, f and f ^(k) share 0, and |f(z)| ≥ M whenever f ^(k)(z) = h(z), then F is normal in D. The condition that f and f ^(k) share 0 cannot be weakened, and the condition that |f(z)| ≥ M whenever f ^(k)(z) = h(z) cannot be replaced by the condition that |f(z)| ≥ 0 whenever f ^(k)(z) = h(z). This improves some results due to Fang and Zalcman [2] etc.     

A zero-one law for random subgroups of some totally disconnected groups

Let A be a locally compact group topologically generated by d elements and let k > d. Consider the action, by precomposition, of Γ = Aut(F _k ) on the set of marked, k-generated, dense subgroups $ {D_{k,A}}: = \left\{ {\eta \in {\text{Hom}}\left( {{F_k},A} \right)\left| {\overline {\left\langle {\phi \left( {{F_k}} \right)} \right\rangle } = A} \right.} \right\} Let A be a locally compact group topologically generated by d elements and let k > d. Consider the action, by precomposition, of Γ = Aut(F _k ) on the set of marked, k-generated, dense subgroups D_k,A: = { h ? \textHom( F_k,A )| [`( á f( F_k ) ñ )] = A } {D_{k,A}}: = \left\{ {\eta \in {\text{Hom}}\left( {{F_k},A} \right)\left| {\overline {\left\langle {\phi \left( {{F_k}} \right)} \right\rangle } = A} \right.} \right\} . We prove the ergodicity of this action for the following two families of simple, totally disconnected, locally compact groups:

•	A = PSL2(K) where K is a non-Archimedean local field (of characteristic ≠ 2);
•	A = Aut0(T q+1)—the group of orientation-preserving automorphisms of a q + 1 regular tree, for q \geqslant 2.q \geqslant 2.

In contrast, a recent result of Minsky’s shows that the same action fails to be ergodic for A = PSL₂(C) and, when k is even, also for A = PSL₂(R). Therefore, if k \geqslant 4 k \geqslant 4 is even and K is a local field (with char(K) ≠ 2), the action of Aut(F _k ) on D_{k,\textPS\textL2(K)} {D_{k,{\text{PS}}{{\text{L}}_2}(K)}} is ergodic if and only if K is non-Archimedean. Ergodicity implies that every “measurable property” either holds or fails to hold for almost every k-generated dense subgroup of A.     

A criterion of normality based on a single holomorphic function

Let F be a family of functions holomorphic on a domain D ⊂ ℂ Let k ≥ 2 be an integer and let h be a holomorphic function on D, all of whose zeros have multiplicity at most k −1, such that h(z) has no common zeros with any f ∈ F. Assume also that the following two conditions hold for every f ∈ F: (a) f(z) = 0 ⇒ f′(z) = h(z); and (b) f′(z) = h(z) ⇒ |f ^(k)(z)| ≤ c, where c is a constant. Then F is normal on D.     

The density of rational points on non-singular hypersurfaces

LetF(x) =F[x₁,…,x_n]∈ℤ[x₁,…,x_n] be a non-singular form of degree d≥2, and letN(F, X)=#{xεℤ ⁿ ;F(x)=0, |x|⩽X}, where . It was shown by Fujiwara [4] [Upper bounds for the number of lattice points on hypersurfaces,Number theory and combinatorics, Japan, 1984, (World Scientific Publishing Co., Singapore, 1985)] thatN(F, X)≪X ^n−2+2/n for any fixed formF. It is shown here that the exponent may be reduced ton - 2 + 2/(n + 1), forn ≥ 4, and ton - 3 + 15/(n + 5) forn ≥ 8 andd ≥ 3. It is conjectured that the exponentn - 2 + ε is admissable as soon asn ≥ 3. Thus the conjecture is established forn ≥ 10. The proof uses Deligne’s bounds for exponential sums and for the number of points on hypersurfaces over finite fields. However a composite modulus is used so that one can apply the ‘q-analogue’ of van der Corput’s AB process. Dedicated to the memory of Professor K G Ramanathan     

Viability for a class of semilinear differential equations of retarded type

Let X be a Banach space, A ： D（A） X → X the generator of a compact C0- semigroup S（t） ： X → X, t ≥ 0, D a locally closed subset in X, and f ： （a, b） × X →X a function of Caratheodory type. The main result of this paper is that a necessary and sufficient condition in order to make D a viable domain of the semilinear differential equation of retarded type u＇（t） = Au（t） ＋ f（t, u（t - q））, t ∈ [to, to ＋ T], with initial condition uto = φ ∈C（[-q, 0]; X）, is the tangency condition lim infh10 h^-1d（S（h）v（O）＋hf（t, v（-q））; D） = 0 for almost every t ∈ （a, b） and every v ∈ C（[-q, 0]; X） with v（0）, v（-q）∈ D.     

On Group Chromatic Number of Graphs

Let G be a graph and A an Abelian group. Denote by F(G, A) the set of all functions from E(G) to A. Denote by D an orientation of E(G). For f ∈ F(G,A), an (A,f)-coloring of G under the orientation D is a function c : V(G)↦A such that for every directed edge uv from u to v, c(u)−c(v) ≠ f(uv). G is A-colorable under the orientation D if for any function f ∈ F(G, A), G has an (A, f)-coloring. It is known that A-colorability is independent of the choice of the orientation. The group chromatic number of a graph G is defined to be the least positive integer m for which G is A-colorable for any Abelian group A of order ≥m, and is denoted by χ_g(G). In this note we will prove the following results. (1) Let H₁ and H₂ be two subgraphs of G such that V(H₁)∩V(H₂)=∅ and V(H₁)∪V(H₂)=V(G). Then χ_g(G)≤min{max{χ_g(H₁), max_v∈V(H2)deg(v,G)+1},max{χ_g(H₂), max_u∈V(H1) deg (u, G) + 1}}. We also show that this bound is best possible. (2) If G is a simple graph without a K_3,3-minor, then χ_g(G)≤5.     

Packing,covering and decomposing of a complete uniform hypergraph into delta-systems

Anh-uniform hypergraph generated by a set of edges {E ₁,...,E _c} is said to be a delta-system Δ(p,h,c) if there is ap-element setF such that ∇F|=p andE _i⌢E _j=F,∀i≠j. The main result of this paper says that givenp, h andc, there isn ₀ such that forn≥n ₀ the set of edges of a completeh-uniform hypergraphK _n ^h can be partitioned into subsets generating isomorphic delta-systems Δ(p, h, c) if and only if . This result is derived from a more general theorem in which the maximum number of delta-systems Δ(p, h, c) that can be packed intoK _n ^h and the minimum number of delta-systems Δ(p, h, c) that can cover the edges ofK _n ^h are determined for largen. Moreover, we prove a theorem on partitioning of the edge set ofK _n ^h into subsets generating small but not necessarily isomorphic delta-systems.     

On the divisor function of sets with even partition functions

Summary For P∈ F₂[z] with P(0)=1 and deg(P)≧ 1, let A =A(P) be the unique subset of N (cf. [9]) such that Σ_n≧0 p(A,n)zⁿ ≡ P(z) mod 2, where p(A,n) is the number of partitions of n with parts in A. To determine the elements of the set A, it is important to consider the sequence σ(A,n) = Σ _{d|n, d∈A} d, namely, the periodicity of the sequences (σ(A,2^kn) mod 2^k+1)_n≧1 for all k ≧ 0 which was proved in [3]. In this paper, the values of such sequences will be given in terms of orbits. Moreover, a formula to σ(A,2^kn) mod 2^k+1 will be established, from which it will be shown that the weight σ(A₁,2^kz_i) mod 2^k+1 on the orbit <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>z_i$ is moved on some other orbit z_j when A₁ is replaced by A₂ with A₁= A(P₁) and A₂= A(P₂) P₁ and P₂ being irreducible in F₂[z] of the same odd order.     

The smallest degree sum that yields potentially Kr,r-graphic sequences

We consider a variation of a classical Turán-type extremal problem as follows: Determine the smallest even integer σ(K_r,r,n) such that every n-term graphic sequence π = (d₁,d₂,...,d_n) with term sum σ(π) = d₁ + d₂ + ... + d_n ≥ σ(K_r,r,n) is potentially K_r,r-graphic, where K_r,r is an r × r complete bipartite graph, i.e. π has a realization G containing K_r,r as its subgraph. In this paper, the values σ(K_r,r,n) for even r and n ≥ 4r² - r - 6 and for odd r and n ≥ 4r² + 3r - 8 are determined.     

Linear series onk-gonal curves

Here we prove the following result. Theorem 1.1.Let X be an integral projective curve of arithmetic genus g and k≧ ≧4 an integer. Assume the existence of L ∈ Pic^k (X) with h ⁰ (X, L)=2 and L spanned. Fix a rank 1 torsion free sheaf M on X with h ⁰(X,M)=r+1≧2, h¹ (X, M)≧2 and M spanned by its global sections. Set d≔deg(M) and s≔max {n≧0:h ⁰ (X, M ⊗(L^*)^⊗n)>0}. Then one of the following cases occur:

The total reducibility order of a polynomial in two variables

LetK be an algebraically closed field of characteristic zero. ForA ∈K[x, y] let σ(A) = {λ ∈K:A − λ is reducible}. For λ ∈ σ(A) letA − λ = ∏ _i=1 ^n(λ) A _iλ ^k _μ whereA _iλ are distinct primes. Let ϱ_λ(A) =n(λ) − 1 and let ρ(A) = Σ_λɛσ(A)ϱ_λ(A). The main result is the following: Theorem.If A ∈ K[x, y] is not a composite polynomial, then ρ(A) < degA.     

Comparison theorems for the volume of a complex submanifold of a Kaehler manifold

LetM be a Kaehler manifold of real dimension 2n with holomorphic sectional curvatureK _H≥4λ and antiholomorphic Ricci curvatureρ _A≥(2n−2)λ, andP is a complex hypersurface. We give a bound for the quotient (volume ofP)/(volume ofM) and prove that this bound is attained if and only ifP=C P ⁿ⁻¹(λ) andM=C P ⁿ(λ). Moreover, we give some results on the volume of of tubes aboutP inM. Work partially supported by a DGICYT Grant No. PS87-0115-CO3-01.     

Implicatively selector sets

Let A⊆N={0,1,2,...} and β be an n-ary Boolean function. We call A a β-implicatively selector (β-IS) set if there exists an n-ary selector general recursive function f such that (∀x₁,...,x_n)(β(χ(x₁),...,χ(x_n))=1⟹f(x₁,...,x_n)∈A), where χ is the characteristic function of A. Let F^(m), m≥1, be the family of all d _m+1 ^* -IS sets, where , F⁽⁰⁾=N, and F^(∞) is the class of all subsets in N. The basic result of the article says that the family of all β-IS sets coincides with one of F^(m), m≥0, or F^(∞), and, moreover, the inclusions F⁽⁰⁾⊂F⁽¹⁾⊂...⊂F^(∞) hold. Translated fromAlgebra i Logika, Vol. 35, No. 2, pp. 145–153, March–April, 1996.     

An optimal bound on the tail distribution of the number of recurrences of an event in product spaces

 Let X ₁ ,X ₂ ,... be independent random variables and a a positive real number. For the sake of illustration, suppose A is the event that |X _i+1 +...+X _j |≥a for some integers 0≤i<j<∞. For each k≥2 we upper-bound the probability that A occurs k or more times, i.e. that A occurs on k or more disjoint intervals, in terms of P(A), the probability that A occurs at least once. More generally, let X=(X ₁ ,X ₂ ,...)Ω=Π _{j ≥1}Ω _j be a random element in a product probability space (Ω,ℬ,P=⊗ _{j ≥1} P _j ). We are interested in events AB that are (at most contable) unions of finite-dimensional cylinders. We term such sets sequentially searchable. Let L(A) denote the (random) number of disjoint intervals (i,j] such that the value of X _(i,j] =(X _i+1 ,...,X _j ) ensures that XA. By definition, for sequentially searchable A, P(A)≡P(L(A)≥1)=P(𝒩_{−ln (P(Ac))} ≥1), where 𝒩_γ denotes a Poisson random variable with some parameter γ>0. Without further assumptions we prove that, if 0<P(A)<1, then P(L(A)≥k)<P(𝒩_{−ln (P(Ac))} ≥k) for all integers k≥2. An application to sums of independent Banach space random elements in l ^∞ is given showing how to extend our theorem to situations having dependent components. Received: 8 June 2001 / Revised version: 30 October 2002 Published online: 15 April 2003 RID="*" ID="*" Supported by NSF Grant DMS-99-72417. RID="†" ID="†" Supported by the Swedish Research Council. Mathematics Subject Classification (2000): Primary 60E15, 60G50 Key words or phrases: Tail probability inequalities – Hoffmann-Jo rgensen inequality – Poisson bounds – Number of event recurrences – Number of entrance times – Product spaces     

Chromatic uniqueness of certain complete tripartite graphs

Let P(G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H, λ) = P(G, λ) implies H is isomorphic to G. Liu et al. [Liu, R. Y., Zhao, H. X., Ye, C. F.: A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discrete Math., 289, 175–179 (2004)], and Lau and Peng [Lau, G. C., Peng, Y. H.: Chromatic uniqueness of certain complete t-partite graphs. Ars Comb., 92, 353–376 (2009)] show that K(p − k, p − i, p) for i = 0, 1 are chromatically unique if p ≥ k + 2 ≥ 4. In this paper, we show that if 2 ≤ i ≤ 4, the complete tripartite graph K(p − k, p − i, p) is chromatically unique for integers k ≥ i and p ≥ k ²/4 + i + 1.     

On the Cauchy problem for D t 2–D x a(t,x) n D x

Abstract The well posedness of the Cauchy problem for the operator P=D_t²–D_xa(t,x)ⁿD_x, with data on t=0 is studied assuming a ∈ C^N( (R)), s₀>1 and sufficiently close to 1, a(t,x)≥ 0. Well posedness is proved in Gevrey classes γ^(s), for , n≥ n₀. Keywords: Partial differential equations, Cauchy problem, Well posedness