主理想整环上n阶矩阵环中的Goldbach问题

Abstract: In this paper, we consider the Goldbach's problem for matrix rings, namely, we decompose an n ×n (n > 1) matrix over a principal ideal domain R into a sum of two matrices in Mn(R) with given determinants. We prove the following result: Let n > 1 be a natural number and A = (αij) be a matrix in Mn(R). Define d(A) := g.c.d{αij}. Suppose that p and q are two elements in R. Then (1) If n > 1 is even, then A can be written as a sum of two matrices X, Y in Mn(R) with det(X) = p and det(Y) = q if and only if d(A) |p-q; (2) If n > 1 is odd, then A can be written as a sum of two matrices X, Y in Mn(R) with det(X) = p and det(Y) = q if and only if d(A) |p + q. We apply the result to the matrices in Mn(Z) and Mn(Q[x]) and prove that if R = Z or Q[x], then any nonzero matrix A in Mn(R) can be written as a sum of two matrices in Mn(R) with prime determinants.     

关于H-cordial图和semi-H-cordial图的若干结论（英文）

I. Cahit calls a graph H-cordial if it is possible to label the edges with the numbers from the set{1,-1} in such a way that, for some k, at each vertex v the sum of the labels on the edges incident with v is either k or-k and the inequalities |v(k)-v(-k)| ≤ 1 and|e(1)-e(-1)| ≤ 1 are also satisfied. A graph G is called to be semi-H-cordial, if there exists a labeling f, such that for each vertex v, |f(v)| ≤ 1, and the inequalities |e_f(1)-e_f(-1)| ≤ 1 and |vf(1)-vf(-1)| ≤ 1 are also satisfied. An odd-degree(even-degree) graph is a graph that all of the vertex is odd(even) vertex. Three conclusions were proved:(1) An H-cordial graph G is either odd-degree graph or even-degree graph;(2) If G is an odd-degree graph, then G is H-cordial if and only if |E(G)| is even;(3) A graph G is semi-H-cordial if and only if |E(G)| is even and G has no Euler component with odd edges.     

Regular n-simplices in R~n with vertices in Z~n

In this paper the Ⅰ and Ⅱ regular n-simplices are introduced. We prove that the sufficient and necessary conditions for existence of an Ⅰ regular n-simplex in Rn are that if n is even then n = 4m(m + 1), and if n is odd then n = 4m + 1 with that n + 1 can be expressed as a sum of two integral squares or n = 4m - 1, and that the sufficient and necessary condition for existence of a Ⅱ regular n-simplex in Rn is n = 2m2 - 1 or n = 4m(m+1)(m 6 N). The connection between regulars-simplex in Rn and combinational design is given.     

NOTES ON GLAISHER＇S CONGRUENCES

Let p be an odd prime and let n≥1,k≥0 and r be integers,denote by Bk the kth Bernoulli number,It is proved that(i) If r≥1 is odd and suppose 1≥r+4,then ∑j=1^p-1 1/(np+j)^r=-(2n+1)r(r+1)/2(r+2)Bp-r-2p^2(mod p^3).(ii)If r≥2 is even and suppose p≥r+3, then p-1∑j=1 1/(np+j)^r=r/r+1Bv-r-1p(mod P^2).(iii) p-1∑j=1 1/(np+j)p-2=-(2n+1)p(mod P^2).This result generalizes the Glaisher‘s congruence. As a corollary, a generalization of the Wolsten-holme‘s theorem is obtained.     

INDEPENDENT-SET-DELETABLE FACTOR-CRITICAL POWER GRAPHS

It is said that a graph G is independent-set-deletable factor-critical (in short, ID-factor-critical), if, for every independent set 7 which has the same parity as |V(G)|, G-I has a perfect matching. A graph G is strongly IM-extendable, if for every spanning supergraph H of G, every induced matching of H is included in a perfect matching of H. The k-th power of G, denoted by Gk, is the graph with vertex set V(G) in which two vertices are adjacent if and only if they have distance at most k in G. ID-factor-criticality and IM-extendability of power graphs are discussed in this article. The author shows that, if G is a connected graph, then G3 and T(G) (the total graph of G) are ID-factor-critical, and G4 (when |V(G)| is even) is strongly IM-extendable; if G is 2-connected, then D2 is ID-factor-critical.     

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.     

A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable

A total k-coloring of a graph G is a coloring of V(G) ∪ E(G) using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ'(G) is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree Δ≥ 9, then χ'(G) = Δ + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then χ'(G) = 9.     

GCD和GCUD矩阵行列式的一个不等式（英）

Let S = {x₁, x₂,..., x_n} be a set of distinct positive integers. The n x n matrix (S) whose i, j-entry is the greatest common divisor (x_i, x_j) of x_i and x_j is called the GCD matrix on S. A divisor d of x is said to be a unitary divisor of x if (d, x/d) = 1. The greatest common unitary divisor (GCUD) matrix (S^**) is defined analogously. We show that if S is both GCD-closed and GCUD-closed, then det(S^**) ≥ det(S), where the equality holds if and Only if (S^**) = (S).     

Stability of Periodic Orbits and Return Trajectories of Continuous Multi-valued Maps on Intervals

Let I be a compact interval of real axis R, and(I, H) be the metric space of all nonempty closed subintervals of I with the Hausdorff metric H and f : I → I be a continuous multi-valued map. Assume that Pn =(x_0, x_1,..., xn) is a return tra jectory of f and that p ∈ [min Pn, max Pn] with p ∈ f(p). In this paper, we show that if there exist k(≥ 1) centripetal point pairs of f(relative to p)in {(x_i; x_i+1) : 0 ≤ i ≤ n-1} and n = sk + r(0 ≤ r ≤ k-1), then f has an R-periodic orbit, where R = s + 1 if s is even, and R = s if s is odd and r = 0, and R = s + 2 if s is odd and r 0. Besides,we also study stability of periodic orbits of continuous multi-valued maps from I to I.     

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

坡上矩阵可逆的条件

坡S是一个元素满足条件s 1=1的交换半环．证明了坡S上n×n矩阵A可逆当且仅当∑k=1 n aik=1(i=1,2,…,n)且aikajk=0(i≠j,k=1,2,…,n)．在坡S中可定义补元,得到S上每一个可逆矩阵是一个置换矩阵当且仅当S不包含不同于0和1的有补元．     

On Suzuki's characterization ofPGL(2,2 f )

A character theoretic result of W. Feit asserts, that if G is a Zassenhaus group of odd degree n+1, then n=2^for some f>0. Using this result, M. Suzuki proved the following two results.Theorem 1 Let G be a Zassenhaus group of odd degree n+1. tThen G=PGL(2, 2^f) if and only if j=g^* in the structure equation of G.Theorem 2 Suppose that G is a Zassenhaus group of odd degree n+1 and of order (n+1)nd. If 3 divides d, then G=PGL(2, 2^f).We give an elementary proof of these theorems, avoiding the use of Feit's result.     

一类非线性微分方程空间周期解的存在性及唯一性

利用Bendixson-Dulac定理,讨论系统     

有限个互素因子链上幂GCD矩阵与幂LCM矩阵的行列式的整除性

设S={x1,x2,...,xn}是由n个不同的正整数组成的集合,并设a为正整数.如果一个n阶矩阵的第i行j列元素是S中元素xi和xj的最大公因子的a次幂(xi,xj)a,则称该矩阵为定义在S上的a次幂最大公因子(GCD)矩阵,用(Sa)表示;类似定义a次幂LCM矩阵[Sa].如果存在{1,2,...,n}上的一个置换σ使得xσ(1)|xσ(2)|···|xσ(n),则称S为一个因子链.如果存在正整数k,使得S=S1∪S2∪···∪Sk,其中每一个Si(1ik)均为一个因子链,并且对所有的1i=jk,Si中的每个元素与Sj中的每个元素互素,则称S由有限个互素因子链构成.本文中,设S由有限个互素的因子链构成,并且1∈S.我们首先给出幂GCD矩阵与幂LCM矩阵的行列式的公式,然后证明:如果a|b,则det(Sa)|det(Sb),det[Sa]|det[Sb],det(Sa)|det[Sb].最后我们指出:如果构成S的有限个因子链不互素,则此结论一般不成立.     

广义逆矩阵的张量积

本文证明了广义逆矩阵张量积的一些性质,介绍了它在解线性方程组方面的应用,并得到了矩阵张量积的奇异值的一些性质     

Smarandache函数在两数列上的下界估计

设S(n)是Smarandache函数,其中n是一正整数.讨论Smarandache函数S(n)在数列F((2k),1)=F(n,1)=n2n+1(n=2k)与数列G(2n,1)=(2n)2n+1上的下界估计.基于初等方法证明了:当偶数n≥6时,有S(F((2k),1))=S(F(n,1))≥6×2n+1;当n≥4时,有S(G(2n,1))≥6×2n+1.     

具有矩阵伸缩的双正交小波基

在这篇文章里,我们研究了伸缩为矩阵的双正交小波基的构造问题,在适当条件下,我们得到了Ｌ~２（Ｒ~ｎ）的小波框架或双正交小波基｛ｓｊ,ｋ｝和｛ｓｊ,ｋ｝,其中ｓｊｋ（ｘ）＝ｄｅｔＡｓ（Ａｊｘ－ｋ）,ｓｊ,ｋ（ｘ）＝ｄｅｔＡｊ２ｓ（Ａｊｘ－ｋ）（ｊ Ｚ． ｋ Ｚ~ｎ）及 Ａ是一伸缩矩阵．     

三次幻方的构作

给出2k维m阶t次幻方及m模方阵,m模列满秩矩阵,模线,m经典模线集和t次m模基因阵的概念,并用矩阵法和组合法初步研究了t次幻方特别是三次幻方的构作.证明:(i)若存在2k阶t次m模基因阵,则存在2k维m阶t次幻方;(ii)若N=P1α1P2α2…PSαS为N的标准分解式,iα≥3,Piiα≥16(1≤i≤S),则存在二维N阶三次幻方;(iii)若存在二维偶m阶2t+1次幻方和二维n阶2t次幻方,则存在二维mn阶2t+1次幻方;(iv)若存在二维m阶和n阶t次幻方,则存在二维mn阶t次幻方;(v)当t≥3时,不存在二维单偶数阶t次幻方.