Three-dimensional integrable models and associated tangle invariants

In this paper we show that the Boltzmann weights of the three-dimensional Baxter-Bazhanov model give representations of the braid group if some suitable spectral limits are taken. In the trigonometric case we classify all possible spectral limits which produce braid group representations. Furthermore, we prove that for some of them we get cyclotomic invariants of links and for others we obtain tangle invariants generalizing the cyclotomic ones.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

A geometric formula for Haefliger knots

Haefliger has shown that a smooth embedding of the (4k−1)-sphere in the 6k-sphere can be knotted in the smooth sense. In this paper, we give a formula with which we can detect the isotopy class of such a Haefliger knot. The formula is expressed in terms of the geometric characteristics of an extension, analogous to a Seifert surface, of the given embedding. In particular, the Hopf invariant associated to the extension plays a crucial role. This leads us to a new characterisation of Haefliger knots.     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .     

On the Permanental Polynomials of Some Graphs

Let G be a simple graph with adjacency matrix A(G) and (G,x) the permanental polynomial of G. Let G × H denotes the Cartesian product of graphs G and H. Inspired by Kleins idea to compute the permanent of some matrices (Mol. Phy. 31 (3) (1976) 811–823), in this paper in terms of some orientation of graphs we study the permanental polynomial of a type of graphs. Here are some of our main results.1.If G is a bipartite graph containing no subgraph which is an even subdivision of K _2,3, then G has an orientation G ^e such that (G,x) = det (xI-A(G ^e )), where A(G ^e ) denotes the skew adjacency matrix of G ^e.2.Let G be a 2-connected outerplanar bipartite graph with n vertices. Then there exists a 2-connected outerplanar bipartite graph with 2n+2 vertices such that (G,x) is a factor of .3.Let T be an arbitrary tree with n vertices. Then , where ₁ , ₂ , ..., _n are the eigenvalues of T.     

Entanglement complexity of lattice ribbons

We consider a discrete ribbon model for double-stranded polymers where the ribbon is constrained to lie in a three-dimensional lattice. The ribbon can be open or closed, and closed ribbons can be orientable or nonorientable. We prove some results about the asymptotic behavior of the numbers of ribbons withn plaquettes, and a theorem about the frequency of occurrence of certain patterns in these ribbons. We use this to derive results about the frequency of knots in closed ribbons, the linking of the boundary curves of orientable closed ribbons, and the twist and writhe of ribbons. We show that the centerline and boundary of a closed ribbon are both almost surely knotted in the infinite-n limit. For an orientable ribbon, the expectation of the absolute value of the linking number of the two boundary curves increases at least as fast as n, and similar results hold for the twist and writhe.     

C30卡宾三叶结分子结构与稳定性的理论研究

三叶结分子是最简单的非平凡纽结分子, C₃₀卡宾三叶结分子是由一条闭合的(C≡C—)₁₅ sp杂化碳链组成的, 是具有D₃对称性的拓扑手性分子. 本文用密度泛函方法[DFT/RB3LYP/6-31G(D)]对分子结构和光谱性质进行了研究, 在优化构型的基础上通过自然键轨道(NBO)方法和轨道能级研究了它的共轭性、成键情况和稳定性, 并与平面型C₃₀卡宾环分子进行了比较. 计算结果表明三叶结分子的三叶弧上形成了非平面的C≡C共轭和扭曲的内螺旋结构, 交叉处具有弱成键作用, 且分子轨道也发生了扭曲; 三叶结分子比卡宾环的共轭性和赝Jahn-Teller效应都明显小, 而总能量高. 因此, 分子打结是一个能量升高的过程.     

Structure and Electronic Properties of Fullerenes C52q+: Is C522+ an Exception to the Pentagon Adjacency Penalty Rule?

The structure, vibrational spectra and electronic properties of the neutral, singly and doubly charged C52 fullerenes were studied by means of the Hartree-Fock method and density functional theory. Different isomers were considered, in particular those with the lowest possible number (five or six) of adjacent pentagons, and an isomer with a four-atom ring. For neutral and singly charged species, the most stable isomer is that with the lowest number of adjacent pentagons, namely five. However, for C(52)2+, the most stable structure has six adjacent pentagons. This finding, which contradicts the pentagon adjacency penalty rule, is a consequence of complete filling of the HOMO pi shell and the near-perfect sphericity of the most stable isomer. The simulated vibrational spectra show important differences in the positions and intensities of the vibrations for the different isomers.