Characterizability of the Group ^2Dp（3） by its Order Components,Where p ≥ 5 is a Prime Number Not of the Form 2^m ＋ 1

The author will prove that the group ^2Dp（3） can be uniquely determined by its order components, where p ≠ 2^m ＋ 1 is a prime number, p ≥ 5. More precisely, if OC（G） denotes the set of order components of G, we will prove OC（G） = OC（^2Dp（3）） if and only if G is isomorphic to ^2Dp（3）. A main consequence of our result is the validity of Thompson＇s conjecture for the groups under consideration.     

OD-characterization of Almost Simple Groups Related to U3（5）

Let G be a finite group with order ｜G｜=p1^α1p2^α2……pk^αk, where p1 〈 p2 〈……〈 Pk are prime numbers. One of the well-known simple graphs associated with G is the prime graph （or Gruenberg- Kegel graph） denoted .by г（G） （or GK（G））. This graph is constructed as follows： The vertex set of it is π（G） = {p1,p2,…,pk} and two vertices pi, pj with i≠j are adjacent by an edge （and we write pi - pj） if and only if G contains an element of order pipj. The degree deg（pi） of a vertex pj ∈π（G） is the number of edges incident on pi. We define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, which is called the degree pattern of G. A group G is called k-fold OD-characterizable if there exist exactly k non- isomorphic groups H such that ｜H｜ = ｜G｜ and D（H） = D（G）. Moreover, a 1-fold OD-characterizable group is simply called OD-characterizable. Let L ：= U3（5） be the projective special unitary group. In this paper, we classify groups with the same order and degree pattern as an almost simple group related to L. In fact, we obtain that L and L.2 are OD-characterizable; L.3 is 3-fold OD-characterizable; L.S3 is 6-fold OD-characterizable.     

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.     

Finite groups with its power automorphism groups having small indices

In this paper, a finite group G with IAut（G） ： P（G）I ~- p or pq is determined, where P（G） is the power automorphism group of G, and p, q are distinct primes. Especially, we prove that a finite group G satisfies ｜Aut（G） ： P（G）｜= pq if and only if Aut（G）/P（G） ≌S3. Also, some other classes of finite groups are investigated and classified, which are necessary for the proof of our main results.     

ON COLEMAN OUTER AUTOMORPHISM GROUPS OF FINITE GROUPS

Let G be a finite group and OutCol(G) the Coleman outer automorphism group of G(for the definition, see below). The question whether OutCol(G) is a p′-group naturally arises from the study of the normalizer problem for integral group rings, where p is a prime.In this article, some sufficient conditions for OutCol(G) to be a p′-group are obtained. Our results generalize some well-known theorems.     

On the Structure of the Units of Group Algebra of Dihedral Group

In this paper, we completely determine the structure of the unit group of the group algebra of some dihedral groups D2 n over the finite field Fpk, where p is a prime.     

最高阶元素个数为 2p2 的有限群是可解群

本文讨论了最高阶元素个数 |M(G)|=2p2(p为素数) 的有限群, 证明了群G是可解群.     

奇数阶亚循环p-群分类的一个证明

一个有限p群p称为亚循环的,如果P有一个循环的正规子群A,使得PA是循环的.1973年King在文[2]中对亚循环p群进行了分类;在文[4,5]中M.F.NewmanandMingYaoXu发现了这些群的新的表示,给出了新的分类方法,这种方法是由p群生成算法(见文[3])得到的.本文的目的是给这些结果的另一种证明,与p群生成算法是不相关的.     

p6阶群的自同构群的阶

In this paper, we determine the order of automorphism group of p-groups in the third family (Φ3 ) and the fourth family (Φ4 ) in [ 1 ], whose order is p^6 ( p ≥ 3). Here p denotes an odd prime.     

On q-n-gonal Klein Surfaces

We consider proper Klein surfaces X of algebraic genus p ≥ 2, having an automorphism φ of prime order n with quotient space X/（φ） of algebraic genus q. These Klein surfaces axe called q-n-gonal surfaces and they are n-sheeted covers of surfaces of algebraic genus q. In this paper we extend the results of the already studied cases n ≤ 3 to this more general situation. Given p ≥ 2, we obtain, for each prime n, the （admissible） values q for which there exists a q-n-gonal surface of algebraic genus p. Furthermore, for each p and for each admissible q, it is possible to check all topological types of q-n-gonal surfaces with algebraic genus p. Several examples are given： q-pentagonal surfaces and q-n-gonal bordered surfaces with topological genus g = 0, 1.     

On the representation of integers by p-adic diagonal forms

Let p be an odd prime, let d be a positive integer such that (d,p?1)=1, let r denote the p-adic valuation of d and let m=1+3+3²+…+3^r. It is shown that for every p-adic integer n the equation Σ_i=1^mX_i^d=n has a nontrivial p-adic solution. It is also shown that for all p-adic units a₁, a₂, a₃, a₄ and all p-adic integers n the equation Σ_i=1⁴a_iX_i^p=n has a nontrivial p-adic solution. A corollary to each of these results is that every p-adic integer is a sum of four pth powers of p-adic integers.     

Small point sets of PG(n, p 3h ) intersecting each line in 1 mod p h points

The main result of this paper is that point sets of PG(n, q), q = p ^3h , p ≥ 7 prime, of size < 3(q ^n-1 + 1)/2 intersecting each line in 1 modulo ${\sqrt[3] q}$ points (these are always small minimal blocking sets with respect to lines) are linear blocking sets. As a consequence, we get that minimal blocking sets of PG(n, p ³), p ≥ 7 prime, of size < 3(p ^3(n-1) + 1)/2 with respect to lines are always linear.     

Small point sets of PG(n, q 3) intersecting each k-subspace in 1 mod q points

The main result of this paper is that point sets of PG(n, q ³), q = p ^h , p ≥ 7 prime, of size less than 3(q ^3(n?k) + 1)/2 intersecting each k-space in 1 modulo q points (these are always small minimal blocking sets with respect to k-spaces) are linear blocking sets. As a consequence, we get that minimal blocking sets of PG(n, p ³), p ≥ 7 prime, of size less than 3(p ^3(n?k) + 1)/2 with respect to k-spaces are linear. We also give a classification of small linear blocking sets of PG(n, q ³) which meet every (n ? 2)-space in 1 modulo q points.     

Solvability of cubic equations in p-ADIC integers (p > 3)

We give a criterion for the existence of solutions to an equation of the form x ³ + ax = b, where a, b ∈ ? _p , in p-adic integers for p > 3. Moreover, in the case when the equation x ³ + ax = b is solvable, we give necessary and sufficient recurrent conditions on a p-adic number x ∈ ?* _p under which x is a solution to the equation.     

Fast algorithms for determining the linear complexities of sequences over GF(p m) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p ? 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m ? 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m ? 1 are coprime) more efficiently.     

The diophantine equation x 2 + 2 a · 17 b = y n

Let ?, ? be the sets of all integers and positive integers, respectively. Let p be a fixed odd prime. Recently, there have been many papers concerned with solutions (x, y, n, a, b) of the equation x ² + 2 ^a p ^b = y ⁿ , x, y, n ε ?, gcd(x, y) = 1, n ? 3, a, b ε ?, a ? 0, b ? 0. And all solutions of it have been determined for the cases p = 3, p = 5, p = 11 and p = 13. In this paper, we mainly concentrate on the case p = 3, and using certain recent results on exponential diophantine equations including the famous Catalan equation, all solutions (x, y, n, a, b) of the equation x ²+2 ^a · 17 ^b = y ⁿ , x, y, n ε ?, gcd(x, y) = 1, n ? 3, a, b ∈ ?, a ? 0, b ? 0, are determined.     

Finite linear spaces with two consecutive line degrees

Let L be a non-trivial finite linear space in which every line has n or n+1 points. We describe L completely subject to the following restrictions on n and on the number of points p: p≤n ²+n?1 and n≥3; n ²+n+2≤p≤n ²+2n?1 and n≥3; p=n ²+2n and n≥4; p=n ²+2n+2 and n≥3; p=n ²+2n+3 and n≥4.     

Pentavalent symmetric graphs of order 2p3

A graph is symmetric or 1-regular if its automorphism group is transitive or regular on the arc set of the graph, respectively. We classify the connected pentavalent symmetric graphs of order 2p~3 for each prime p. All those symmetric graphs appear as normal Cayley graphs on some groups of order 2p~3 and their automorphism groups are determined. For p = 3, no connected pentavalent symmetric graphs of order 2p~3 exist. However, for p = 2 or 5, such symmetric graph exists uniquely in each case. For p 7, the connected pentavalent symmetric graphs of order 2p~3 are all regular covers of the dipole Dip5 with covering transposition groups of order p~3, and they consist of seven infinite families; six of them are 1-regular and exist if and only if 5 |(p- 1), while the other one is 1-transitive but not 1-regular and exists if and only if 5 |(p ± 1). In the seven infinite families, each graph is unique for a given order.     

Semisymmetric graphs of order 6p 2 and prime valency

In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.     

The diophantine equation x3 − 3xy2 − y3 = 1 and related equations

The diophantine equation of the title has been solved by Ljunggren, by indirect use of the p-adic method (use is made of intermediate algebraic extensions). It is generally accepted that an immediate application of the p-adic method for the aforementioned equation is impossible. In this paper, however, this view was overthrown by first solving x² + 3 = 4y³ and then x³ ? 3xy² ? y³ = 1 with direct application of the p-adic method, avoiding the use of intermediate algebraic extensions, fulfilling thus a desire of Professor Mordell. The method used in this paper has a general character, as it is shown in Appendix B, where three more examples are given.