首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 921 毫秒
1.
2.
3.
4.
5.
Let p>3 be a prime. For each maximal subgroup H?GL(d,p) with |H|?p3d+1, we construct a d-generator finite p-group G with the property that Aut(G) induces H on the Frattini quotient G/Φ(G) and |G|?pd42. A significant feature of this construction is that |G| is very small compared to |H|, shedding new light upon a celebrated result of Bryant and Kovács. The groups G that we exhibit have exponent p, and of all such groups G with the desired action of H on G/Φ(G), the construction yields groups with smallest nilpotency class, and in most cases, the smallest order.  相似文献   

6.
We consider the finite exceptional group of Lie type G=E6ε(q) (universal version) with 3|q?ε, where E6+1(q)=E6(q) and E6?1(q)=2E6(q). We classify, up to conjugacy, all maximal-proper 3-local subgroups of G, that is, all 3-local M<G which are maximal with respect to inclusion among all proper subgroups of G which are 3-local. To this end, we also determine, up to conjugacy, all elementary-abelian 3-subgroups containing Z(G), all extraspecial subgroups containing Z(G), and all cyclic groups of order 9 containing Z(G). These classifications are an important first step towards a classification of the 3-radical subgroups of G, which play a crucial role in many open conjectures in modular representation theory.  相似文献   

7.
8.
9.
10.
11.
Let V be an n-dimensional vector space over the finite field consisting of q elements and let Γk(V) be the Grassmann graph formed by k-dimensional subspaces of V, 1<k<n1. Denote by Γ(n,k)q the restriction of Γk(V) to the set of all non-degenerate linear [n,k]q codes. We show that for any two codes the distance in Γ(n,k)q coincides with the distance in Γk(V) only in the case when n<(q+1)2+k2, i.e. if n is sufficiently large then for some pairs of codes the distances in the graphs Γk(V) and Γ(n,k)q are distinct. We describe one class of such pairs.  相似文献   

12.
We consider a tournament T=(V,A). For X?V, the subtournament of T induced by X is T[X]=(X,A(X×X)). An interval of T is a subset X of V such that, for a,bX and xV?X, (a,x)A if and only if (b,x)A. The trivial intervals of T are ?, {x}(xV) and V. A tournament is indecomposable if all its intervals are trivial. For n?2, W2n+1 denotes the unique indecomposable tournament defined on {0,,2n} such that W2n+1[{0,,2n?1}] is the usual total order. Given an indecomposable tournament T, W5(T) denotes the set of vV such that there is W?V satisfying vW and T[W] is isomorphic to W5. Latka [6] characterized the indecomposable tournaments T such that W5(T)=?. The authors [1] proved that if W5(T)?, then |W5(T)|?|V|?2. In this note, we characterize the indecomposable tournaments T such that |W5(T)|=|V|?2.  相似文献   

13.
14.
15.
16.
17.
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. The matrix D(G)+A(G) is called the signless Laplacian matrix of G. The spectrum of the matrix D(G)+A(G) is called the Q-spectrum of G. A graph is said to be determined by its Q-spectrum if there is no other non-isomorphic graph with the same Q-spectrum. In this paper, we prove that all starlike trees whose maximum degree exceed 4 are determined by their Q-spectra.  相似文献   

18.
For a singularly perturbed nonlinear elliptic equation ε2Δu?V(x)u+up=0, xRN, we prove the existence of bump solutions concentrating around positive critical points of V when nonnegative V is not identically zero for p(NN?2,N+2N?2) or nonnegative V satisfies liminf|x|V(x)|x|2log|x|>0 for p=NN?2.  相似文献   

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

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