On the order of certain close to regular graphs without a matching of given size

A graph G is a {d, d+k}-graph, if one vertex has degree d+k and the remaining vertices of G have degree d. In the special case of k = 0, the graph G is d-regular. Let k, p ⩾ 0 and d, n ⩾ 1 be integers such that n and p are of the same parity. If G is a connected {d, d+k{-graph of order n without a matching M of size 2|M| = n − p, then we show in this paper the following: If d = 2, then k ⩾ 2(p + 2) and

Existence of subgraph with orthogonal (g,f)-factorization

Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F ₁,F ₂,⃛,F ₁| ofG, if |E(H)∩E(F ₁)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G). Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences.     

Acyclic edge colorings of planar graphs and seriesparallel graphs

A proper edge coloring of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a′(G), is the least number of colors in an acyclic edge coloring of G. Alon et al. conjectured that a′(G) ⩽ Δ(G) + 2 for any graphs. For planar graphs G with girth g(G), we prove that a′(G) ⩽ max{2Δ(G) − 2, Δ(G) + 22} if g(G) ⩾ 3, a′(G) ⩽ Δ(G) + 2 if g(G) ⩾ 5, a′(G) ⩽ Δ(G) + 1 if g(G) ⩾ 7, and a′(G) = Δ(G) if g(G) ⩾ 16 and Δ(G) ⩾ 3. For series-parallel graphs G, we have a′(G) ⩽ Δ(G) + 1. This work was supported by National Natural Science Foundation of China (Grant No. 10871119) and Natural Science Foundation of Shandong Province (Grant No. Y2008A20).     

On k -diameter of k -connected graphs

Let G be a k-connected simple graph with order n. The k-diameter, combining connectivity with diameter, of G is the minimum integer d _k (G) for which between any two vertices in G there are at least k internally vertex-disjoint paths of length at most d _k (G). For a fixed positive integer d, some conditions to insure d _k (G)⩽d are given in this paper. In particular, if d⩾3 and the sum of degrees of any s (s=2 or 3) nonadjacent vertices is at least n+(s−1)k+1−d, then d _k (G)⩽d. Furthermore, these conditions are sharp and the upper bound d of k-diameter is best possible. Supported by NNSF of China (19971086).     

On Enomoto’s problems in a bipartite graph

In this paper, we obtain the following result: Let k, n ₁ and n ₂ be three positive integers, and let G = (V ₁,V ₂;E) be a bipartite graph with |V1| = n ₁ and |V ₂| = n ₂ such that n ₁ ⩾ 2k + 1, n ₂ ⩾ 2k + 1 and |n ₁ − n ₂| ⩽ 1. If d(x) + d(y) ⩾ 2k + 2 for every x ∈ V ₁ and y ∈ V ₂ with xy $ \notin $ \notin E(G), then G contains k independent cycles. This result is a response to Enomoto’s problems on independent cycles in a bipartite graph.     

On Hong’s conjecture for power LCM matrices

A set S={x ₁,...,x _n } of n distinct positive integers is said to be gcd-closed if (x _i , x _j ) ∈ S for all 1 ⩽ i, j ⩽ n. Shaofang Hong conjectured in 2002 that for a given positive integer t there is a positive integer k(t) depending only on t, such that if n ⩽ k(t), then the power LCM matrix ([x _i , x _j ] ^t ) defined on any gcd-closed set S={x ₁,...,x _n } is nonsingular, but for n ⩾ k(t) + 1, there exists a gcd-closed set S={x ₁,...,x _n } such that the power LCM matrix ([x _i , x _j ] ^t ) on S is singular. In 1996, Hong proved k(1) = 7 and noted k(t) ⩾ 7 for all t ⩾ 2. This paper develops Hong’s method and provides a new idea to calculate the determinant of the LCM matrix on a gcd-closed set and proves that k(t) ⩾ 8 for all t ⩾ 2. We further prove that k(t) ⩾ 9 iff a special Diophantine equation, which we call the LCM equation, has no t-th power solution and conjecture that k(t) = 8 for all t ⩾ 2, namely, the LCM equation has t-th power solution for all t ⩾ 2.     

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.     

Diameter and diametrical pairs of points in ultrametric spaces

Let F(X) be the set of finite nonempty subsets of a set X. We have found the necessary and sufficient conditions under which for a given function τ: F(X) → ℝ there is an ultrametric on X such that τ(A) = diamA for every A ∈ F(X). For finite nondegenerate ultrametric spaces (X, d) it is shown that X together with the subset of diametrical pairs of points of X forms a complete k-partite graph, k ⩾ 2, and, conversely, every finite complete k-partite graph with k ⩾ 2 can be obtained by this way. We use this result to characterize the finite ultrametric spaces (X, d) having the minimal card{(x, y): d(x, y) = diamX, x, y ∈ X} for given card X.     

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     

Global dimension and left derived functors of Hom

It is well known that the right global dimension of a ring R is usually computed by the right derived functors of Hom and the left projective resolutions of right R-modules. In this paper, for a left coherent and right perfect ring R, we characterize the right global dimension of R, from another point of view, using the left derived functors of Hom and the right projective resolutions of right R-modules. It is shown that rD(R)≤n (n≥2) if and only if the gl right Proj-dim MR≤n - 2 if and only if Extn-1(N, M) = 0 for all right R-modules N and M if and only if every (n - 2)th Proj-cosyzygy of a right R-module has a projective envelope with the unique mapping property. It is also proved that rD(R)≤n (n≥1) if and only if every (n-1)th Proj-cosyzygy of a right R-module has an epic projective envelope if and only if every nth Vroj-cosyzygy of a right R-module is projective. As corollaries, the right hereditary rings and the rings R with rD(R)≤2 are characterized.     

Derivations with power central values on Lie ideals in prime rings

Let R be a prime ring of char R ≠ 2 with a nonzero derivation d and let U be its noncentral Lie ideal. If for some fixed integers n ₁ ⩾ 0, n ₂ ⩾ 0, n ₃ ⩾ 0, (u ⁿ¹ [d(u), u]u ⁿ²) ⁿ³ ∈ Z(R) for all u ∈ U, then R satisfies S ₄, the standard identity in four variables.     

The total chromatic number of regular graphs of high degree

The total chromatic number χT (G) of a graph G is the minimum number of colors needed to color the edges and the vertices of G so that incident or adjacent elements have distinct colors. We show that if G is a regular graph and d(G) 32 |V (G)| + 263 , where d(G) denotes the degree of a vertex in G, then χT (G) d(G) + 2.     

On subgroups of the general linear group that contain a maximal nonsplit torus

The paper deals with the structure of intermediate subgroups of the general linear group GL(n, k) of degree n over a field k of odd characteristic that contain a nonsplit maximal torus related to a radical extension of degree n of the ground field k. The structure of ideal nets over a ring that determine the structure of intermediate subgroups containinga transvection is given. Let K = k( ⁿ?{d} ) K = k\left( {\sqrt[n]{d}} \right) be a radical degree-n extension of a field k of odd characteristic, and let T =(d) be a nonsplit maximal torus, which is the image of the multiplicative group of the field K under the regular embedding in G =GL(n, k). In the paper, the structure of intermediate subgroups H, T ≤ H ≤ G, that contain a transvection is studied. The elements of the matrices in the torus T = T (d) generate a subring R(d) in the field k.Let R be an intermediate subring, R(d) ⊆ R ⊆ k, d ∈ R. Let σ_R denote the net in which the ideal dR stands on the principal diagonal and above it and all entries of which beneath the principal diagonal are equal to R. Let σ^R denote the net in which all positions on the principal diagonal and beneath it are occupied by R and all entries above the principal diagonal are equal to dR. Let E(σ_R) be the subgroup generated by all transvections from the net group G(σ_R). In the paper it is proved that the product TE(σ_R) is a group (and thus an intermediate subgroup). If the net σ associated with an intermediate subgroup H coincides with σ_R,then TE(σ_R) ≤ H ≤ N(σ_R),where N(σ_R) is the normalizer of the elementary net group E(σ_R) in G. For the normalizer N(σ_R),the formula N(σ_R)= TG(σ^R) holds. In particular, this result enables one to describe the maximal intermediate subgroups. Bibliography: 13 titles.     

à propos de l’indice de composition des nombres

 We define the index of composition λ(n) of an integer n ⩾ 2 as λ(n) = log n/log γ(n), where γ(n) stands for the product of the primes dividing n, and first establish that λ and 1/λ both have asymptotic mean value 1. We then establish that, given any ɛ > 0 and any integer k ⩾ 2, there exist infinitely many positive integers n such that . Considering the distribution function F(z,x) := #{n < x : λ(n) > z}, we prove that, given 1 < z < 2 and ɛ > 0, then, if x is sufficiently large,

Multidimensional version of M. A. Krasnoseľskii’s generalized contraction principle

Let M be a complete K-metric space with n-dimensional metric ρ(x, y): M × M → R ⁿ , where K is the cone of nonnegative vectors in R ⁿ . A mapping F: M → M is called a Q-contraction if ρ (Fx,Fy) ⩽ Qρ (x,y), where Q: K → K is a semi-additive absolutely stable mapping. A Q-contraction always has a unique fixed point x* in M, and ρ(x*,a) ⩽ (I - Q)^-1 ρ(Fa, a) for every point a in M. The point x* can be obtained by the successive approximation method x _k = Fx _k-1, k = 1, 2,..., starting from an arbitrary point x ₀ in M, and the following error estimates hold: ρ (x*, x _k ) ⩽ Q ^k (I - Q)^-1ρ(x ₁, _x ⁰) ⩽ (I - Q)^-1 Q ^k ρ(x ₁, x ₀), k = 1, 2,.... Generally the mappings (I - Q)^-1 and Q ^k do not commute. For n = 1, the result is close to M. A. Krasnosel’skii’s generalized contraction principle.     

Central localization and Gelfand-Kirillov dimension

LetR be a factor ring of the enveloping algebra of a finite dimensional Lie algebra over a fieldk. If the centre ofR, Z, consists of non-zero divisors inR, the ringR _z obtained by localizing at the non-zero elements ofZ becomes a finitely generated algebra over the fieldK which arises as the field of fractions ofZ. The Gelfand-Kirillov dimension of anR-moduleM is denotedd(M). In this paper it is shown that ifR _Z ⊗ _R M ≠ 0 thend(M) ≧d(R _Z ⊗ _R M) + tr. deg _k Z, whered (R _z ⊗M) is the Gelfand-Kirillov dimension ofR _z ⊗M) viewed as anR _z -module andR _z is viewed as a finitely generatedK-algebra (not as ak-algebra). The result is primarily of a technical nature.     

À propos de l’indice de composition des nombres

 We define the index of composition λ(n) of an integer n ⩾ 2 as λ(n) = log n/log γ(n), where γ(n) stands for the product of the primes dividing n, and first establish that λ and 1/λ both have asymptotic mean value 1. We then establish that, given any ɛ > 0 and any integer k ⩾ 2, there exist infinitely many positive integers n such that . Considering the distribution function F(z,x) := #{n < x : λ(n) > z}, we prove that, given 1 < z < 2 and ɛ > 0, then, if x is sufficiently large,

On typically real functions which are generated by a fixed typically real function

Let T be the family of all typically real functions, i.e. functions that are analytic in the unit disk Δ:= {z ∈ ℂ: |z| < 1}, normalized by f(0) = f′(0) − 1 = 0 and such that Imz Im f(z) ⩾ 0 for z ∈ Δ.     

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.     

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.