On multiplicities of simple subquotients in generalized Verma modules

We reduce the problem on multiplicities of simple subquotients in an -stratified generalized Verma module to the analogous problem for classical Verma modules.     

Abstract Commensurators of Groups Acting on Rooted Trees

We show that the abstract commensurator of a nearly level transitive weakly branch group H coincides with the relative commensurator of H in the homeomorphism group of the boundary of the tree on which H acts. It is also shown that the commensurator of an infinite group which is commensurable with its own nth direct power contains a Higman–Thompson group as a subgroup. Applying these results to the Grigorchuk 2-group G we show that the commensurator of G is a finitely presented infinite simple group.     

On K‐Theory of Simplicial Rings and Degreewise Constructions

We give a measure of the difference between Waldhausen's definition of the Ktheory of a simplicial ring and the definition we obtain by extending Quillen's definition degreewise. This has computational advantages as the degreewise Ktheory sometimes is simpler to work with.     

Fuzzy半群中的极小Fuzzy理想

本文先给出Ｆｕｚｙ半群中极小Ｆｕｚｙ理想的一些代数性质,进而利用极小Ｆｕｚｙ理想刻划Ｆｕｚｚｙ单半群的一些代数性质     

On the Classification of Flag-Transitive c.c*- Geometries

Let ( G) be a flag-transitive c.c*-geometry whose point-stabilizer is not an affine group. We list all known examples and show that, if (, G) is a minimal unknown example, then G is an almost simple group and the commutator subgroup G is a simple group of Lie type.     

Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications

We show that the covering radius R of an [n,k,d] code over F_q is bounded above by R n-n _q(k, d/q). We strengthen this bound when R d and find conditions under which equality holds.As applications of this and other bounds, we show that all binary linear codes of lengths up to 15, or codimension up to 9, are normal. We also establish the normality of most codes of length 16 and many of codimension 10. These results have applications in the construction of codes that attain t[n,k,/it>], the smallest covering radius of any binary linear [n,k].We also prove some new results on the amalgamated direct sum (ADS) construction of Graham and Sloane. We find new conditions assuring normality of the ADS; covering radius 1 less than previously guaranteed for ADS of codes with even norms; good covering codes as ADS without the hypothesis of normality, from concepts p- stable and s- stable; codes with best known covering radii as ADS of two, often cyclic, codes (thus retaining structure so as to be suitable for practical applications).     

n-极大子群为C-正规的有限群

首先,利用Hall子群的C－正规性,得到了有限群成为。可解群的一个充分条付,推广了Schur-Zassenhaus定理;其次,考查了 n－极大子群或其 2阶及 4阶循环子群为 C-正规对有限群结构的影响．     

单纯形法计算薄膜常数

本文首次报道了用单纯形加速法计算正常兔ＩｇＧ抗原与羊－抗兔抗体反应的抗体层厚度和光学常数，该方法假定抗体层厚度、光学常数均为时间的函数，避免了以往只假定厚度为时间函数所造成的误差。结果表明该方法计算抗体层薄膜常数是可行的。