有限群的素数幂阶S-拟正规嵌人子群

设G为有限p-可解群,其中p为|G|的奇素因子.若P为G的Sylow p-子群且最小生成系含d个元素.考虑集合Md(P)={P1,…,Pd}其中P1,…,Pd是P的极大子群且满足d∩i=1Pi=Φ(P).证明了若Md(P)中每个元在G中是S-拟正规嵌入的,则G为p-超可解群.作为应用,还得到了一些进一步的结论.     

极大子群同阶类类数不大于2的有限群

本文证明了如下结果 1.设G是恰含两个极大子群同阶类的有限单群,则G(?)PSL(2,7)。 2.设G是有限群,若G中极大子群同阶类类数ι≤2,则|π(G)|≤3。且 (1) ι=1当且仅当G为p-群。 (2) ι=2时,有 (a) 若G可解,则|π(G)|=2; (b) 若G不可解,则π(G)={2,3,7},且其中M[N]为正规子群N与子群M的半直积,     

三个或多个素变数的线性方程

设G是有限群,p是|G|的一个素因子,P是G的一个Sylow p-子群.若下列条件之一满足,则G是p-幂零:(1)P的极大子群均在G中S-半正规且(|G|,p-1)=1;(2)P的二次极大子群均在G中S-半正规且(|G|,p2-1)=1.     

关于p闭群的阶

文中p为指定的某素数。群皆指有限群。术语与符号一般按[1].若群 G 的 Sylow p-子群在 G 正规,则称 G 为 p-闭群(p-closed group)。p-闭群的子群,商群,以及两 p-闭群的直积显然都是 p-闭群。设 G 为 p-闭群,P∈syl_p(G)。若 G/P 为交换群且其指数(exponent)除得尽 p-1,则称 G 为强 p-闭(strictly p-closed)。强 p-闭群是超可解群,且一般超可解群与强     

关于p-超可解群

本文讨论p-超可解群的几个特征性质.主要是两个.一是利用p-局部子群刻画p-超可解性,它与关于超可解群的Baer的定理有联系,而后者在超可解群理论中占有重要地位,这在[2]中可看到.二是用两个特征子群的p-幂零性来刻画p-起可解性.本文的群都指有限群. 以下由R.Baer表述的引理具有基本的重要性. 引理1 设L是群G的极小正规子群,p||L.如果(G/C_G(L))’与(G/C_G(L))~(p-1)都是p-群,则|L|=p.     

Wielandt定理的简单推广

本文的主要结果是:设有限群 G 有一个有 Sylow 塔的 Hall π-子群 H,H=p_1~(α_1)…p_s~(α_s),(p_j 为素数且 p_j相似文献   

有限群有正规ρ-补的一个定理

用某些P-子群的正规化子的性质来给出有限群有正规P-补的条件,前人已有不少研究。 Burnside定理 P为有限群G的-P-sylow子群。若p为Abel,且P的正规化子N_G(P)中的p＇元(即阶与P互质的元)均与P的元可换,则G有正规p-补([1]定理14.3.1)。 Frobenius定理 P为有限群G的-P-sylow子群。若P的任一子群P_1的正规化子N_G(P_1)中的p＇元均与P_1的元可换,则G有正规p-补([1]定理14.4.7)。 Thompson定理设P为奇质数,p为有限群G的一个P-sylow子群。Z为p的     

关于某些子群的共轭置换性的研究

设G是一个有限群,p是|G|的一个素因子,P是G的一个Sylow p-子群,A和B是G的两个子群.当p阶子群在G中共轭置换且可补时,获得了P的正规性并描述了P的结构.这表明当G的极小子群均在G中共轭置换且可补时,G是幂零的.特别地,当p是G的阶的最小素因子时,证明了G是p-可分解的.在此基础上,把上述结论推广到G=AB并且A∪B中的极小子群具有相应性质时的情形.除此之外,还证明了当G有一个循环极大子群是F(G)-共轭置换时G的超可解性.     

τ-拟置换子群对有限群结构的影响

群G的一个子群H称为τ-拟置换的,如果G有一个子群B满足G=N_G(H)B且HB=BH,同时对于B的Sylow q-子群Q,只要满足(|H|,q)=1但(|H|,|Q~G|)≠1,便有HQ=QH,其中q是|B|的任一素因子.研究了τ-拟置换子群对有限群结构的影响.应用极小阶反例的方法得到了群G是p-超可解群的一个新的判定,又利用群G的F-剩余子群G~F的性质以及群G的准素数子群的τ-拟置换性得到了群G的半直积结构     

Hall广义补和群的可解性

研究具有某些特殊性质的广义补,得到了一些可解性的判别条件.如果对G的任意Sylow p-子群P,p∈{2,3}∩丌(G),NG(P)在G中都存在广义补H使H/D是G/D的Hall子群且H/D为幂零群,其中D=(H∩ⅣG(P))G,那么G可解.     

有限群的$p$-覆盖远离子群及$S$-拟正规嵌入子群

Let G be a finite group, p the smallest prime dividing the order of G and P a Sylow p-subgroup of G. If d is the smallest generator number of P, then there exist maximal subgroups P1, P2,..., Pd of P, denoted by Md(P) = {P1,...,Pd}, such that di=1 Pi = Φ(P), the Frattini subgroup of P. In this paper, we will show that if each member of some fixed Md(P) is either p-cover-avoid or S-quasinormally embedded in G, then G is p-nilpotent. As applications, some further results are obtained.     

关于有限群的S-半置换子群

Let d be the smallest generator number of a finite p-group P and let Md（P） = {P1,...,Pd} be a set of maximal subgroups of P such that ∩di=1 Pi = Φ（P）. In this paper, we study the structure of a finite group G under the assumption that every member in Md（Gp） is S-semipermutable in G for each prime divisor p of ｜G｜ and a Sylow p-subgroup Gp of G.     

子群的S-条件置换性对有限群结构的影响

Let G be a finite group. Fix a prime divisor p of IGI and a Sylow p-subgroup P of G, let d be the smallest generator number of P and Ma（P） denote a family of maximal subgroups P1, P2 , Pd of P satisfying ∩^di=1 Pi = Ф（P）, the Frattini subgroup of P. In this paper, we shall investigate the influence of s-conditional permutability of the members of some fixed .Md（P） on the structure of finite groups. Some new results are obtained and some known results are generalized.     

具有弱$s$-置换嵌入子群的有限群

Let P be a Sylow p-subgroup of a group G with the smallest generator number d,where p is a prime.Denote by M_d(P) = {P_1,P_(2,...,)P_d} a set of maximal subgroups of P such that φ(P) = ∩_(n=1)~dP_n.In this paper,we investigate the structure of a finite group G under the assumption that the maximal subgroups in M_d(P) are weakly s-permutably embedded in G,some interesting results are obtained which generalize some recent results.Finally,we give some further results in terms of weakly s-permutably embedded subgroups.     

High-Dimensional Shape Fitting in Linear Time

Let $P$ be a set of $n$ points in $\Re^d$. The {\em radius} of a $k$-dimensional flat ${\cal F}$ with respect to $P$, which we denote by ${\cal RD}({\cal F},P)$, is defined to be $\max_{p \in P} \mathop{\rm dist}({\cal F},p)$, where $\mathop{\rm dist}({\cal F},p)$ denotes the Euclidean distance between $p$ and its projection onto ${\cal F}$. The $k$-flat radius of $P$, which we denote by ${R^{\rm opt}_k}(P)$, is the minimum, over all $k$-dimensional flats ${\cal F}$, of ${\cal RD}({\cal F},P)$. We consider the problem of computing ${R^{\rm opt}_k}(P)$ for a given set of points $P$. We are interested in the high-dimensional case where $d$ is a part of the input and not a constant. This problem is NP-hard even for $k = 1$. We present an algorithm that, given $P$ and a parameter $0 < \eps \leq 1$, returns a $k$-flat ${\cal F}$ such that ${\cal RD}({\cal F},P) \leq (1 + \eps) {R^{\rm opt}_k}(P)$. The algorithm runs in $O(nd C_{\eps,k})$ time, where $C_{\eps,k}$ is a constant that depends only on $\eps$ and $k$. Thus the algorithm runs in time linear in the size of the point set and is a substantial improvement over previous known algorithms, whose running time is of the order of $d n^{O(k/\eps^c)}$, where $c$ is an appropriate constant.     

$p$-子群具有$p$-超可解正规化子的有限群

在已有研究中,对于$p$-子群的正规化子而言,它的$p$-幂零性质对有限$p$-幂零群的结构具有重要的影响. 本文中, 设$P$是群$G$的西罗$p$-子群, $1\leq p^d<|P|$, 对于$P$的每个阶为$p^d$的正规子群$H$H,将$N_G(H)$的$p$-幂零性质减弱为$p$-超可解性质,结合$H$的弱$M$-可补充性质,探究$p$-超可解群的结构.同时,在$N_G(P)$是$p$-幂零的条件下,利用子群$K$的弱$M$-可补充条件研究群的$p$-幂零性质,其中$K_p\leq K$且$P''\leq K_p\leq \Phi(P)$. $K_p$是$K$的西罗$p$-子群.在一定程度上,主要结果推广了Frobenius定理.     

树的导出匹配覆盖

The induced matching cover number of a graph G without isolated vertices,denoted by imc(G),is the minimum integer k such that G has k induced matchings M1,M2,…,Mk such that,M1∪M2 ∪…∪Mk covers V(G).This paper shows if G is a nontrivial tree,then imc(G) ∈ {△*0(G),△*0(G) + 1,△*0(G)+2},where △*0(G) = max{d0(u) + d0(v) :u,v ∈ V(G),uv ∈ E(G)}.     

NASH EQUILIBRIUM OF TWO GAME MODELS ON THE RANDOM SOCIAL NETWORK

A graph $G$ is $k$-triangular if each of its edge is contained in at least $k$ triangles. It is conjectured that every 4-edge-connected triangular graph admits a nowhere-zero 3-flow. A triangle-path in a graph $G$ is a sequence of distinct triangles $T_1 T_2\cdots T_k$ in $G$ such that for $1\leq i\leq k-1, |E(T_i )\cap E(T_{i+1})|=1$ and $E(T_i)\cap E(T_j)=\emptyset$ if $j>i+1$. Two edges $e,e''\in E(G)$ are triangularly connected if there is a triangle-path $T_1,T_2,\cdots, T_k$ in $G$ such that $e\in E(T_1)$ and $e''\in E(T_k)$. Two edges $e,e''\in E(G)$ are equivalent if they are the same, parallel or triangularly connected. It is easy to see that this is an equivalent relation. Each equivalent class is called a triangularly connected component. In this paper, we prove that every 4-edge-connected triangular graph $G$ is ${\mathbb Z}_3$-connected, unless it has a triangularly connected component which is not ${\mathbb Z}_3$-connected but admits a nowhere-zero 3-flow.     

一个六点七边图的填充与覆盖

$\lambda{K_v}$为$\lambda$重$v$点完全图, $G$ 为有限简单图. $\lambda {K_v}$ 的一个 $G$-设计 ( $G$-填充设计, $G$-覆盖设计), 记为 ($v,G,\lambda$)-$GD$(($v,G,\lambda$)-$PD$, ($v,G,\lambda$)-$CD$), 是指一个序偶($X,\calB$)，其中 $X$ 为 ${K_v}$ 的顶点集， $\cal B$ 为 ${K_v}$ 中同构于 $G$的子图的集合, 称为区组集,使得 ${K_v     

增益图与其底图的正惯性指数之间的关系

设$\mathbb{T}$是模为1的复数乘法子群.图$G=(V,E)$,这里$V,E$分别表示图的点和边.增益图是将底图中的每条边赋于$\mathbb{T}$中的某个数值$\varphi(v_iv_j)$,且满足$\varphi(v_iv_j) =\overline{\varphi(v_jv_i)}$.将赋值以后的增益图表示为$(G,\varphi)$.设$i_+(G,\varphi)$和$i_+(G)$分别表示增益图与底图的正惯性指数,本文证明了如下结论: $$ - c( G ) \le {i_ + } ( {G,\varphi } ) - {i_ + }( G ) \le c( G ), $$ 这里$c(G)$表示圈空间维数,并且刻画了等号成立时候的所有极图.