70K温区混合工质分凝分离循环节流制冷机实验研究

混合工质节流制冷机正在许多方面获得越来越广泛的应用。文中设计了一种新型的混合工质分凝分离循环 ,建立了实验系统 ,并在 70 K温区进行了实验。实验结果表明 ,节流制冷机可以达到 6 5 .3K的低温 ,并在 72 K温度提供 1W的制冷量 ,输入功率为 5 0 0 W。     

E-酉正则半群

本文定义了PO-六元组的概念,给出了E-酉正则半群的一种结构.     

Degree-regular triangulations of torus and Klein bottle

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In [8], Lutz has classified all the weakly regular triangulations on at most 15 vertices. In [5], Datta and Nilakantan have classified all the degree-regular triangulations of closed surfaces on at most 11 vertices. In this article, we have proved that any degree-regular triangulation of the torus is weakly regular. We have shown that there exists ann-vertex degree-regular triangulation of the Klein bottle if and only if n is a composite number ≥ 9. We have constructed two distinctn-vertex weakly regular triangulations of the torus for eachn ≥ 12 and a (4m + 2)-vertex weakly regular triangulation of the Klein bottle for eachm ≥ 2. For 12 ≤n ≤ 15, we have classified all then-vertex degree-regular triangulations of the torus and the Klein bottle. There are exactly 19 such triangulations, 12 of which are triangulations of the torus and remaining 7 are triangulations of the Klein bottle. Among the last 7, only one is weakly regular.     

Nowhere zero 4‐flow in regular matroids

Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K₅‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K_3,3), M*(K₅)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K₅), M*(K₅)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory     

矩阵对角相似的图论判别法

本文证明了任意两个ｎ阶复矩阵Ａ和Ｂ为对角相似的充要条件是：它们有相同的伴随有向图，并且以此有向图为基础有向图，以Ａ和Ｂ的对应非零元素比值为弧权值的赋权有向图满足“无向圈平衡条件”。我们还给出了矩阵对角相似条件在非负矩阵谱理论研究中的一个应用。     

EXISTENCE OF PERIODIC SOLUTION OF A NEURONIC EQUATION

１ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｂｒａｉｎｏｆｍａｎｋｉｎｄｈａｓｍａｎｙｃｏｇｎｉｔｉｖｅｆｕｎｃｔｉｏｎｓｓｕｃｈａｓｌｅａｒｎｉｎｇ，ａｓｏｃｉａｔｉｏｎａｎｄｏｐｔｉｍｉｚａｔｉｏｎｅｔｃ．．Ｔｈｅｎｅｕｒｏｎｉｓｔｈｅｍｏｓｔｆｏｕｎｄａｍ...     

Norms on unitizations of banach algebras revisited

Let A be an algebra without unit. If ∥ ∥ is a complete regular norm on A it is known that among the regular extensions of ∥ ∥ to the unitization of A there exists a minimal (operator extension) and maximal (ℓ₁-extension) which are known to be equivalent. We shall show that the best upper bound for the ratio of these two extensions is exactly 3. This improves the results represented by A. K. Gaur and Z. V. Kovářík and later by T. W. Palmer. The second author was partially supported by the grant No. 201/03/0041 of GAČR.     

关于PFI-代数与剩余格

本文提出了一种强FI代数-PFI代数,并且深入研究了它的性质,借此进一步揭示了FI-代数和剩余格之间更加密切的联系,进而以FI-代数为基本框架建立了R0-代数、正则剩余格等逻辑系统的结构特征(包括对隅结构)及其相互关系．这种以FI-代数为基础来统一处理剩余格和R0-代数的方法,同样适合于格蕴涵代数和MV代数等代数结构,而且从中更能清楚地看出它们之间的密切联系,也将有助于对相应形式逻辑系统与模糊推理的研究．     

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)]².