Characterization of L2(16) by Τe(L2(16))

Let G be a group and πe(G) the set of element orders of G.Let k∈πe(G) and m k be the number of elements of order k in G.Letτe(G)={mk|k∈πe(G)}.In this paper,we prove that L2(16) is recognizable byτe (L2(16)).In other words,we prove that if G is a group such that τe(G)=τe(L2(16))={1,255,272,544,1088,1920},then G is isomorphic to L2(16).     

OD-CHARACTERIZATION OF ALMOST SIMPLE GROUPS RELATED TO U6（2）

Let G be a finite group and π(G) = { p 1 , p 2 , ··· , p k } be the set of the primes dividing the order of G. We define its prime graph Γ(G) as follows. The vertex set of this graph is π(G), and two distinct vertices p, q are joined by an edge if and only if pq ∈π e (G). In this case, we write p ～ q. For p ∈π(G), put deg(p) := |{ q ∈π(G) | p ～ q }| , which is called the degree of p. We also define D(G) := (deg(p 1 ), deg(p 2 ), ··· , deg(p k )), where p 1 < p 2 < ··· < p k , which is called the degree pattern of G. We say a group G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and degree pattern as G. Specially, a 1-fold OD-characterizable group is simply called an OD-characterizable group. Let L := U 6 (2). In this article, we classify all finite groups with the same order and degree pattern as an almost simple groups related to L. In fact, we prove that L and L.2 are OD-characterizable, L.3 is 3-fold OD-characterizable, and L.S 3 is 5-fold OD-characterizable.     

区传递的$2-(v, k, 1)$ 设计与单群$E_6(q)$

This article is a contribution to the study of block-transitive automorphism groups of 2-（v,k,1） block designs. Let D be a 2-（v,k,1） design admitting a block-transitive, pointprimitive but not flag-transitive automorphism group G. Let kr = （k,v-1） and q = pf for prime p. In this paper we prove that if G and D are as above and q （3（krk-kr ＋ 1）f）1/3, then G does not admit a simple group E6（q） as its socle.     

Steinberg triality groups acting on 2 - (v, k, 1) designs

A 2 - (v,k,1) design D = (P, B) is a system consisting of a finite set P of v points and a collection B of k-subsets of P, called blocks, such that each 2-subset of P is contained in precisely one block. Let G be an automorphism group of a 2- (v,k,1) design. Delandtsheer proved that if G is block-primitive and D is not a projective plane, then G is almost simple, that is, T ≤ G ≤ Aut(T), where T is a non-abelian simple group. In this paper, we prove that T is not isomorphic to 3D4(q). This paper is part of a project to classify groups and designs where the group acts primitively on the blocks of the design.     

Affine groups and flag-transitive triplanes

Let D be a nontrivial 2-(v, k, 3) symmetric design (triplane) and let G≤Aut(D) be flag-transitive and point-primitive. In this paper, we prove that if G is an affine group, then G≤AΓL1(q), where q is some power of a prime p and p≥5.     

Haddad和Helou定理的另一结论

Let K be a finite field of characteristic ≠ 2 and G the additive group of K × K. Let k_1, k_2 be integers not divisible by the characteristic p of K with(k_1, k_2) = 1. In 2004, Haddad and Helou constructed an additive basis B of G for which the number of representations of g ∈ G as a sum b_1+ b_2(b_1, b_2 ∈ B) is bounded by 18. For g ∈ G and B■G, let σk_1,k_2(B, g)be the number of solutions of g = k_1b_1 + k_2b_2, where b_1, b_2 ∈ B. In this paper, we show that there exists a set B ? G such that k_1 B + k2 B = G and σk_1,k_2(B, g)≤16.     

Weight Choosability of Graphs with Maximum Degree 4

Let k be a positive integer. A graph G is k-weight choosable if, for any assignment L(e)of k real numbers to each e ∈ E(G), there is a mapping f : E(G) → R such that f(uv) ∈ L(uv) and ■ for each uv ∈ E(G), where ?(v) is the set of edges incident with v. As a strengthening of the famous 1-2-3-conjecture, Bartnicki, Grytczuk and Niwcyk [Weight choosability of graphs. J. Graph Theory, 60, 242–256(2009)] conjecture that every graph without isolated edge is 3-weight choosable. This conjecture is wildly open and it is even unknown whether there is a constant k such that every graph without isolated edge is k-weight choosable. In this paper, we show that every connected graph of maximum degree 4 is 4-weight choosable.     

ON EDGE-HAMILTONIAN PROPERTY OF BI-CAYLEY GRAPHS

Let G be a finite group, and S be a subset of G. The bi-Cayley graph BCay(G, S)of G with respect to S is defined as the bipartite graph with vertex set G × {0, 1} and edge set {(g, 0),(gs, 1)| g ∈ G, s ∈ S}. In this paper, we first provide two interesting results for edge-hamiltonian property of Cayley graphs and bi-Cayley graphs. Next,we investigate the edge-hamiltonian property of Γ = BCay(G, S), and prove that Γis hamiltonian if and only if Γ is edge-hamiltonian when Γ is a connected bi-Cayley graph.     

A new characterization of L 2(r) by their Sylow numbers

Let G be a finite centerless group, let π(G) be the set of prime divisors of the order of G, and let np(G) be the number of Sylow p-subgroups of G, that is, n_p(G) = |Sylp(G)|. Set NS(G) := {n_p(G)| p ∈π(G)}. In this paper, we are investigating whether L_2(r) is determined up to isomorphism by NS(L_2(r)) when r is prime.     

有限伪反射群的相对不变式的 Poincar\'e级数

Let F be a field with characteristic 0, V = Fn the n-dimensional vector space over F and let G be a finite pseudo-reflection group which acts on V . Let χ ： G→ F＊ be a 1- dimensional representation of G. In this article we show that χ（g） = （detg）α（0 ≤ α ≤ r - 1）, where g ∈ G and r is the order of g. In addition, we characterize the relation between the relative invariants and the invariants of the group G, and then we use Molien’s Theorem of invariants to compute the Poincar′e series of relative invariants.     

MULTIPLIERS OF SEGAL ALGEBRAS A_p(G)

Let G be a locally compact but non-compact abelian group,It is proved thatM(A_p(G),L_1(G))=M(G)and M(A_p(G),L_1(G)∩C_0(G))=M(L_1(G),L_1(G)∩C_0(G)).If G is discrete,then M(A_p(G),L_1(G))=A_p(G),M(A_p,(G),L_1(G)∩C_0(G))=A_p(G).     

以PSL(2,q)作为本原自同构群的旗传递对称$(v,k,\lambda)$设计的分类

设$D$是一个非平凡的对称$(v,k,\lambda)$设计, $G$是$D$的一个自同构群.本文证明了如果$G$以二维典型群PSL$(2,q)$作为基柱且在$D$上的作用是旗传递和点本原的,那么设计$D$的参数只能为$(7, 3, 1)$, $(7, 4, 2)$, $(11, 5, 2)$, $(11, 6, 3)$或$(15, 8, 4)$.     

2-极大子群的$F_s$-拟正规性

$F$是一个群系. $G$的子群$H$在$G$中称为$F_s$-拟正规的,如果存在$G$的正规子群$T$,使得$HT$在$G$中是$s$-置换的并且$(H\cap T)H_G/H_G$包含在$G/H_G$的$F$超中心$Z^F_\infty(G/H_G)$中.本文利用$F_s$-拟正规子群研究了有限群的结构.获得了某些新的结果.     

循环群$Z_{2}$的模向量不变式

Let G be the finite cyclic group Z_2 and V be a vector space of dimension 2n with basis x_1,...,x_n,y_1,...,y_n over the field F with characteristic 2.If σ denotes a generator of G,we may assume that σ（x_i）= ayi,σ（y_i）= a～-1x_i,where a ∈ F.In this paper,we describe the explicit generator of the ring of modular vector invariants of F[V]～G.We prove that F[V]～G = F[l_i = x_i ＋ ay_i,q_i = x_iy_i,1 ≤ i ≤ n,M_I = X_I ＋ a～-I-Y_I],where I∈An = {1,2,...,n},2 ≤-I-≤ n.     

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

设$\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)$表示圈空间维数,并且刻画了等号成立时候的所有极图.     

可解群的$\cd(G)-1$个特征标次数构成的图

Let G be a group. We consider the set cd（G）／{m}, where m ∈ cd（G）. We define the graph △（G - m） whose vertex set is p（G - m）, the set of primes dividing degrees in cd（G）／{m}. There is an edge between p and q in p（G - m） ifpq divides a degree a ∈ cd（G）／{m}. We show that if G is solvable, then △（G - m） has at most two connected components.     

有限群的$\Phi$-$\tau$-可补子群

假设$\tau$是一个子群算子, $H$是有限群$G$的一个$p$-子群. 令 $\bar{G}=G/H_{G}$且$\bar{H}=H/H_{G}$, 如果$\bar{G}$有一个次正规子群$\bar{T}$ 和一个包含于$\bar{H}$ 的$\tau$-子群$\bar{S}$满足$\bar{G}=\bar{H}\bar{T}$且$\bar{H}\cap\bar{T}\leq \bar{S}\Phi(\bar{H})$, 就称$H$是$G$的一个$\Phi$-$\tau$- 可补子群. 文章通过讨论群$G$的准素数子群的$\Phi$-$\tau$-可补性给出了超循环嵌入和$p$-幂零性的一些新的特征.     

关于可解区组传递的2-$(5^6,7,1)$设计(英)

设$G$是设计2-$(5^6,7,1)$的一个可解区传递自同构群,则$G$是旗传递的且$G\le A\Gamma L(1,5^6)$.     

L7（3）与GL7（3）的OD-刻画

对于任意一个有限群G,令π（G）表示由它的阶的所有素因子构成的集合.构建一种与之相关的简单图,称之为素图,记作Γ（G）.该图的顶点集合是π（G）,图中两顶点p,g相连（记作p～q）的充要条件是群G恰有pq阶元.设π（G）={P₁,p2,…,p_x}.对于任意给定的p∈π（G）,令deg（p）:=|{q∈π（G）|在素图Γ（G）中,p～q}|,并称之为顶点p的度数.同时,定义D（G）:=（deg（p₁）,deg（p₂）,…,deg（p_s））,其中p₁2<…相似文献