Nonsolvable D 2-groups

Let G be a finite group. Let Irr₁(G) be the set of nonlinear irreducible characters of G and cd₁(G) the set of degrees of the characters in Irr₁(G). A group G is said to be a D₂-group if |cd₁(G)| = |Irr₁(G)| - 2. The main purpose of this paper is to classify nonsolvable D₂-groups.     

最大2-正则诱导子图的长度

设G是2-连通图，c(G)是图G的最长诱导圈的长度，c′(G)是图G的最长诱导2-正则子图的长度。本文我们用图的特征值给出了c(G)和c′(G)的几个上界。     

用$\tau_e(L_2(16))$刻画$L_2(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).     

Solvable D_2-Groups

Let G be a finite group, Irr_1(G) be the set of nonlinear irreducible characters of G and cd_1(G) the set of degrees of the characters in Irr_1(G). A group G is said to be a D_2-group if |cd_1(G)| =|Irr_1(G)|-2. In this paper, we give a complete classification of solvable D_2-groups.     

2-divisibility of Some Odd Hole Free Graphs

Acta Mathematicae Applicatae Sinica, English Series - Let G be a graph. We say that G is 2-divisible if for each induced subgraph H of G, either V(H) is a stable set, or V(H) can be partitioned...     

Finite neofields and 2-transitive groups

Let N be a finite neofield distinct from the Galois field and let G be a group generated by right translations x→x+a of an additive loop of N. We prove that, except for four particular cases, G=S_N or G=A_N holds. Translated fromAlgebra i Logika, Vol. 36, No. 2, pp. 166–193, March–April, 1997.     

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.     

Finite simple groups whose Sylow 2-subgroups possess an extra-special subgroup of index 2

Let G be a finite simple group with Sylow 2-subgroup T. If there is an extra-special sub-group of index 2 in T, then G is isomorphic to one of the following groups: $$\mathop {M_{11,} }\limits_{U_3 (q),}$$ for an appropriate odd q.     

Wreath Hurwitz numbers, colored cut-and-join equations, and 2-Toda hierarchy

Let G be arbitrary finite group,define H G· (t;p +,p) to be the generating function of G-wreath double Hurwitz numbers.We prove that H G· (t;p +,p) satisfies a differential equation called the colored cutand-join equation.Furthermore,H G·(t;p +,p) is a product of several copies of tau functions of the 2-Toda hierarchy,in independent variables.These generalize the corresponding results for ordinary Hurwitz numbers.     

带弦圈的最小2宽直径

设k为正整数,G是简单k连通图.图G的k宽直径,dk(G),是指最小的整数ι使得对任意两不同顶点x,y∈V(G),都存在k条长至多为ι的内部不交的连接x和y的路.用C(n,t)表示在圈Gn上增加t条边所得的图.定义h(n,t):min{d2(C(n,t))}.本文给出了h(n,2)=[n/2].而且,给出了当t较大时h(n,t)的界.     

关于可解区组传递的2-(56,7,1)设计

设G是设计2-(5~6,7,1)的一个可解区传递自同构群,则G是旗传递的且G■A■L(1,5~6)．     

包含紧算子理想的Toeplitz算子代数的刻画

设G为一个torsion-free的离散群,（G,G＋）为一个拟序群,记T^G (G)为相应的Toeplitz算子代数,K(l^2(G 1)为l^2(G )上的紧算子全体,本文证明了K(l^2(G ))增包含于T^G (G)当且仅当下列两个条件时满足。（1）（G,G＋）为一个序群,（2）G中存在一个最小的正元。     

The quasi-isometry classification of rank one lattices

Let X be a symmetric space—other than the hyperbolic plane—of strictly negative sectional curvature. Let G be the isometry group of X. We show that any quasi-isometry between non-uniform lattices in G is equivalent to (the restriction of) a group element of G which commensurates one lattice to the other. This result has the following corollaries:

1. Two non-uniform lattices in G are quasi-isometric if and only if they are commensurable.
2. Let Γ be a finitely generated group which is quasi-isometric to a non-uniform lattice in G. Then Γ is a finite extension of a non-uniform lattice in G.
3. A non-uniform lattice in G is arithmetic if and only if it has infinite index in its quasi-isometry group.

     

On the conjugacy classes in maximal unipotent subgroups of simple algebraic groups

Let G be a simple algebraic group over the algebraically closed field k of characteristic p ≥ 0. Assume p is zero or good for G. Let B be a Borel subgroup of G; we write U for the unipotent radical of B and u for the Lie algebra of U. Using relative Springer isomorphisms} we analyze the adjoint orbits of U in u. In particular, we show that an adjoint orbit of U in u contains a unique so-called minimal representative. In case p > 0, assume G is defined and split over the finite field of p elements F_p. Let q be a power of p and let G(q) be the finite group of F_q-rational points of G. Let F be the Frobenius morphism such that G(q) = G^F. Assume B is F-stable, so that U is also F-stable and U(q) is a Sylow p-subgroup of G(q). We show that the conjugacy classes of U(q) are in correspondence with the F-stable adjoint orbits of U in u. This allows us to deduce results about the conjugacy classes of U(q).     

图中相互独立的4圈和含4个点的路

设k是一个正整数，G是一个顶点数为|G|=4k的图. 假设σ\-2(G)≥4k-1, 则G有一个支撑子图含k-1个4圈和一条顶点数为4的路，使得所有这些圈和路都是相互独立的. 设G=(V\-1,V \-2;E)是一个二分图使得|V\-1|=|V\-2|=2k. 如果对G中每一对满足x∈V\-1和y∈V\-2的不 相邻的顶点x和y 都有d(x)+d(y)≥2k+1, 则G包含k-1个相互独立的4圈和一条顶点数为4的路，使得所有这些圈和路都是相互独立的，并且此度条件是最好的.     

The domination game played on diameter 2 graphs

Aequationes mathematicae - Let $$\gamma _g(G)$$ be the game domination number of a graph G. It is proved that if $$\mathrm{diam}(G) = 2$$ , then $$\gamma _g(G) \le \left\lceil \frac{n(G)}{2}...     

2—（v,7,1） 设计的可解区传递自同构群

设G是一个2－（v,7,1)设计的可解区传递自同构群,则G是点－本原,且下列之一成立：（1）v=7^n,G是旗－传递的;（2）v=5^6,G=Z5^6:H,这里H是GL（6,5）的可解且不可约的子群;（3）v=p^n,P≤ALT(1,p^n)。特别地,p≠2且p^n≡1(mod42)。     

无限的可解SD_2－群（Ⅱ）──有限剩余情形

如果对多重循环群Ｇ的每个有限剩余的真子群都是可以由二元生成的，那么我们就把Ｇ叫做ＲＤ＿２－群。在本文里，我们确定了无限的ＲＤ＿２－群的结构，证明了ＲＤ＿２－群是可以由二元生成的。这些结果推广了作者已经得到的关于无限的可解ＳＤ＿２群的全部结果，见［４］．     

Neighbor distinguishing total choice number of sparse graphs via the Combinatorial Nullstellensatz

Acta Mathematicae Applicatae Sinica, English Series - Let G = (V,E) be a graph and ϕ: V ∪E → {1, 2, · · ·, k} be a total-k-coloring of G. Let f(v)(S(v)) denote the...     

2-连通无爪图的连通因子

若图G不含有同构于K1,3的导出子图,则称G为一个无爪图.令a和b是两个整数满足2≤a≤b.本文证明了若G是一个含有[a,b]因子的2连通无爪图,则G有一个连通的[a,b 1]因子.