Strongly Modular Subgroup in Finite Group

Ｓｔｒｏｎｇｌｙ　Ｍｏｄｕｌａｒ　Ｓｕｂｇｒｏｕｐ　ｉｎ　Ｆｉｎｉｔｅ　ＧｒｏｕｐＳｔｒｏｎｇｌｙＭｏｄｕｌａｒＳｕｂｇｒｏｕｐｉｎＦｉｎｉｔｅＧｒｏｕｐ￥ＹｕＪｉａｎｌｉ；ＪｉａｏＤｏｎｇｗｕ（ＬｕｏｙａｎｇＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｌｏｇ...     

关于Abel群上Cayley图的Hamilton圈分解

设Ｇ（Ｆ，Ｔ∩Ｔ＾－１）是有限Ａｂｅｌ群Ｆ上的Ｃａｙｌｅｙ图，Ｔ∩Ｔ＾－１只含２阶元，此文证明了当Ｔ是Ｆ的极小生成元集时，若ｄ（Ｇ）＝２ｋ，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈的并，若ｄ（Ｇ）＝２ｋ＋１，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈与一个１－因子的并。     

SYMMETRIES AND GROUP-INVARIANT SOLUTIONS OF DIFFERENTIAL EQUATIONS

ＳＹＭＭＥＴＲＩＥＳＡＮＤＧＲＯＵＰ－ＩＮＶＡＲＩＡＮＴＳＯＬＵＴＩＯＮＳＯＦＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳＴＩＡＮＣＨＯＵＡｂｓｔｒａｃｔ：Ｆｏｒａｄｉｆｆｅｒｅｎｔｉａｌｅｑｕａｔｉｏｎ，ａｔｈｅｏｒｅｔｉｃａｌｐｒｏｏｆｏｆｔｈｅｒ...     

ON THE SHEAF OF GENERALIZED FUNDAMENTAL GROUP AND COVERING SPACE

ＯＮ ＴＨＥ ＳＨＥＡＦ ＯＦ ＧＥＮＥＲＡＬＩＺＥＤ ＦＵＮＤＡＭＥＮＴＡＬ ＧＲＯＵＰ ＡＮＤ ＣＯＶＥＲＩＮＧ ＳＰＡＣＥ￥ＧＡＮＤＡＮＹＡＮＡｂｓｔｒａｃｔ：Ｔｈｅａｕｔｈｏｒｃｏｎｓｔｒｕｃｔｓｔｈｅｓｈｅａｆｏｆｇｅｎｅｒａｌｉｚｅｄｆｕ...     

Q_k(x)与F_k(x)的渐近公式

设ｎ，ｋ为自然数，Ｇ（ｎ）阶群中的同构类数，Ｆｋ（ｘ）与Ｑｋ（ｘ）分别表示不超过ｘ的自然数中使Ｇ（ｎ）＝ｋ的自然数、无平方因子自然数的个数．本文的目的是用Ｂｒｕｎ筛法证明Ｑｋ（ｘ）的条件渐近公式并对Ｆｋ（ｘ）的渐近性质做出了推测．     

一种生成对称群S9所有Sylow-p子群的算法

根据对称群的基本性质以及第二同构定理，给出了通过添加生成元到P群来构造对称群的一个Sylow-p子群的定理，添加的生成元保证能够快速得到对称群的一个Sylow—p子群．根据第二西洛定理求出了所有共轭子群，即所有Sylow-p子群．针对求所有共轭子群过程中面临共轭子群出现重复的问题，利用正规化子的性质，找到使得两个Sylow-p子群共轭的元，保证每次求的Sylow-P子群不重复．将此算法应用于S1，实验表明该算法可操作性强，耗费时间少．     

Sparse Multicategory Generalized Distance Weighted Discrimination in Ultra-High Dimensions

Distance weighted discrimination (DWD) is an appealing classification method that is capable of overcoming data piling problems in high-dimensional settings. Especially when various sparsity structures are assumed in these settings, variable selection in multicategory classification poses great challenges. In this paper, we propose a multicategory generalized DWD (MgDWD) method that maintains intrinsic variable group structures during selection using a sparse group lasso penalty. Theoretically, we derive minimizer uniqueness for the penalized MgDWD loss function and consistency properties for the proposed classifier. We further develop an efficient algorithm based on the proximal operator to solve the optimization problem. The performance of MgDWD is evaluated using finite sample simulations and miRNA data from an HIV study.     

Numerical analysis for bulk-arrival queueing systems: Root-finding and steady-state probabilities inGI r /M/1 queues

Queueing theorists have presented, as solutions to many queueing models, probability generating functions in which state probabilities are expressed as functions of the roots of characteristic equations, evaluation of the roots in particular cases being left to the reader. Many users have complained that such solutions are inadequate. Some queueing theorists, in particular Neuts [6], rather than use Rouché's theorem to count roots and an equation-solver to find them, have developed new algorithms to solve queueing problems numerically, without explicit calculation of roots. Powell [7] has shown that in many bulk service queues arising in transportation models, characteristic equations can be solved and state probabilities can be found without serious difficulty, even when the number of roots to be found is large. We have slightly modified Powell's method, and have extended his work to cover a number of bulk-service queues discussed by Chaudhry et al. [1] and a number of bulk-arrival queues discussed in the present paper.     

Some sufficient conditions for the E- and MV-optimality of block designs having blocks of unequal size

Summary In this paper we consider experimental situations in which ν treatments are to be tested inb blocks whereb _i blocks containk _i experimental units,i=1,...,p, k ₁<k ₂<...<k _p . The idea of a group divisible (GD) design is extended to that of a group divisible design with unequal block sizes (GDUB design) and then a number of results concerning the E- and MV-optimality of GD designs are generalized to the case of GDUB designs.     

极大子群的性质对有限群结构的影响

设H为有限群G的一个子群。称H在G中是s-半正规的,若对任意的素数p||G|,只要(p,|H|)=1,就有PH=HP,其中P∈Sylp(G);称H在G中是c-可补的,若存在G的子群N,使得G=HN且H∩N≤HG=CoreG(H)。证明了下面定理设F是一个包含超可解群类U的饱和群系,H△G,且G/H∈F。则G∈F,若下列条件之一成