一个关于近-三角剖分嵌入的内插定理

一个近三角剖分嵌入是指一个图嵌入在一个曲面上,使得至多可能有一个面不是三角面。在本文中我们证明了如下结果：如果一个图G在某个可定向曲面S_h上有三角剖分嵌入,那么G在S_k上有一个近三角剖分嵌入,这里k=h,h 1,…,[β(G)/2],而β(G)是图G的Betti数。     

类圈图的亏格分布

一个图 G 的亏格分布是指序列{g_k}, g_k表示 G 嵌入亏格为 k 的闭的可定向曲面的数目. 该文给出了标准类圈图的亏格分布的递推公式, 并得到类圈图的嵌入多项式的计算公式.     

关于图的上可嵌入性的一个注记

任韩和李刚在图的最大亏格综述一文"Survey of maximum genus of graphs" [J East China NormUniv Natur Sci, Sep. 2010, No. 5, 1-13] 中,全面地阐述了近30 年来关于图的最大亏格及其相关问题所取得的进展,并提出了如下两个猜想:
猜想1 设G 为简单连通图, 且G 的每条边含在一个三角形K₃ 中, 则G 是上可嵌入的.
猜想2 设c 为任意的正数, 则存在一个自然数N(c), 使得对每一个图G, 若G 的点数n ≥ N(c), 且最小度δ(G) ≥ cn, 则G 是上可嵌入的.
本文的主要工作是否定上述两个猜想, 同时探讨上述猜想成立的条件且得了一些新结果, 并提出有关进一步研究的问题.     

嵌入曲面的特殊图的边染色

设图G是嵌入到欧拉示性数χ(∑)≥0的曲面上的图,χ′(G)和△(G)分别表示图G的边色数和最大度.将证明如果G满足以下条件:1)△(G)≥5;2)图中3-圈和4-圈不相邻;3)图G中没有5-圈的一次剖分,则有χ′(G)=△(G).     

关于拓扑流形到某些欧氏空间的拓扑嵌入

本文研究了拓扑流形的拓扑嵌入问题,得出了边界为(k—1)-连通的n维k-连通紧带边拓扑流形能局部平坦地整齐嵌入D^2n-h,局部平坦地嵌入S^2n-h-1的一个充分性条件(0≤h≤2k),且给出了它的一些应用。     

交错群A5的Cayley图同构的Li-Praeger猜想

设G是有限群, S是G＼{1}的子集,并满足S=S -1. 用X=Cay(G, S )表示G关于S的Cayley图. 称S为G的CI-子集, 如果对任意同构Cay(G, S )Cay(G, T )存在α∈Aut(G), 使得Sα=T .设m是正整数,称G为m-CI-群, 如果G的每个满足S =S -1和|S|≤m的子集S都是CI的. 证明了Li-Praeger猜想：交错群A₅是4- CI-群.     

图的上可嵌入性

证明了一个连通无环图G如果能嵌入某个 (定向或不可定向 )曲面S上使得每个面的大小不超过 5 ,则G是上可嵌入的 .     

不可定向曲面上的最大亏格嵌入和最小亏格嵌入

研究了不可定向曲面上最大亏格嵌入的估计数,得到了几类图的指数级不可定向最大亏格嵌入的估计数的下界.利用电流图理论,证明了完全图K_(12s)在不可定向曲面上至少有2~(3s-1)个最小亏格嵌入;完全图K_(12s+3)在不可定向曲面上至少有2~(2s)个最小亏格嵌入;完全图K_(12s+7)在不可定向曲面上至少有2~(2s+1)个最小亏格嵌入.     

可定向曲面上具有较短不可收缩圈图嵌入的唯一性

拓扑图论中的一个基本问题就是要决定图在一个(可定向)曲面上的嵌入之数目(既嵌入的柔性问题).H.Whitney的经典结果表明:一个3-连通图至多有一个平面嵌入;C.Thomassen的LEW-嵌入(大边宽度)理论将这一结果推广到一般的可定向曲面.本文给出了几个关于一般可定向曲面上嵌入图的唯一性定理.结果表明:一些具有大的面迹的可定向嵌入仍然具有唯一性.这在本质上推广了C.Thomassen在LEW-嵌入方面的工作.     

两类广义Petersen 图的Euler亏格

广义 Petersen 图 P(n, m) 是这样的一个图:它的顶点集是{u_i, v_i | i=0,1, ^… , n-1}, 边集是 {u_iu_i+1, v_iv_i+m, u_iv_i | i=0,1, ^…, n-1}, 这里 m, n 是正整数、加法是在模n 下且 m<|n/2| . 这篇文章证明了P(2m+1, m)(m≥ 2) 的 Euler 亏格是1, 并且 P(2m+2, m)(m≥ 5) 的 Euler 亏格是2.     

增益图与其底图的正惯性指数之间的关系

设$\mathbb{T}$是模为1的复数乘法子群.图$G=(V,E)$,这里$V,E$分别表示图的点和边.增益图是将底图中的每条边赋于$\mathbb{T}$中的某个数值$\varphi(v_iv_j)$,且满足$\varphi(v_iv_j) =\overline{\varphi(v_jv_i)}$.将赋值以后的增益图表示为$(G,\varphi)$.设$i_+(G,\varphi)$和$i_+(G)$分别表示增益图与底图的正惯性指数,本文证明了如下结论: $$ - c( G ) \le {i_ + } ( {G,\varphi } ) - {i_ + }( G ) \le c( G ), $$ 这里$c(G)$表示圈空间维数,并且刻画了等号成立时候的所有极图.     

A Lattice of Quasivarieties of Normal Cryptogroups

A normal cryptogroup S is a completely regular semigroup in which is a congruence and is a normal band. We represent S as a strong semilattice of completely simple semigroups, and may set For each we set and represent by means of an h-quintuple These parameters are used to characterize certain quasivarieties of normal cryptogroups. Specifically, we construct the lattice of quasivarieties generated by the (quasi)varieties and This is the lattice generated by the lattice of quasivarieties of normal bands, groups and completely simple semigroups. We also determine the B-relation on the lattice of all quasivarieties of normal cryptogroups. Each quasivariety studied is characterized in several ways.     

Existence of Generalized Cauchy-Riemann Side-Systems in Several Complex Variables

In the present paper we have deduced the necessary and sufficient conditions on which an initial value problem $\fraca {\partial w}{\partial z_j} = a_j(z,\overline {z})\overline {w}+b_j(z,\overline {z})w+c_j(z,\overline {z}), \, j = 1,\ldots , n,\, w(z_0,\overline {z_0}) = w_0$ is locally solvable in the class of generalized analytic functions of several complex variables, which are functions fulfilling generalized Cauchy-Riemann System, $\fraca {\partial w}{\partial \overline {z_k}} = \overline {\alpha _k(z,\overline {z})}\, \overline {w}+ \overline {\beta _k(z,\overline {z})}w+ \overline {\gamma _k(z,\overline {z})},\, k = 1,\ldots , n$ .     

Quasi-linear parabolic problems in L 1 with non homogeneous conditions on the boundary

We are interested in parabolic problems with L¹ data of the type

关于一类中心循环的有限P-群的自同构群

确定了一类中心循环的有限p-群G的自同构群.设G=X_3(p~m)~(*n)*Z_(p~(m+r)),其中m≥1,n≥1和r≥0,并且X_3(p~m)=x,y|x~(p~m)=y~(p~m)=1,[x,y]~(p~m)=1,[x,[x,y]]=[y,[x,y]]=1.Aut_nG表示Aut G中平凡地作用在N上的元素形成的正规子群,其中G'≤N≤ζG,|N|=p~(m+s),0≤s≤r,则(i)如果p是一个奇素数,那么AutG/Aut_nG≌Z_(p~((m+s-1)(p-1))),Aut_nG/InnG≌Sp(2n,Z_(p~m))×Z_(p~(r-s)).(ii)如果p=2,那么AutG/Aut_nG≌H,其中H=1(当m+s=1时)或者Z_(2~(m+s-2))×Z_2(当m+s≥2时).进一步地,Aut_nG/InnG≌K×L,其中K=Sp(2n,Z_(2~m))(当r0时)或者O(2n,Z_(2~m))(当r=0时),L=Z_(2~(r-1))×Z_2(当m=1,s=0,r≥1时)或者Z_(2~(r-s)).     

Instanton counting on blowup. II. K-theoretic partition function

We study Nekrasov's deformed partition function $Z(\varepsilon_1,\varepsilon_2,\vec{a};\mathfrak q,\boldsymbol\beta)$ of 5-dimensional supersymmetric Yang-Mills theory compactified on a circle. Mathematically it is the generating function of the characters of the coordinate rings of the moduli spaces of instantons on $\mathbb R^4$. We show that it satisfies a system of functional equations, called blowup equations, whose solution is unique. As applications, we prove (a) $F(\varepsilon_1,\varepsilon_2,\vec{a};\mathfrak q,\boldsymbol\beta) = \varepsilon_1\varepsilon_2 \log Z(\varepsilon_1,\varepsilon_2,\vec{a};\mathfrak q,\boldsymbol\beta)$ is regular at $\varepsilon_1 = \varepsilon_2 = 0$ (a part of Nekrasov's conjecture), and (b) the genus $1$ parts, which are first several Taylor coefficients of $F(\varepsilon_1,\varepsilon_2,\vec{a};\mathfrak q,\boldsymbol\beta)$, are written explicitly in terms of $\tau = d^2 F(0,0,\vec{a};\mathfrak q,\boldsymbol\beta)/da^2$ in rank $2$ case.     

树的导出匹配覆盖

The induced matching cover number of a graph G without isolated vertices,denoted by imc(G),is the minimum integer k such that G has k induced matchings M1,M2,…,Mk such that,M1∪M2 ∪…∪Mk covers V(G).This paper shows if G is a nontrivial tree,then imc(G) ∈ {△*0(G),△*0(G) + 1,△*0(G)+2},where △*0(G) = max{d0(u) + d0(v) :u,v ∈ V(G),uv ∈ E(G)}.     

关于完全三部图色唯一性的一个注记

Let P(G,λ) be the chromatic polynomial of a simple graph G. A graph G is chromatically unique if for any simple graph H, P(H,λ) = P(G,λ) implies that H is isomorphic to G. Many sufficient conditions guaranteeing that some certain complete tripartite graphs are chromatically unique were obtained by many scholars. Especially, in 2003, Zou Hui-wen showed that if n 31m2 + 31k2 + 31mk+ 31m? 31k+ 32√m2 + k2 + mk, where n,k and m are non-negative integers, then the complete tripartite graph K(n - m,n,n + k) is chromatically unique (or simply χ-unique). In this paper, we prove that for any non-negative integers n,m and k, where m ≥ 2 and k ≥ 0, if n ≥ 31m2 + 31k2 + 31mk + 31m - 31k + 43, then the complete tripartite graph K(n - m,n,n + k) is χ-unique, which is an improvement on Zou Hui-wen's result in the case m ≥ 2 and k ≥ 0. Furthermore, we present a related conjecture.