环的弱正则性

首先引入弱正则理想的概念,得到了弱正则理想的一些性质,接着讨论了半群环的弱正则性.     

柏拉图多面体与高碳原子簇

在简要分析柏拉图多面体的对称性质和几何特性的基础上,讨论了它与一般高对称性原子簇的分子骨架几何构型,特别是它与高对称性高碳原子簇几何构型之间的关系.     

Nonideal mixing of 16-(9-anthroyloxy) palmitic acid and fatty acid in monolayer

The surface pressure-molecular area curve of the mixed monolayer of 16-(9-anthroyloxy) palmitic acid (16AP) and fatty acid (palmitic or stearic acids) showed various kink points which indicated the phase transitions of the monolayer. On the basis of the surface phase rule, the phase diagrams of the mixed monolayer were elucidated. The bifunctional molecule, 16AP, takes two orientations in a monolayer state, that is, horizontal and vertical ones. Horizontally oriented 16AP and vertically oriented fatty acid form a mixed monolayer but this exhibits deviation from the ideal mixing, which was interpreted in terms of the surface regular solution theory. On the other hand, the 16AP molecule in the vertical state was found to be immiscible with the fatty acid molecule in a monolayer de spite both molecules being vertical to the surface and parallel to each other. This was caused by the participation of the 9-anthroyloxy moiety of 16AP in the interaction of 16AP and fatty acid in the hydrophobic region of the monolayer.     

Quasi-symmetric 2-(64,24,46) designs derived from AG(3,4)

This paper completes the enumeration of quasi-symmetric 2-$(64,24,46)$ designs supported by the dual code $C^{\perp }$ of the binary linear code $C$ spanned by the lines of $AG(3,4)$, initiated in Rodrigues and Tonchev (2015). It is shown that $C^{\perp }$ supports exactly 30,264 nonisomorphic quasi-symmetric 2-$(64,24,46)$ designs. The automorphism groups of the related strongly regular graphs are computed.     

5-正则图的全控制数的一个注记

设G是不含孤立点的图,S是G的一个顶点子集,若G的每一个顶点都与S中的某顶点邻接,则称S是G的全控制集.G的最小全控制集所含顶点的个数称为G的全控制数,记为γt(G).Thomasse和Yeo证明了若G是最小度至少为5的n阶连通图,则γt(G)≤17n/44.在5-正则图上改进了Thomasse和Yeo的结论,证明了若G是n阶5-正则图,则,γt(G)≤106n/275.     

Distance regularity of Kerdock codes

A code is called distance regular, if for every two codewords x, y and integers i, j the number of codewords z such that d(x, z) = i and d(y, z) = j, with d the Hamming distance, does not depend on the choice of x, y and depends only on d(x, y) and i, j. Using some properties of the discrete Fourier transform we give a new combinatorial proof of the distance regularity of an arbitrary Kerdock code. We also calculate the parameters of the distance regularity of a Kerdock code.     

On generalized inverse transversals

Let S be a regular semigroup, S° an inverse subsemigroup of S.S° is called a generalized inverse transversal of S, if V（x）∩S°≠Ф. In this paper, some properties of this kind of semigroups are discussed. In particular, a construction theorem is obtained which contains some recent results in the literature as its special cases.     

Strongly regular locally <Emphasis Type="Italic">GQ</Emphasis>(4,<Emphasis Type="Italic">t</Emphasis>)-graphs

Amply regular with parameters (v, k, λ, μ) we call an undirected graph with v vertices in which the degrees of all vertices are equal to k, every edge belongs to λ triangles, and the intersection of the neighborhoods of every pair of vertices at distance 2 contains exactly μ vertices. An amply regular diameter 2 graph is called strongly regular. We prove the nonexistence of amply regular locally GQ(4,t)-graphs with (t,μ) = (4, 10) and (8, 30). This reduces the classification problem for strongly regular locally GQ(4,t)-graphs to studying locally GQ(4, 6)-graphs with parameters (726, 125, 28, 20).     

关于强正则环的刻画

通过单边理想是广义弱理想来刻画强正则环,证明了下列条件是等价的:①R是强正则环;②R是半素的左GP-V′-环,且每一个极大的左理想是广义弱理想;③R是半素的左GP-V′-环,且每一个极大的右理想是广义弱理想.     

ND阵列加权乘积和的完全收敛性

设（Xni：1≤i≤n,n≥1）为行间ND阵列,g（x）是R^＋上指数为α的正则变化函数,{αni：1≤i≤n,n≥1}为满足条件max1≤i≤n｜ani｜=0（（g（n））^-1）的实数阵列．本文采用截尾的方法,得到了使ND随机变量阵列加权乘积和完全收敛的条件,并推广了以前学者的结论．