THE SPHERICAL FUNCTIONS AND THE CENTRAL LIMIT THEOREM ON SU（2,2）/S（U（2） × U（2））

Let G = SU（2, 2）, K = S（U（2） × U（2））, and for l ∈ Z, let {Tl}l∈z be a one-dimensional K-type and let El be the line bundle over G/K associated to Tl. It is shown that the Tl-spherical function on G is given by the hypergeometric functions of several variables. By applying this result, a central limit theorem for the space G/K is obtained.     

THE SPHERICAL FUNCTIONS AND THE CENTRAL LIMIT THEOREM ON SU(2,2)/S(U(2)×U(2))

Let G=SU(2.2).K=S(U(2)×U(2)),and for l∈Z.let{τ_l}_(leZ) be a one- dimensional K-type and let E_l be the line bundle over G/K associated toτ_l .It is shown thal theτ_l-spher cal function on G is given by the hypergeometric functions of several variables.By applying this result,a central limit theorem for the space G/K is obtained.     

SU(n,1)/S(U(n)×U(1))上的中心极限定理

Let G=SU(n,1),K=S(U(n)×u(1)),and for l∈Z,let{η)1∈Z be a one-Dimensional K-type and let E1 be the line bundle over G/K associated to η.In this work we obtain a central limit theorem for the space El.     

More about the kernel convergence and the ideal convergence

Let I 2N be an ideal and let XI = span{χI ： I ∈ I}, and let pI be the quotient norm of l∞/XI. In this paper, we show first that for each proper ideal I 2N, the ideal convergence deduced by I is equivalent to pI-kernel convergence. In addition, let K = {x＊oχ（·） ： x＊∈ p（e）}, where p（x） = lim supn→∞1/n（∑k=1n｜x（k）｜, and let Iμ = {A N ： μ（A） = 0} for all μ = x＊oχ（·） ∈ K. Then Iμ is a proper ideal. We also show that the ideal convergence deduced by the proper ideal Iμ, the p-kernel convergence and the statistical convergence are also equivalent.     

Haddad和Helou定理的另一结论

Let K be a finite field of characteristic ≠ 2 and G the additive group of K × K. Let k_1, k_2 be integers not divisible by the characteristic p of K with(k_1, k_2) = 1. In 2004, Haddad and Helou constructed an additive basis B of G for which the number of representations of g ∈ G as a sum b_1+ b_2(b_1, b_2 ∈ B) is bounded by 18. For g ∈ G and B■G, let σk_1,k_2(B, g)be the number of solutions of g = k_1b_1 + k_2b_2, where b_1, b_2 ∈ B. In this paper, we show that there exists a set B ? G such that k_1 B + k2 B = G and σk_1,k_2(B, g)≤16.     

Periodic points and normal families concerning multiplicity

In 1992,Yang Lo posed the following problem:let F be a family of entire functions,let D be a domain in C,and let k 2 be a positive integer.If,for every f∈F,both f and its iteration f~khave no fixed points in D,is F normal in D?This problem was solved by Ess′en and Wu in 1998,and then solved for meromorphic functions by Chang and Fang in 2005.In this paper,we study the problem in which f and f~(k ) have fixed points.We give positive answers for holomorphic and meromorphic functions.(I)Let F be a family of holomorphic functions in a domain D and let k 2 be a positive integer.If,for each f∈F,all zeros of f(z)-z are multiple and f~khas at most k distinct fixed points in D,then F is normal in D.Examples show that the conditions"all zeros of f(z)-z are multiple"and"f~k having at most k distinct fixed points in D"are the best possible.(II)Let F be a family of meromorphic functions in a domain D,and let k 2 and l be two positive integers satisfying l 4 for k=2 and l 3 for k 3.If,for each f∈F,all zeros of f(z)-z have a multiplicity at least l and f~khas at most one fixed point in D,then F is normal in D.Examples show that the conditions"l 3for k 3"and"f~k having at most one fixed point in D"are the best possible.     

The fractional metric dimension of permutation graphs

Let G =(V(G), E(G)) be a graph with vertex set V(G) and edge set E(G). For two distinct vertices x and y of a graph G, let RG{x, y} denote the set of vertices z such that the distance from x to z is not equa l to the distance from y to z in G. For a function g defined on V(G) and for U■V(G), let g(U) =∑s∈Ug(s). A real-valued function g : V(G) → [0, 1] is a resolving function of G if g(RG{x, y}) ≥ 1 for any two distinct vertices x, y ∈ V(G). The fractional metric dimension dimf(G)of a graph G is min{g(V(G)) : g is a resolving function of G}. Let G1 and G2 be disjoint copies of a graph G, and let σ : V(G1) → V(G2) be a bijection. Then, a permutation graph Gσ =(V, E) has the vertex set V = V(G1) ∪ V(G2) and the edge set E = E(G1) ∪ E(G2) ∪ {uv | v = σ(u)}. First,we determine dimf(T) for any tree T. We show that 1 dimf(Gσ) ≤1/2(|V(G)| + |S(G)|) for any connected graph G of order at least 3, where S(G) denotes the set of support vertices of G. We also show that, for any ε 0, there exists a permutation graph Gσ such that dimf(Gσ)- 1 ε. We give examples showing that neither is there a function h1 such that dimf(G) h1(dimf(Gσ)) for all pairs(G, σ), nor is there a function h2 such that h2(dimf(G)) dimf(Gσ) for all pairs(G, σ). Furthermore,we investigate dimf(Gσ) when G is a complete k-partite graph or a cycle.     

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.     

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

For any vertex u∈V(G), let T_N(U)={u}∪{uv|uv∈E(G), v∈v(G)}∪{v∈v(G)|uv∈E(G)}and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C_f(u)={f(x)|x∈TN(U)}. For any two adjacent vertices x and y of V(G)such that C_f(x)≠C_f(y), we refer to f as a k-avsdt-coloring of G("avsdt"is the abbreviation of"adjacent-vertex-strongly- distinguishing total"). The avsdt-coloring number of G, denoted by X_(ast)(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We proveΔ(G) 1≤X_(ast)(G)≤Δ(G) 2 for any tree or unique cycle graph G.     

Foliations on the tangent bundle of Finsler manifolds

Let M be a smooth manifold with Finsler metric F,and let T M be the slit tangent bundle of M with a generalized Riemannian metric G,which is induced by F.In this paper,we prove that (i) (M,F) is a Landsberg manifold if and only if the vertical foliation F V is totally geodesic in (T M,G);(ii) letting a:= a(τ) be a positive function of τ=F 2 and k,c be two positive numbers such that c=2 k(1+a),then (M,F) is of constant curvature k if and only if the restriction of G on the c-indicatrix bundle IM (c) is bundle-like for the horizontal Liouville foliation on IM (c),if and only if the horizontal Liouville vector field is a Killing vector field on (IM (c),G),if and only if the curvature-angular form Λ of (M,F) satisfies Λ=1-a 2/R on IM (c).     

LINEAR EQUATIONS OVER CONES,COLLATZ-WIELANDT NUMBERS AND ALTERNATING SEQUENCES

Let K be a proper cone in R~x,let A be an n×n real matrix that satisfies AK(?)K,letb be a given vector of K,and let λbe a given positive real number.The following two lin-ear equations are considered in this paper:(i)(λⅠ_n-A)x=b,x∈K,and(ii)(A-λⅠ_n)x=b,x∈K.We obtain several equivalent conditions for the solvability of the first equation.For     

A new characterization of L 2(r) by their Sylow numbers

Let G be a finite centerless group, let π(G) be the set of prime divisors of the order of G, and let np(G) be the number of Sylow p-subgroups of G, that is, n_p(G) = |Sylp(G)|. Set NS(G) := {n_p(G)| p ∈π(G)}. In this paper, we are investigating whether L_2(r) is determined up to isomorphism by NS(L_2(r)) when r is prime.     

Some Elements of Finite Order in K2Q

Let K2 be the Milnor functor and let Фn （x）∈ Q[X] be the n-th cyclotomic polynomial. Let Gn（Q） denote a subset consisting of elements of the form {a, Фn（a）}, where a ∈ Q^＊ and {, } denotes the Steinberg symbol in K2Q. J. Browkin proved that Gn（Q） is a subgroup of K2Q if n = 1,2, 3, 4 or 6 and conjectured that Gn（Q） is not a group for any other values of n. This conjecture was confirmed for n =2^T 3S or n = p^r, where p ≥ 5 is a prime number such that h（Q（ζp）） is not divisible by p. In this paper we confirm the conjecture for some n, where n is not of the above forms, more precisely, for n = 15, 21,33, 35, 60 or 105.     

Λ-模的σ-子模的标准表示式

Let A be a commutative ring with unit element, and let M be a Λ-module and σ∈Hom_Λ (M, M). Then a non-empty subset N of M is called a σ-submodule of the Λ-module M, if (1) a-b∈N for all a, bg∈N, and (2) λσ(α)∈N and x-σ(x)∈N for all λ∈Λ, α∈N, x∈M. Let N be a σ-submodule of M. N is said to be a primary σ-submodule of the Λ-module M, if (1) N≠M, and (2) whenever λ∈Λ, x∈M and λσ(x) ∈N, then either x∈N or λ^kσ(M)?N for some positive integer h. This paper is intended to show (1) that if M satisfies maximal condition of σ-submodule, and K is a σ-submodule of M, then K is a finite intersection of primary σ-submodules, and (2) that the uniqueness on the normal expression of σ-submodule of the Λ-module. Also, some results of fractional module have been obtained.     

Neighbor Sum Distinguishing Colorings of Graphs with Maximum Average Degree Less Than 37/12

Let G be a graph and let its maximum degree and maximum average degree be denoted byΔ(G) and mad(G), respectively. A neighbor sum distinguishing k-edge colorings of graph G is a proper k-edge coloring of graph G such that, for any edge uv ∈ E(G), the sum of colors assigned on incident edges of u is different from the sum of colors assigned on incident edges of v. The smallest value of k in such a coloring of G is denoted by χ'∑≠(G). Flandrin et al. proposed the following conjecture thatχ'∑(G) ≤Δ(G) + 2 for any connected graph with at least 3 vertices and G≠C_5. In this paper, we prove that the conjecture holds for a normal graph with mad(G) 37/12 and Δ(G) ≥ 7.     

On a problem of Sierpiński,Ⅱ

For any integer s≥ 2, let μsbe the least integer so that every integer l μs is the sum of exactly s integers which are pairwise relatively prime. In 1964, Sierpi′nski asked for the determination of μs. Let pibe the i-th prime and let μs= p2 + p3 + + ps+1+ cs. Recently, the authors solved this problem. In particular,we have(1) cs=-2 if and only if s = 2;(2) the set of integers s with cs= 1100 has asymptotic density one;(3) cs∈ A for all s ≥ 3, where A is an explicit set with A ■[2, 1100] and |A| = 125. In this paper, we prove that,(1) for every a ∈ A, there exists an index s with cs= a;(2) under Dickson's conjecture, for every a ∈ A,there are infinitely many s with cs= a. We also point out that recent progress on small gaps between primes can be applied to this problem.     

Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) 6= C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt(G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K8,n are discussed in this paper. Particularly, the VDIET chromatic number of K8,n are obtained.     

On s-quasinormal and c-normal subgroups of a finite group

Let F be a saturated formation containing the class of supersolvable groups and let G be a finite group. The following theorems are shown： （1） G ∈ F if and only if there is a normal subgroup H such that G/H ∈ F and every maximal subgroup of all Sylow subgroups of H is either c-normal or s-quasinormally embedded in G; （2） G ∈F if and only if there is a soluble normal subgroup H such that G/H∈F and every maximal subgroup of all Sylow subgroups of F（H）, the Fitting subgroup of H, is either e-normally or s-quasinormally embedded in G.     

On quasi-similarity of subnormal operators

For a compact subset K in the complex plane, let Rat(K) denote the set of the rational functions with poles off K. Given a finite positive measure with support contained in K, let R2(K,v) denote the closure of Rat(K) in L2(v) and let Sv denote the operator of multiplication by the independent variable z on R2(K, v), that is, Svf = zf for every f∈R2(K, v). SupposeΩis a bounded open subset in the complex plane whose complement has finitely many components and suppose Rat(Ω) is dense in the Hardy space H2(Ω). Letσdenote a harmonic measure forΩ. In this work, we characterize all subnormal operators quasi-similar to Sσ, the operators of the multiplication by z on R2(Ω,σ). We show that for a given v supported onΩ, Sv is quasi-similar to Sσif and only if v/■Ω■σ and log(dv/dσ)∈L1(σ). Our result extends a well-known result of Clary on the unit disk.     

环状硅酸盐图的友好指数集

Let G be a graph with vertex set V(G) and edge set E(G). A labeling f : V(G) →Z2 induces an edge labeling f*: E(G) → Z2 defined by f*(xy) = f(x) + f(y), for each edge xy ∈ E(G). For i ∈ Z2, let vf(i) = |{v ∈ V(G) : f(v) = i}| and ef(i) = |{e ∈ E(G) : f*(e) =i}|. A labeling f of a graph G is said to be friendly if |vf(0)- vf(1)| ≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as {|ef(0)- ef(1)|: the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS(n, m).