二元叠加码M(m,k,d)的平均汉明距离和均方差

根据二元叠加码(Binary Superimposed Code)M(m,k,d)的定义及完全图K_(2m)的性质,研究了M(m,k,d)码的平均汉明(Hamming)距离和它的均方差问题,给出了它们的计算公式.     

几类特殊图的(2,1)-全标号

研究了与频道分配有关的一种染色-(p,1)-全标号.通过在一个顶点粘结不同的简单图构造了几类有趣图,根据所构造图的特征,利用穷染法,给出了一种标号方法,得到了平凡和非平凡叶子图Gm,4、风车图K3t和图Dm,n的(2,1)-全标号数.(p,1)-全标号是对图的全染色的一种推广.     

黎曼曲面上的&Phi|-调和函数和&Phi|-次调和函数

(M, g)是黎曼曲面,该文给出了M上函数的Φ- Dirichlet积分的定义,并在此基础上得到了一个关于具有有限的Φ - Dirichlet积分的Φ -次调和函数的有界性定理.     

QK乘子代数上的Corona定理和Wolff定理

本文给出对数K-Carleson测度的一个新特征,并以此为工具研究Q_K空间的乘子代数M(Q_K),给出乘子代数M(Q_K)的某些特征描述.利用对数K-Carleson测度及Q_K空间的一个新特征,建立乘子代数M(Q_K)上的Corona定理和Wolff定理.     

求函数值域的一般方法

关于函数值域的确定,是统编高中数学教材中的一个难点。学生作题通常没有一般方法可循,并且容易出现混乱和错误。本文拟给出求初等函数值域的一般方法。下面我们提出三个定理,为尽量避免使用较多的实数理论,仅用几何图形加以直观说明,不给出严格论证。然后归纳出只需运用简单的导数知识,对中学生可行的初等函数值域的一般方法。定理1 若函数y=f(x)满足条件 (1)、在闭区间〔a,b〕上连续; (2),最大值、最小值分别为M,m,则函数y=f(x)的值域为〔m,M〕。(其中mM) 定理1中,M、m的存在性与结论的正确性从函数图象(图1)上看是很明显的。例1,求函数f(x)=x~2-5x+6,x∈〔2,     

折弦定理——研究性学习的一个好课题

折弦定理 如果AB和BC组成一条☉O的折弦(BC>AB),如图1,M为(ABC)的中点,则从点M向BC作垂线的垂足D是折弦ABC的中点. 这个定理也叫阿基米德折弦定理,大多数学生都能利用对称变换(或截取)给出如下证明.     

关于图的余树的奇连通分支数的内插定理

本文研究了连通图的余树的奇连通分支数与其可定向嵌入的关系.我们先给出了关于连通图的余树的奇连通分支数的内插定理.作为其应用,我们推广了Xuong和刘彦佩关于图的最大亏格的计算公式,并且证明了如下结果:任意一个连通图G一定满足下列条件之一: (a)对于任意的满足γ(G)≤g≤γM(G)整数g,只要图G嵌入到可定向曲面Sg上,就存在支撑树T,使g-1/2β(G)-ω(T)),其中,γ(G)与γM(G)分别是图G的最小和最大亏格,β(G)与ω(T)分别是图G的Betti数和由T确定的余树的奇连通分支数; (b)对连通图G的任意一个支撑树T,G可以嵌入某个可定向曲面上使其恰好有ω(T) 1个面.特别地,我们给出了所有非平面的3-正则的Hamilton图G所嵌入的可定向曲面的亏格的计算公式.     

圆锥曲线间的相互变换

文 [1 ]中给出了圆锥曲线间的几个有趣变换 ,并作了推广 .笔者经过深入研究发现 ,文 [1 ]中的定理还可以进一步推广到更一般的情形 ,而且有趣的是 ,圆锥曲线间可以相互变换 ,由一种圆锥曲线可以生成所有的各种圆锥曲线 .定理 1　设椭圆c:x2a2 +y2b2 =1 (a >b >0 ) ,PP′是c上的垂直于x轴的一条弦 ,M(m ,0 ) ,N(n ,0 )是x轴上的两点 ,设直线PM与P′N的图 1　定理 1图交点Q的轨迹为c′ .则1 )当 (m +n) 2 - 4a2>0时 ,c′为椭圆或圆 ;2 )当 (m +n) 2 - 4a2= 0时 ,c′为抛物线 ;3)当 (m +n) 2 - 4a2<0时 ,c′为双曲线 .证　设P (acost,bsint…     

黎曼曲面上的φ-调和函数和φ-次调和函数

(M,g)是黎曼曲面,该文给出了M上函数的φ-Dirichlet积分的定义,并在此基础上 得到了一个关于具有有限的φ-Dirichlet积分的φ-次调和函数的有界性定理．     

折弦定理——研究性学习的一个好课题

折弦定理如果AB和BC组成一条圆O的折弦(BC>AB),如图1,M为ABC的中点,则从点M向BC作垂线的垂足D是折弦ABC的中点. 这个定理也叫阿基米德折弦定理,大多数学生都能利用对称变换(或截取)给出如下证明.     

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles

Every planar graph is known to be acyclically 7-choosable and is conjectured to be acyclically 5-choosable (Borodin et al. 2002) [7]. This conjecture if proved would imply both Borodin’s acyclic 5-color theorem (1979) and Thomassen’s 5-choosability theorem (1994). However, as yet it has been verified only for several restricted classes of graphs.Some sufficient conditions are also obtained for a planar graph to be acyclically 4-choosable and 3-choosable. In particular, acyclic 4-choosability was proved for the following planar graphs: without 3-cycles and 4-cycles (Montassier, 2006 [23]), without 4-cycles, 5-cycles and 6-cycles (Montassier et al. 2006 [24]), and either without 4-cycles, 6-cycles and 7-cycles, or without 4-cycles, 6-cycles and 8-cycles (Chen et al. 2009 [14]).In this paper it is proved that each planar graph with neither 4-cycles nor 6-cycles adjacent to a triangle is acyclically 4-choosable, which covers these four results.     

关于平面图(3,1)~*-可选性的一个注记(英文)

给出了平面图的一个结构性定理,并证明了每个没有5-圈,相邻三角形,相邻四边形的平面图是(3,1)*-可选色的.     

关于平面图（3，1）＊-可选性的一个注记

给出了平面图的一个结构性定理,并证明了每个没有5-圈,相邻三角形,相邻四边形的平面图是（3,1）＊-可选色的．     

Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12

Every planar graph is known to be acyclically 7-choosable and is conjectured to be acyclically 5-choosable (O. V. Borodin et al., 2002). This conjecture if proved would imply both Borodin’s acyclic 5-color theorem (1979) and Thomassen’s 5-choosability theorem (1994). However, as yet it has been verified only for several restricted classes of graphs. Some sufficient conditions are also obtained for a planar graph to be acyclically 4- and 3-colorable. In particular, a planar graph of girth at least 7 is acyclically 3-colorable (O. V. Borodin, A. V. Kostochka and D. R. Woodall, 1999) and acyclically 3-choosable (O. V. Borodin et. al, 2009). A natural measure of sparseness, introduced by Erdős and Steinberg, is the absence of k-cycles, where 4 ≤ k ≤ S. Here, we prove that every planar graph without cycles of length from 4 to 12 is acyclically 3-choosable.     

无8-,9-和10-圈的平面图的3-可选择性

寻找平面图是3-或者4-可选择的充分条件是图的染色理论中一个重要研究课题,本文研究了围长至少是4的特殊平面图的选择数,通过权转移的方法证明了每个围长至少是4且不合8-圈,9-圈和10-圈的平面图是3-可选择的．     

3-list-coloring planar graphs of girth 4

In Thomassen (1995) [4], Thomassen proved that planar graphs of girth at least 5 are 3-choosable. In Li (2009) [3], Li improved Thomassen’s result by proving that planar graphs of girth 4 with no 4-cycle sharing a vertex with another 4- or 5-cycle are 3-choosable. In this paper, we prove that planar graphs of girth 4 with no 4-cycle sharing an edge with another 4- or 5-cycle are 3-choosable. It is clear that our result strengthens Li’s result.     

A structural theorem on embedded graphs and its application to colorings

In this paper, a Lebesgue type theorem on the structure of graphs embedded in the surface of characteristic σ≤ 0 is given, that generalizes a result of Borodin on plane graphs. As a consequence, it is proved that every such graph without i-circuits for 4 ≤ i ≤ 11 - 3σ is 3-choosable, that offers a new upper bound to a question of Y. Zhao.     

Acyclic improper choosability of graphs

We consider improper colorings (sometimes called generalized, defective or relaxed colorings) in which every color class has a bounded degree. We propose a natural extension of improper colorings: acyclic improper choosability. We prove that subcubic graphs are acyclically (3, 1)*-choosable (i.e. they are acyclically 3-choosable with color classes of maximum degree one). Using a linear time algorithm, we also prove that outerplanar graphs are acyclically (2, 5)*-choosable (i.e. they are acyclically 2-choosable with color classes of maximum degree five). Both results are optimal. We finally prove that acyclic choosability and acyclic improper choosability of planar graphs are equivalent notions.     

Choosability of K5-minor-free graphs

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all K₅-minor-free graphs are 5-choosable.