一类数论函数的性质(Ⅱ)

For any given positive integer n≥1,the Euler functionφ(n) is defined to be the number of positive integers not exceeding n,which is relatively prime to n.ω(n) is defined to be the number of different prime divisors of n.In order to know the solvability of the function ofφ(φ(φ(n)))=2~(ω(n)),properties of the number theoretical functionφ(φ(n)) is studied in the paper.     

Non-linear approximations for natural convection in a horizontal annulus

Two different problems are proposed as approximations of the usual system modelling natural convection under the Oberbeck-Boussinesq assumptions. The error is evaluated by means of the norm of its gradient in the Hilbert space. The average Nusselt number is also estimated.     

Horizontal Connection and Horizontal Mean Curvature in Carnot Groups

In this paper we give a geometric interpretation of the notion of the horizontal mean curvature which is introduced by Danielli Garofalo-Nhieu and Pauls who recently introduced sub- Riemannian minimal surfaces in Carnot groups. This will be done by introducing a natural nonholonomic connection which is the restriction （projection） of the natural Riemannian connection on the horizontal bundle. For this nonholonomic connection and （intrinsic） regular hypersurfaces we introduce the notions of the horizontal second fundamental form and the horizontal shape operator. It turns out that the horizontal mean curvature is the trace of the horizontal shape operator.     

On a generalization of Pólya’s theorem

We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points.     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).     

Pascal矩阵与Vandermonde矩阵的关系

EI-Mikkawy M证明了对称Pascal矩阵Q_n和Vlandermonde矩阵V_n之间满足矩阵方程Q_n=T_nV_n,这里T_n是一个随机矩阵。本文证明了随机矩阵T_n能够分解成第一类Stirling矩阵和对角矩阵的乘积,得到了矩阵T_n的元素之间的递推关系,从而回答了EI-Mikkawy M的一个公开问题。同时得到了一些与Stirling数相关的组合恒等式。     

关于Ramsey数下界的部分结果

本文得到 Ramsey数下界的一个计算公式 :R( l,s+ t-2 )≥ R( l,s) + R( l,t) -1 ,(式中 l、s、t≥ 3) .用此公式算得的 Ramsey数的下界比用其它公式算得的下界好 .     

A note on acyclic domination number in graphs of diameter two

A subset S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by γ_a(G), is called the acyclic domination number of G. Hedetniemi et al. [Acyclic domination, Discrete Math. 222 (2000) 151-165] introduced the concept of acyclic domination and posed the following open problem: if δ(G) is the minimum degree of G, is γ_a(G)?δ(G) for any graph whose diameter is two? In this paper, we provide a negative answer to this question by showing that for any positive k, there is a graph G with diameter two such that γ_a(G)-δ(G)?k.