首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let G be a group, and let α be a regular automorphism of order p2 of G, where p is a prime. If G is polycyclic-by-finite and the map ϕ : G G defined by gϕ= [g,α] is surjective, then G is soluble. If G is polycyclic, then CG(αp) and G/[G,αp] are both nilpotent-by-finite.  相似文献   

2.
The prime graph of a finite group G, which is denoted by GK(G), is a simple graph whose vertex set is comprised of the prime divisors of |G| and two distinct prime divisors p and q are joined by an edge if and only if there exists an element of order pq in G. Let p12<?<pk be all prime divisors of |G|. Then the degree pattern of G is defined as D(G) = (degG(p1), degG(p2), ? , degG(pk)), where degG(p) signifies the degree of the vertex p in GK(G). A finite group H is said to be OD-characterizable if G? H for every finite group G such that |G| = |H| and D(G) = D(H). The purpose of this article is threefold. First, it finds sharp upper and lower bounds on ?(G), the sum of degrees of all vertices in GK(G), for any finite group G (Theorem 2.1). Second, it provides the degree of vertices 2 and the characteristic p of the base field of any finite simple group of Lie type in their prime graphs (Propositions 3.1-3.7). Third, it proves the linear groups L4(q), q = 19, 23, 27, 29, 31, 32, and 37, are OD-characterizable (Theorem 4.2).  相似文献   

3.
Lim  Meng Fai 《数学学报(英文版)》2019,35(9):1481-1490
Let p be an odd prime and F a p-adic Lie extension of a number field F with Galois group G. Suppose that G is a compact pro-p p-adic Lie group with no torsion and that it contains a closed normal subgroup H such that G/H ≅Zp. Under various assumptions, we establish asymptotic upper bounds for the growth of p-exponents of the class groups in the said p-adic Lie extension. Our results generalize a previous result of Lei, where he established such an estimate under the assumption that H ≅Zp.  相似文献   

4.
5.
Let G be a finite group, p be a prime divisor of |G|, and P be a Sylow p-subgroup of G. We prove that P is normal in a solvable group G if |G : ker φ|p' = φ(1)p' for every nonlinear irreducible monomial p-Brauer character φ of G, where ker φ is the kernel of φ and φ(1)p' is the p'-part of φ(1).  相似文献   

6.
LetF be a field with (nontrivial) involution (i.e.F-conjugation). A nonsingular matrix Aover Fis called a complic F-cosquare provided A=S*-1for some matrix Sover Fand is called p.i. (pseudo-involutory) provided A=A-1 It is shown that Ais a complic F-cosquare iff Ais the product of two p.i. matrices over Fand that det (AA)=1 iff Ais the product of two complic F-cosquares (hence iff A is the product of four p.i. matrices over F). It is conjectured that, except for one obvious case (2 x 2 matrices over the field of order 2), every unimodular matrix A over an arbitrary field Fis a product S1ST:1T with S1 and Tover FThis conjecture is proved for matricesAof order ≤3.  相似文献   

7.
A construction is given for a (p2a(p+1),p2,p2a+1(p+1),p2a+1,p2a(p+1)) (p a prime) divisible difference set in the group H×Z2pa+1 where H is any abelian group of order p+1. This can be used to generate a symmetric semi-regular divisible design; this is a new set of parameters for λ1≠0, and those are fairly rare. We also give a construction for a (pa−1+pa−2+…+p+2,pa+2, pa(pa+pa−1+…+p+1), pa(pa−1+…+p+1), pa−1(pa+…+p2+2)) divisible difference set in the group H×Zp2×Zap. This is another new set of parameters, and it corresponds to a symmetric regular divisible design. For p=2, these parameters have λ12, and this corresponds to the parameters for the ordinary Menon difference sets.  相似文献   

8.
We introduce a new class of plane figures: the sequences of tailed column-convex polyominoes (for short: stapoes). Let G(x, y) and I(x, y) denote the perimeter generating functions for column-convex polyominoes and stapoes, respectively. It will be clear from the definitions that G(x, y) is a simple fraction of I(x, y). But this latter function can be DSV-computed by solving just one quadratic equation (and not a system of quadratic equations). Thus the formula for G(x, y) can be obtained with ease.  相似文献   

9.
G的pebbling数f(G)是最小的整数n,使得不论n个pebble如何放置在G的顶点上,总可以通过一系列的pebbling移动把1个pebble移到任意一个顶点上,其中一个pebbling移动是从一个顶点处移走两个pebble而把其中的一个移到与其相邻的一个顶点上。Graham猜想对于任意的连通图G和H有f(G×H)f(G)f(H)。多扇图Fn1,n2,…,nm是指阶为n1+n2+…+nm+1的联图P1∨(Pn1∪Pn2∪…∪Pnm)。本文首先给出了多扇图的pebbling数,然后证明了多扇图Fn1,n2,…,nm具有2-pebbling性质,最后论述了对于一个多扇图和一个具有2-pebbling性质的图的乘积来说,Graham猜想是成立的。作为一个推论,当G和H都是多扇图时,Graham猜想成立。  相似文献   

10.
Let Knbe the convex set of n×npositive semidefinite doubly stochastic matrices. If Aε kn, the graph of A,G(A), is the graph on n vertices with (i,j) an edge if aij ≠ 0ij. We are concerned with the extreme points in Kn. In many cases, the rank of Aand G(A) are enough to determine whether A is extreme in Kn. This is true, in particular, if G(A)is a special kind of nonchordal graph, i.e., if no two cycles in G(A)have a common edge.  相似文献   

11.
Let G be a nonsolvable group and Irr(G) the set of irreducible complex characters of G. We consider the nonsolvable groups whose character degrees have special 2-parts and prove that if χ(1)2 = 1 or |G|2 for every χ ∈ Irr(G), then there exists a minimal normal subgroup N of G such that N ≅ PSL(2, 2n) and G/N is an odd order group.  相似文献   

12.
Let {pk}k≥3 be a sequence of nonnegative integers which satisfies 8 + Σk≥3 (k-4) pk = 0 and p4p3. Then there is a convex 4-valent polytope P in E3 such that P has exactly pk k-gons as faces. The inequality p4p3 is the best possible in the sense that for c < 1 there exist sequences that are not 4-realizable that satisfy both 8 + Σk ≥3 (k - 4) pk = 0 and p4 > cp3. When Σk ≥ 5 pk ≠ 1, one can make the stronger statement that the sequence {pk} is 4-reliazable if it satisfies 8 + Σk ≥ 3 (k - 4) pk = 0 and p4 ≥ 2Σk ≥ 5 pk + max{k ¦ pk ≠ 0}.  相似文献   

13.
Let G be a solvable block transitive automorphism group of a 2−(v,5,1) design and suppose that G is not flag transitive. We will prove that
(1) if G is point imprimitive, then v=21, and GZ21:Z6;
(2) if G is point primitive, then GAΓL(1,v) and v=pa, where p is a prime number with p≡21 (mod 40), and a an odd integer.
  相似文献   

14.
Let p be an odd prime, and D2p =<a, b|ap = b2 = 1, bab = a-1 the dihedral group of order 2p. In this paper, we completely classify the cubic Cayley graphs on D2p up to isomorphism by means of spectral method. By the way, we show that two cubic Cayley graphs on D2p are isomorphic if and only if they are cospectral. Moreover, we obtain the number of isomorphic classes of cubic Cayley graphs on D2p by using Gauss' celebrated law of quadratic reciprocity.  相似文献   

15.
An expression for the C4 inverse of a differential matrix Ais given whenever that inverse is differentiable.  相似文献   

16.
Let p be an odd prime and q = 2(p-1).Up to total degree t-s max{(5p~3+ 6p~2+ 6 p +4)q-10,p~4q},the generators of H~(s,t)(U(L)),the cohomology of the universal enveloping algebra of a bigraded Lie algebra L,are determined and their convergence is also verified.Furthermore our results reveal that this cohomology satisfies an analogous Poinare duality property.This largely generalizes an earlier classical results due to J.P.May.  相似文献   

17.
For a 1-dependent stationary sequence {Xn} we first show that if u satisfies p1=p1(u)=P(X1>u)0.025 and n>3 is such that 88np131, then
P{max(X1,…,Xn)u}=ν·μn+O{p13(88n(1+124np13)+561)}, n>3,
where
ν=1−p2+2p3−3p4+p12+6p22−6p1p2,μ=(1+p1p2+p3p4+2p12+3p22−5p1p2)−1
with
pk=pk(u)=P{min(X1,…,Xk)>u}, k1
and
|O(x)||x|.
From this result we deduce, for a stationary T-dependent process with a.s. continuous path {Ys}, a similar, in terms of P{max0skTYs<u}, k=1,2 formula for P{max0stYsu}, t>3T and apply this formula to the process Ys=W(s+1)−W(s), s0, where {W(s)} is the Wiener process. We then obtain numerical estimations of the above probabilities.  相似文献   

18.
Given an edge-weighted tree T and an integer p1, the minmax p-traveling salesmen problem on a tree T asks to find p tours such that the union of the p tours covers all the vertices. The objective is to minimize the maximum of length of the p tours. It is known that the problem is NP-hard and has a (2−2/(p+1))-approximation algorithm which runs in O(pp−1np−1) time for a tree with n vertices. In this paper, we consider an extension of the problem in which the set of vertices to be covered now can be chosen as a subset S of vertices and weights to process vertices in S are also introduced in the tour length. For the problem, we give an approximation algorithm that has the same performance guarantee, but runs in O((p−1)!·n) time.  相似文献   

19.
设G为有限群,称G的子群H为ss-置换子群,如果存在G的次正规子群B使得G=HB,且H与B的任意Sylow子群可以交换,即对任意X∈Syl(B)有XH=HX.利用子群的ss-置换性来研究有限群的结构,得到有限群超可解的两个充分条件.  相似文献   

20.
Assume p is an odd prime. We investigate finite p-groups all of whose minimal nonabelian subgroups are of order p3. Let P1-groups denote the p-groups all of whose minimal nonabelian subgroups are nonmetacyclic of order p3. In this paper, the P1-groups are classified, and as a by-product, we prove the Hughes' conjecture is true for the P1-groups.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号