几乎完全分部图是本质链环图的一个充分条件(英文)

设G是去掉两条边的完全p-部图(p3),且是本质纽结图,经过有限次△-Y变换或点扩张得到图J.本文证明了,若从J中去掉任一顶点及与其相关联的所有边,则所得的图为一个本质链环图.这一结果给出了更多的本质纽结图满足Adams的纽结书中所提出的经典猜想"去掉本质纽结图的任一顶点得到的一定是本质链环图".     

几乎完全分部图是本质链环图的一个充分条件(英文)北大核心CSCD

设G是去掉两条边的完全p-部图(p<3),且是本质纽结图,经过有限次△-Y变换或点扩张得到图J.本文证明了,若从J中去掉任一顶点及与其相关联的所有边,则所得的图为一个本质链环图.这一结果给出了更多的本质纽结图满足Adams的纽结书中所提出的经典猜想"去掉本质纽结图的任一顶点得到的一定是本质链环图".     

近完全二部图的交叉数

图G的交叉数是刻画图的非平面性的一个重要参数.它是指图G在平面上的所有画法中边与边之间交叉数目的最小值.确定具体图类的交叉数是图的交叉数问题中一个经典的研究方向.Zarankiewicz于1954年提出了完全二部图交叉数的猜想:■.1971年,Kleitman证明了当min{m,n}≤6时,上式成立.由于其难度,完全二部图交叉数的研究进展是较缓慢的.至今,完全二部图K_7,n(n≥11)的交叉数都还未确定.然而,我们发现研究近完全二部图的交叉数可了解在完全二部图中加边与完全二部图交叉数的增长程度之间的关系.因此,为了促进完全二部图交叉数的研究,本文借助旋系与交叉数之间的关系、图的结构性质以及图的顶点度局部修改法确定了五个近完全二部图的交叉数.     

两类广义控制问题的NP-完全性

研究两类广义控制问题的复杂性: k-步长控制问题和k-距离控制问题, 证明了k-步长控制问题在弦图和平面二部图上都是NP-完全的. 作为上述结果的推论, 给出了k-距离控制问题在弦图和二部图上NP-完全性的新的证明, 并进一步证明了k-距离控制问题在平面二部图上也是NP-完全的.     

离散鞅可料表示性的一个注

本文在鞅变换的框架在下改进了Jacod引理并证明了其逆命题,考察了离散鞅的可料表示性的本质,从而引出最小可料表示性的概念,并给出其在金融数学完备市场理论中的一个应用.     

最大度与最小度相差不超过2的图的平衡judicious划分

图G的顶点集V(G)的一个二部划分V_1和V_2叫做平衡二部划分,如果||V_1|-|V_2||≤1成立.Bollobas和Scott猜想:每一个有m条边且最小度不小于2的图,都存在一个平衡二部划分V_1,V_2,使得max{e(V_1),e(V_2)}≤m/3,此处e(V_i)表示两顶点都在V_i(i=1,2)中的边的条数.他们证明了这个猜想对正则图(即△(G)=δ(G))成立.颜娟和许宝刚证明了每个(k,k-1)-双正则图(即△(G)-δ(G)≤1)存在一个平衡二部划分V_1,V_2,使得每一顶点集的导出子图包含大约m/4条边.这里把该结论推广到最大度和最小度相差不超过2的图G.     

Mbius变换和正则函数的Poisson积分表示

首先,给出了R³中平面和球面方程的超复形式,接着提出了R3中平面和球面方程的超复形式,接着提出了R³中关于平面和球面对称点的概念,并给出了关于平面和球面对称点所满足的等价方程.我们考虑了超复空间Cl_3中的一些特殊的Mbius变换,并给出了其一些性质,比如:保持球面或平面不变性,保持关于平面和球面对称性不变性,保持交比不变性等.文中给出了正则函数和Mbius变换的关系.其次,证明了R3中关于平面和球面对称点的概念,并给出了关于平面和球面对称点所满足的等价方程.我们考虑了超复空间Cl_3中的一些特殊的Mbius变换,并给出了其一些性质,比如:保持球面或平面不变性,保持关于平面和球面对称性不变性,保持交比不变性等.文中给出了正则函数和Mbius变换的关系.其次,证明了R³中球内正则函数的推广的Cauchy定理和Cauchy积分公式.借助于上述正则函数的Cauchy积分公式和其对称点的积分表示,给出了正则函数的Poisson积分表示.最后,在Mbius变换的性质基础上,给出了Mbius变换下曲面积分的变量替换公式.     

线性代数变换与仿射几何变换

本文介绍线性代数中的二维代数变换与解析几何中的平面仿射变换的关系,代数变换及其变换矩阵的几何意义,各种仿射变换的矩阵表示及其矩阵性质,梳理仿射变换下的不变性质与不变量.     

关于图的邻点可区别全染色

提出了图的邻点可区别全染色的概念, 给出了圈、完全图、完全二部图、扇、轮和树的邻点可区别全色数.     

拟正则完全二部图的局部最可靠性

用P(G，ρ)表示顶点完全可靠，而边则以概率ρ∈(0，1)相互独立地出现故障的图G的全终端不可靠度，即G因边故障而变得不连通的概率．本文证明了边故障率ρ充分小时，拟正则完全二部图在具有相同点数和相同边数的图类中是惟一具有最小全终端不可靠度的图．     

完全图$K_{2m}$书本表示的唯一性

In the present paper we discuss some properties of book presentation of spatial graphs, and prove that the book presentation of minimum sheets of a complete graph K2m with even vertices is unique up to sheet translation and ambient isotopy. We also show this is true for K7.     

Diffeomorphic vs Isotopic Links in Lens Spaces

Links in lens spaces may be defined to be equivalent by ambient isotopy or by diffeomorphism of pairs. In the first case, for all the combinatorial representations of links, there is a set of Reidemeister-type moves on diagrams connecting isotopy equivalent links. In this paper, we provide a set of moves on disk, band and grid diagrams that connects diffeo-equivalent links: there are up to four isotopy equivalent links in each diffeo-equivalence class. Moreover, we investigate how the diffeo-equivalence relates to the lift of the link in the 3-sphere: in the particular case of oriented primitive-homologous knots, the lift completely determines the knot class in L(p, q) up to diffeo-equivalence, and thus only four possible knots up to isotopy equivalence can have the same lift.     

A class of isoclinic three-webs

We consider multidimensional isoclinic three-webs with covariantly constant (with respect to the Chern connection) curvature and torsion tensors. It is proved that there exists a unique (up to an isotopy) isoclinic three-web with covariantly constant basic tensors.We find structure and finite equations of this web and consider some its properties.     

Characteristic Foliations of Spheres Embedded in the Standard Overtwisted Structure (R3, ζ1)

The characteristic foliation of a sphere embedded in the standard tight contact structure (R³, ₀) is unique up to isotopy. We show that any Morse-Smale foliation on the sphere with null Euler class, is, up to isotopy, the characteristic foliation of a sphere embedded in the standard overtwisted contact structure (R³, ₁). We thus have a new way of looking at the two standard structures as opposites in the world of contact structures.     

Canonical reducing curves of surface homeomorphism

In this paper we will introduce the concept of canonical reducing set of a surface homeomorphism, and prove that it is unique up to an isotopy. As an application, we will give a simple proof of Thurston's theorem on classifying mappings on non-orientable surface, using the techniques of quasiconformal mappings and some known results in the orientable case, especially the Thurston theorem on orientable surfaces.     

Modeling Complex Points up to Isotopy

In this paper, we examine the structure of complex points of real 4-manifolds embedded into complex 3-manifolds up to isotopy. We show that there are only two types of complex points up to isotopy and, as a consequence, show that any such embedding can be deformed by isotopy to a manifold having a 2-complete neighborhood basis.     

Milnor invariants for spatial graphs

Link-homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component-homotopy, which reduces to link-homotopy in the classical case. Unlike previous attempts at generalizing link-homotopy to spatial graphs, our new relation allows analogues of some standard link-homotopy results and invariants.In particular we can define a type of Milnor group for a spatial graph under component-homotopy, and this group determines whether or not the spatial graph is splittable. More surprisingly, we will also show that whether the spatial graph is splittable up to component-homotopy depends only on the link-homotopy class of the links contained within it. Numerical invariants of the relation will also be produced.     

Graph Duality in Surface Dynamics

Journal of Nonlinear Science - We compare one-dimensional representations for the isotopy stable dynamics of homeomorphisms in two dimensions. We consider the skeleton graph representative, which...     

三圈图的极小广义和连通指数

图的广义和连通指数作为新提出的一类分子拓扑指数, 在QSPR/QSAR 中有很大的应用价值. 树图、单圈图和双圈图的极值问题已取得很多结果, 而三圈图相关问题的研究较为复杂. 限制 - 1\leqslant \alpha < 0, 对三圈图的广义和连通指数进行了研究. 通过对三圈图的分析, 构造了一种图的变换, 指出在三圈图中广义和连通指 数的极小值必由其中的七种类型图取得. 然后通过悬挂边的变换, 最终得到三圈图广义和连通指 数的极小值并刻画了唯一的极图.     

Minimum cycle bases of Halin graphs

Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003