方程xy+yz+zx=n的正整数解

本文用 Ｓｉｅｇｅｌ－Ｔａｔｕｚａｗａ定理证明了：当ｎ＞１．２×１０~１１时,至多有两个正 整数ｎ。使方程ｘｕ＋ｙｚ＋ｚｘ＝ｎ无适合（ｘ,ｙ,ｚ）＝１且０＜ｘ＜ｙ＜ｚ的解（ｘ,ｙ,ｚ）, 并给出类数为２的二次域与多项式表素数的一个结果．     

素数及其原根的构造方法研究

本给出了ｍ为素数且ａ为模ｍ的一个原根的充要条件,证明了Ｌｕｃａｓ定理中用于构造素数的ａ就是模ｍ的原根,推出了奇素数模ｍ的原根为平方非剩余等结论,为选择ａ和ｍ－１的素因数使在指定范围内产生较多素数提供了依据。中还给出了ｍ为奇素数时,ａ为模ｍ的一个平方非剩余而非原根的充要条件,得出了求模为奇素数的全部原根的一种简便方法。     

布尔矩阵的幂敛指数集

给出了不含非零对角元的ｎ阶布尔矩阵的幂敛指数集的明显表达式,从而完全解决了布尔矩阵依赖于非零对角元个数的幂敛指数集的刻画问题。     

相对论中的若干“勾股定理”

本文总结了作者讲授电动力学与狭义相对论的若干心得与体会;运用四维闵可夫斯基空间张量的性质及其缩并运算法则,介绍了用各阶四维张量构造相对论不变量即四维标量的方法,进而在所得四维标量为负定的类时标量时,推导出若干典型的勾股关系,并应用或验证于若干简单情形.     

Expression, Purification, Crystallization and Molecular Replacement Studies of TorI, an Inhibition Protein of Tor System

TorI, a Tor system inhibitor acting through protein-protein interaction with the TorR response regulator, is an excisionase that interacts with the integrase and DNA during prophage excision. It has been crystallized by the vapor-diffusion method using polyethylene glycol 3350 as a precipitant at pH 8.5. The X-ray diffraction data sets from the TorI crystal was collected at a resolution of 2.1 , using a synchrotron source. The crystal belongs to primitive monoclinic lattice with cell parameters of 46.210 × 53.992 × 73.561     

区传递的2-(v,6,1)设计与典型单群PSp_n(q)

具有良好传递性的区组设计的分类问题是组合设计研究的活跃领域.利用置换群的次轨道和典型群的子群结构,研究区传递2-(v,k,1)设计的分类.特别地,讨论了自同构群的基柱为典型单群的区传递,点本原但非旗传递的2-(v,6,1)设计.设D为一个2-(v,6,1)设计,G≤Aut(D)是区传递、点本原但非旗传递的,若v为奇数,则G的基柱Soc(G)不是有限域GF(q)上的典型单群PSpn(q).     

Finite groups with Hall supplements to primitive subgroups

Using the classification of finite simple groups, we establish the solvability of every finite group with solvable Hall supplements to primitive subgroups. We prove also that if those supplements are Ore dispersive then so is the group itself.     

中心对称本原矩阵的k点指数集

Let G = (V, E) be a primitive digraph. The vertex exponent of G at a vertex v ∈ V, denoted by expG(v), is the least integer p such that there is a v → u walk of length p for each u ∈ V. We choose to order the vertices of G in the k-point exponent of G and is denoted by expG(k), 1 ≤ k ≤ n. We define the k-point exponent set E(n, k) := {expG(k)| G = G(A) with A ∈ CSP(n)}, where CSP(n) is the set of all n × n central symmetric primitive matrices and G(A) is the associated graph of the matrix A. In this paper, we describe E(n,k) for all n, k with 1 ≤ k ≤ n except n ≡ 1(mod 2) and 1 ≤ k ≤ n - 4. We also characterize the extremal graphs when k = 1.