The Formula of General Term of the Sum of Equal Powers of Natural Numbers

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＴｏｆｉｎｄｔｈｅｇｅｎｅｒａｌｔｅｒｍｆｏｒｍｕｌａｏｆｃａｌｃｕｌａｔｉｎｇｗａｓａｎｏｌｄｅｓｔｐｒｏｂｌｅｍｉｎＮｕｍｂｅｒＴｈｅｏｒｙ．Ｅａｒｌｙｉｎ３００Ｂ．Ｃ．,Ａｒｃｈｉｍｅｄｏ,ｔｈｅｍａｔｈｅｍａｔｉｃｉａｎｏｆａｎｃｉｅｎｔＧｒｅｅｃｅ,ｗｏｒｋｅｄｏｕｔｔｈｅｆｏｒｍｕｌａ∑ｎｋ＝１ｋ＝ｎ（ｎ＋１）２ａｎｄ∑ｎｋ＝１ｋ２＝ｎ（ｎ＋１）（２ｎ＋１）６．Ｓｏｆａｒ,ｐｅｏｐｌｅｈａｖｅｇｏｔｍａｎｙｆｏｒｍｓｏｆｅｐｒｅｓｓｉｏｎｏｆｔｈｅｇｅ…     

一类K_n－E（G）型图的色唯一性

设Ｋｍ－Ｅ（Ｇ）表示从完全图Ｋｍ中删去一个和Ｇ同构的子图的所有边而得到的图．本文证明了，当Ｇ＝ｋ１Ｐｓ１∪ｋ２ＰＳ２∪…∪ｋｒＰｓｒ，（ｓｉ＞１，ｓｉ≠４，ｉ＝１，２，…，ｒ），且Ｐｓｉ都是不可约路时，图Ｋｍ－Ｅ（Ｇ）是色唯一的．     

自然数方幂和的一个性质的证明

自然数方幂和的一个性质的证明湖南浏阳十一中刘会成令Ｓｋ（ｎ）＝１ｋ＋２ｋ＋…＋ｎｋ（ｋ≥０，ｋ∈Ｚ）．文［１］，［２］，［３］均提到下面一个性质：Ｓ２ｋ（Ｎ）＝Ｓ２（ｎ）Ｐ２（ｎ）（ｉ）Ｓ２ｋ＋１（ｎ）＝Ｓ２１（ｎ）Ｐ１（ｎ）（ｉｉ）其中ｋ为自然数，...     

关于直积C↑→n1×C↑→n2×…×C↑→nk的哈密顿圈及哈密顿分解

设ｎ１≤ｎ２≤…≤ｎｋ是正整数，Ｄ＝Ｃ↑→ｎ１×Ｃ↑→ｎ２×…×Ｃ↑→ｎｋ是有向圈的直积。在本文中，我们证明了如果ｎｉ│ｎｋ（１≤ｉ≤ｋ－１），则Ｄ含有哈密根图。当ｎ１＝ｎ２＝…＝ｎｋ时，我们进一步得到Ｄ含有［ｋ／２」个弧不交的哈密顿圈。作为副产品，我们推出当Γ是哈密顿有向图时Γ×Γ也是哈密顿有向图。     

不等式研究成果集锦(2)

１３．设ｓ、ｔ是两个非零实数,对正整数ｒ＝１,２,…,ｎ－１,定义ｎ元正实数组ａ＝（ａ１,ａ２,…,ａｎ）和正权数组λ＝（λ１,λ２,…,λｎ）的一类加权对称平均　Ｐｒ（ａ,λ;ｓ,ｔ）＝∑１≤ｉ１＜…＜ｉｒ≤ｎ（∑ｎｋ＝１λｎ－∑ｒｊ＝１λｉｊ）（ｒ－１∑ｒｊ＝１ａｓｉｊ）ｔｓＣｒｎ－１∑ｎｋ＝１λｋ１ｔ,则对ｒ＝１,２,…,ｎ－２,当ｓ＜ｔ时,有Ｐｒ（ｒ,λ;ｓ,ｔ）≥Ｐｒ＋１（ｒ,λ;ｓ,ｔ）;当ｓ＞ｔ时,上边不等式反号．（张志华,肖振纲,１９９８,３）１４．△ＡＢＣ三边长分别为ａ、ｂ、ｃ…     

图K_n-E(k_0P_3(∪ri=1k_iP(q_i-1)))的色唯一性

记δｎ＝ｋ≤ｎｋｎ－ｋ，在本文中证明了：ｒ∈Ｎ，若ｉ∈｛１，２，…，ｒ｝，ｑｉ（＞５）都是素数，并且［（δｑｉ－１－１）！＋１］／δｑｉ－１是正整数，则图簇Ｋｎ－Ｅｋ０Ｐ３∪ｋ１Ｐｑ１－１∪ｋ２Ｐｑ２－１∪…∪ｋｒＰｑｒ－１是色唯一的，推广了文［１］的结果     

一维齐次Cantron集的Hausdorff维数

设｛ｎｋ，ｋ１｝为一正整数序列，｛ｃｋ，ｋ１｝为一正实数序列，满足ｎｋ２，０＜ｃｋ＜１，ｎｋｃｋ１．设Ｅ为由｛ｎｋ，ｋ１｝，｛ｃｋ，ｋ１｝定义的齐次Ｃａｎｔｏｒ集．本文证明集Ｅ的Ｈａｕｓｄｏｒｆ维数为ｄｉｍＨＥ＝ｌｉｍｋ→∞ｌｏｇｎ１ｎ２…ｎｋ－ｌｏｇｃ１ｃ２…ｃｋ     

ERDS-RE''''NYI大数律下自正则的效用

｛Ｘ，Ｘｉ，ｉ≥１｝是ｉ．ｉ．ｄ．ｒ．ｖ′．ｓ．在矩母函数存在的条件下，由古典的Ｅｒｄｏｓ－Ｒéｎｙｉ大数律有ｌｉｍｎ→∞ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ［ｃｌｏｇｎ］＝α（ｃ），α（ｃ）为某常数．自正则下ＭｉｋｌóｓＣｓｏｒｇｏ＆ＳｈａｏＱｉｍａｎ（１９９４）在仅要求一阶矩的条件下就得到了：ｌｉｍｎ→∞ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１（Ｘ２ｉ＋１）＝β（ｃ），β（ｃ）为某常数．众所周知，自正则下人们往往在较弱条件下取得相应结果是因为：分母中的Ｘ能有效抵销分子中Ｘ较大而引起整个分式极限行为的波动．因此，在什么样的条件下，式ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘ２ｉ１－β［ｃｌｏｇｎ］β→ｒ（ｃ）成为非常有意思的问题，因为它将依赖于β的大小．本文给出，当０＜β≤１２时，只要Ｅ（Ｘ）≥０，上式就有有限极限．当１２＜β＜１时，则必须在矩母函数存在下，上式才有有限极限．并都求出了其极限表达式．     

一类线性errors－in－variables模型的参数强相合估计及其a．s．收敛速度

本文讨论了如下一类线性ｅｒｒｏｒｓ－ｉｎ－ｖａｒｉａｂｌｅｓ模型——多元线性结构关系模型β′ｘｋ＋α＝０，ξｋ＝ｘｋ＋εｋ．｛ｋ＝１，２，…，ｎ．其中，｛ｘｋ：ｋ＝１，２，…，ｎ｝为一组ｉ．ｉ．ｄ．的ｍ维随机向量，｛εｋ：ｋ＝１，２，…，ｎ｝是ｉ．ｉ．ｄ．的随机误差，Ｅ（ε１）＝０，Ｖａｒ（ε１）＝σ２Ｉｍ．且｛ｘｋ：ｋ＝１，２，…，ｎ｝与｛εｋ：ｋ＝１，２，…，ｎ｝相互独立．在一些条件下，我们证明了估计量β，α，σ２的强相合性、唯一性，并给出了估计量的收敛速度为ｏ（ｎ－１－１ｑ），这里ｑ∈［１，２）．对于Ｅ（ｘ１）ｕ１和Ｖａｒ（ｘ１）Ｖｘ的估计也得出了同样的结果     

截断和的弱大数律

投｛Ｘｎ，ｎ≥１｝ｉ．ｉ．ｄ．，Ｘｎ，１≤Ｘｎ，２≤…≤Ｘｎ，ｎ是Ｘ１，Ｘ２，…，Ｘｎ的次序统计量．对非负整数ｋ，ｒ，ｋ＋ｒ≤ｎ，令．本文研究当ｋ＝ｋｎ，ｒ＝ｒｎ满足ｍｉｎ（ｋ，ｒ）→∞，ｍａｘ（ｋ，ｒ）→０时截断和Ｓｎ（ｋ，ｒ）的弱大数律．设βｎ＞０，Ｃｎ∈Ｒ，文中给出了依概率收敛的充要条件．     

两类K_4同胚图的色唯一性

用k4(a ,b ,c ,d ,e,f)表示k4 同胚图 ,其中a ,b ,c ,d ,e,f分别表示度为 3的顶点间的道路的长 .本文主要研究了两类k4 同胚图的色唯一性 ,同时得到了几族新的不是色唯一的k4 同胚图     

Chromatic equivalence classes of complete tripartite graphs

Some necessary conditions on a graph which has the same chromatic polynomial as the complete tripartite graph K_m,n,r are developed. Using these, we obtain the chromatic equivalence classes for K_m,n,n (where 1≤m≤n) and K_m1,m2,m3 (where |m_i−m_j|≤3). In particular, it is shown that (i) K_m,n,n (where 2≤m≤n) and (ii) K_m1,m2,m3 (where |m_i−m_j|≤3, 2≤m_i,i=1,2,3) are uniquely determined by their chromatic polynomials. The result (i), proved earlier by Liu et al. [R.Y. Liu, H.X. Zhao, C.Y. Ye, A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs, Discrete Math. 289 (2004) 175-179], answers a conjecture (raised in [G.L. Chia, B.H. Goh, K.M. Koh, The chromaticity of some families of complete tripartite graphs (In Honour of Prof. Roberto W. Frucht), Sci. Ser. A (1988) 27-37 (special issue)]) in the affirmative, while result (ii) extends a result of Zou [H.W. Zou, On the chromatic uniqueness of complete tripartite graphs K_n1,n2,n3 J. Systems Sci. Math. Sci. 20 (2000) 181-186].     

On the chromaticity of complete multipartite graphs with certain edges added

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. For integers k≥0, t≥2, denote by K((t−1)×p,p+k) the complete t-partite graph that has t−1 partite sets of size p and one partite set of size p+k. Let K(s,t,p,k) be the set of graphs obtained from K((t−1)×p,p+k) by adding a set S of s edges to the partite set of size p+k such that 〈S〉 is bipartite. If s=1, denote the only graph in K(s,t,p,k) by K⁺((t−1)×p,p+k). In this paper, we shall prove that for k=0,1 and p+k≥s+2, each graph G∈K(s,t,p,k) is chromatically unique if and only if 〈S〉 is a chromatically unique graph that has no cut-vertex. As a direct consequence, the graph K⁺((t−1)×p,p+k) is chromatically unique for k=0,1 and p+k≥3.     

关于K4同胚图色唯一性的几个新结果

本文证得:如果i,j,k,l,m,n中有四个数相等,而另外二个数不小于此数,则K_4(i,j,k,l,m,n)是色唯一的.此外,我们还得到了另外两族具有色唯一性的K_4同胚图.     

The chromatic number of 5-valent circulants

A circulant C(n;S) with connection set S={a₁,a₂,…,a_m} is the graph with vertex set Z_n, the cyclic group of order n, and edge set E={{i,j}:|i−j|∈S}. The chromatic number of connected circulants of degree at most four has been previously determined completely by Heuberger [C. Heuberger, On planarity and colorability of circulant graphs, Discrete Math. 268 (2003) 153-169]. In this paper, we determine completely the chromatic number of connected circulants C(n;a,b,n/2) of degree 5. The methods used are essentially extensions of Heuberger’s method but the formulae developed are much more complex.     

Chromatic coloring with a maximum color class

Let G be any graph, and also let Δ(G), χ(G) and α(G) denote the maximum degree, the chromatic number and the independence number of G, respectively. A chromatic coloring of G is a proper coloring of G using χ(G) colors. A color class in a proper coloring of G is maximum if it has size α(G). In this paper, we prove that if a graph G (not necessarily connected) satisfies χ(G)≥Δ(G), then there exists a chromatic coloring of G in which some color class is maximum. This cannot be guaranteed if χ(G)<Δ(G). We shall also give some other extensions.     

Distance graphs with maximum chromatic number

The distance graph G(D) has the set of integers as vertices and two vertices are adjacent in G(D) if their difference is contained in the set D⊂Z. A conjecture of Zhu states that if the chromatic number of G(D) achieves its maximum value |D|+1 then the graph has a triangle. The conjecture is proven to be true if |D|?3. We prove that the chromatic number of a distance graph with D={a,b,c,d} is five only if either D={1,2,3,4k} or D={a,b,a+b,b-a}. This confirms a stronger version of Zhu's conjecture for |D|=4, namely, if the chromatic number achieves its maximum value then the graph contains K₄.     

Specht modules and chromatic polynomials

An explicit formula for the chromatic polynomials of certain families of graphs, called bracelets', is obtained. The terms correspond to irreducible representations of symmetric groups. The theory is developed using the standard bases for the Specht modules of representation theory, and leads to an effective means of calculation.