K2,4×Sn的交叉数

Garey和Johnson证明了确定图的交叉数是一个NP-完全问题.确定了笛卡尔积图$K_{2,4}\times S_{n}$的交叉数是$Z(6,n)+4n.$ 当$m\geq 5,$猜想${\rm cr}(K_{2,m}\timesS_{n})={\rm cr}(K_{2,m,n})+n\lfloor\frac{m}{2}\rfloor\lfloor\frac{m-1}{2}\rfloor$.     

ON THE CROSSING NUMBER OF THE COMPLETE TRIPARTITE GRAPH K1,8,n

The well known Zarankiewicz' conjecture is said that the crossing number of the complete bipartite graph K_m,n (m≤ n) is Z(m,n), where Z(m,n)=\lfloor\frac{m}{2}\rfloor\lfloor\frac{m-1}{2}\rfloor\lfloor\frac{n}{2}\rfloor$\lfloor\frac{n-1}{2}\rfloor$ (for any real number x, $\lfloor x\rfloor$ denotes the maximal integer no more than x). Presently, Zarankiewicz' conjecture is proved true only for the case m≤ 6. In this article, the authors prove that if Zarankiewicz' conjecture holds for m≤9, then the crossing number of the complete tripartite graph K_1,8,n is $Z(9, n)+ 12\lfloor\frac{n}{2}\rfloor$.     

$K_{5}\times S_{n}$ 的交叉数

把完全图$K_{5}$的五个顶点与另外$n$个顶点都联边得到一类特殊的图$H_{n}$.文中证明了$H_{n}$的交叉数为$Z(5,n)+2n+\lfloor \frac{n}{2}\rfloor+1$,并在此基础上证明了$K_{5}$与星$K_{1,n}$的笛卡尔积的交叉数为$Z(5,n)+5n+\lfloor\frac{n}{2} \rfloor+1$.     

$L^{p}_{[0,1]}$空间M\"{u}ntz有理逼近的Jackson型估计 (英)

设$\Lambda=\{\lambda_{n}\}_{n=1}^{\infty}$为正的实数数列, 且当$n\rightarrow\infty$时, 有$\lambda_{n}\searrow 0$.本文给出了当 $\lambda_{n}\leq Mn^{-\frac{1}{2}},\;n=1,2, \cdots ,$(其中$M>0$为一正常数)时M\"{u}ntz系统$\{x^{\lambda_n}\}$的有理函数在$ L_{[0,1]} ^{p}$空间的逼近速度,主要结论为$R_{n} (f, \Lambda )_{L^{p}}\leq C_M \omega (f, n^{-\frac{1}{2}})_{L^{p}},\;1 \leq p \leq \infty.$     

Zygmund微分映射的正则点

该文的主要结果是: 对任意Zygmund类$C^{p,Z}$映射$f:R^{n}\rightarrow R^{m}$, 若$\frac{n-m}{2}\leq p\leq n-m-1$, 则有mes$K_{f}>0$或者mes$C_{f}>0$. 这个结果给出了Hirsch问题的部分回答.     

双曲空间中完备子流形的特征值估计

研究了$(n+p)$维双曲空间$\mathbb{H}^{n+p}$中完备非紧子流形的第一特征值的上界.特别地,证明了$\mathbb{H}^{n+p}$中具有平行平均曲率向量$H$和无迹第二基本形式有限$L^q(q\geq n)$范数的完备子流形的第一特征值不超过$\frac{(n-1)^2(1-|H|^2)}{4}$,和$\mathbb{H}^{n+1}(n\leq5)$中具有常平均曲率向量$H$和无迹第二基本形式有限$L^q(2(1-\sqrt{\frac{2}{n}})相似文献   

不含某些子图的k连通图中的k可收缩边

最近Ando等证明了在一个$k$($k\geq 5$ 是一个整数) 连通图 $G$ 中,如果 $\delta(G)\geq k+1$, 并且 $G$ 中既不含 $K^{-}_{5}$,也不含 $5K_{1}+P_{3}$, 则$G$ 中含有一条 $k$ 可收缩边.对此进行了推广,证明了在一个$k$连通图$G$中,如果 $\delta(G)\geq k+1$,并且 $G$ 中既不含$K_{2}+(\lfloor\frac{k-1}{2}\rfloor K_{1}\cup P_{3})$,也不含 $tK_{1}+P_{3}$ ($k,t$都是整数,且$t\geq 3$),则当 $k\geq 4t-7$ 时, $G$ 中含有一条 $k$ 可收缩边.     

Powers of the Catalan Generating Function and Lagrange''s 1770 Trinomial Equation Series

The Catalan numbers $1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862,\ldots$ are given by $C(n)=\frac{1}{n+1}\binom{2n}{n}$ for $n\geq 0$. They are named for Eugene Catalan who studied them as early as 1838. They were also found by Leonhard Euler (1758), Nicholas von Fuss (1795), and Andreas von Segner (1758). The Catalan numbers have the binomial generating function $$\mathbf{C}(z) = \sum_{n=0}^{\infty}C(n)z^n = \frac{1 - \sqrt{1-4z}}{2z}$$ It is known that powers of the generating function $\mathbf{C}(z)$ are given by $$\mathbf{C}^a(z) = \sum_{n=0}^{\infty}\frac{a}{a+2n}\binom{a+2n}{n}z^n.$$ The above formula is not as widely known as it should be. We observe that it is an immediate, simple consequence of expansions first studied by J. L. Lagrange. Such series were used later by Heinrich August Rothe in 1793 to find remarkable generalizations of the Vandermonde convolution. For the equation $x^3 - 3x + 1 =0$, the numbers $\frac{1}{2k+1}\binom{3k}{k}$ analogous to Catalan numbers occur of course. Here we discuss the history of these expansions. and formulas due to L. C. Hsu and the author.     

Clifford 环面 Sm(\sqrt{\frac{m}{n}})×Sn-m(\sqrt{\frac{n-m}{n}})的刚性定理

\small\zihao{-5}\begin{quote}{\heiti 摘要:} 设$M$为$n+1$维单位球面$S^{n+1}(1)$中的一个极小闭超曲面，如果 $ n \le S \le n+\frac{2}{3}$, 则有 $S=n$ 且 $M$ 与某一Clifford 环面 $S^m(\sqrt{m/n}) \times S^{n-m}(\sqrt{(n-m)/n})$等距.     

五阶图与星图的笛卡尔积交叉数

In this paper, we compute the crossing number of a specific graph Hn, and then by contraction, we obtain the conclusion that cr（G13 × Sn） = 4[n/2] [n-1/2]＋[n/2] . The result fills up the blank of the crossing numbers of Cartesian products of stars with all 5-vertex graphs presented by Marian Klesc.     

一个特殊6点图Q与nK_1,P_n及C_n的联图交叉数

图的交叉数是图的一个重要参数,研究图的交叉数问题是拓扑图论中的前沿难题.确定图的交叉数是NP-难问题,因为其难度,能够确定交叉数的图类很少.通过圆盘画法途径,确定了一个特殊6点图与n个孤立点nK_1,路P_n及圈C_n的联图的交叉数分别是cr(Q+nK_1)=Z(6,n)+2[n/2],cr(Q+P_n)=Z(6,n)+2[n/2]+1及cr(Q+C_n)=Z(6,n)+2[n/2]+3.     

On the Crossing Number of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> □ <Emphasis Type="Italic">P</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing number of the Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(K_m □ P_n), the crossing number of the Cartesian product K_m □ P_n. We prove that for m ≥ 3,n ≥ 1 and cr(K_m □ P_n)≥ (n − 1)cr(K_m+2 − e) + 2cr(K_m+1). For m≤ 5, according to Klešč, Jendrol and Ščerbová, the equality holds. In this paper, we also prove that the equality holds for m = 6, i.e., cr(K₆ □ P_n) = 15n + 3. Research supported by NFSC (60373096, 60573022).     

六阶图C_6+3K_2与P_n,C_n的联图交叉数

用P_n表示n个点的路,C_n表示长为n的圈,C_6+3K_2表示圈C_6添加三条相邻的边3K_2=C_3得到的图.在Kleitman给出的完全二部图的交叉数cr(K_(6,n))=Z(6,n)的基础上,得到了特殊六阶图C_6+3K_2与路P_n,圈C_n的联图交叉数分别为Z(6,n)+3[n/2]+2与Z(6,n)+3[n/2]+4.     

Two classes of finite semigroups and monoids involving Lucas numbers

The class of finitely presented groups is an extension of the class of triangle groups studied recently. These groups are finite and their orders depend on the Lucas numbers. In this paper, by considering the three presentations

图的上可嵌入性与独立顶点的新度和

Let G be a k(k ≤3)-edge connected simple graph with minimal degree ≥ 3,girth g,r=g12.For any independent set {a1,a2 , . . . , a 6/(4 k)} of G,if,then G is up-embeddable.     

联图$K_5+P_n$的交叉数

A join graph denoted by G + H,is illustrated by connecting each vertex of graph G to each vertex of graph H.In this paper,we prove the crossing number of join product of K_5 + P_n is Z(5,n) + 2 n + [n/2] + 4 for n ≥ 2.