[Na(18-C-6)]2[Cu(i-mnt)2]的合成与结构分析

研究了18-冠-6与Na2[Cu(i-mnt)2][i-mnt=异丁二腈烯二硫醇阴离子,S2CC(CN)2-2]的反应,得到的配合物[Na(18-C-6)]2[Cu(i-mnt)2](1)通过元素分析、红外光谱、X射线单晶衍射进行了结构分析.配合物为单斜晶系,空间群P2(1)/c.晶体学结构数据a=1.2819(11),b=1.1793(10),c=1.4928(13)nm,β=99.121(16)°,V=2.228(3)nm3,Z=2,Dcaled.=1.369g/cm3,F(000)=958,R1=0.0521,wR2=0.1003.1中的[Cu(i-mnt)2]基团通过配体i-mnt的氮原子与两个[Na(18-C-6)]基团中的钠原子成键,形成稳定的中性配合物.     

Nonexistence Results of Minimal Immersions

Let M be a Riemannian m-dimensional manifold with m ≥ 3, endowed with non zero parallel p-form. We prove that there is no minimal isometric immersions of M in a Riemannian manifold N with constant strictly negative sectional curvature. Next we show that, under the conform flatness of the manifold N and some assumptions on the Ricci curvature of N, there is no α-pluriharmonic isometric immersion.     

Defect operators, defect functions and defect indices for analytic submodules

This paper mainly concerns defect operators and defect functions of Hardy submodules, Bergman submodules over the unit ball, and Hardy submodules over the polydisk. The defect operator (function) carries key information about operator theory (function theory) and structure of analytic submodules. The problem when a submodule has finite defect is attacked for both Hardy submodules and Bergman submodules. Our interest will be in submodules generated by polynomials. The reason for choosing such submodules is to understand the interaction of operator theory, function theory and algebraic geometry.     

Unavoidable Traces Of Set Systems

Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.     

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.