首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 104 毫秒
1.
Using the classification of finite simple groups, we prove that if H is an insoluble normal subgroup of a finite group G, then H contains a maximal soluble subgroup S such that G=HNG(S). Thereby Problem 14.62 in the Kourovka Notebook is given a positive solution. As a consequence, it is proved that in every finite group, there exists a subgroup that is simultaneously a -projector and a -injector in the class, , of all soluble groups.  相似文献   

2.
An ordinary tetrahedron group is a group with a presentati on of the form
where e i 2 and f i 2 for each i. Following Vinberg, we call groups defined by a presentation of the form
where each R i (a, b) is a cyclically reduced word involving both a and b, generalized tetrahedron groups. These groups appear in many contexts, not least as subgroups of generalized triangle groups.In this paper, we build on previous work to start on a complete classification as to which generalized tetrahedron groups are finite; here we treat the case where at least one of the f i is greater than three.  相似文献   

3.
Let C be an Abelian group. An Abelian group A in some class of Abelian groups is said to be C H-definable in the class if, for any group B\in , it follows from the existence of an isomorphism Hom(C,A) Hom(C,B) that there is an isomorphism A B. If every group in is C H-definable in , then the class is called an C H-class. In the paper, conditions are studied under which a class of completely decomposable torsion-free Abelian groups is a C H-class, where C is a completely decomposable torsion-free Abelian group.  相似文献   

4.
An automorphism of a group X is said to be quadratic if there exist integers and such that for any . If is a Frobenius group then an element is said to be quadratic if induces, by conjugation in the core of , a quadratic automorphism. By definition, a group H acts on a group F freely if for and only with or . It is proved that a Frobenius group generated by two quadratic elements is finite and its core is commutative. In particular, any Frobenius group generated by two elements of order at most 4 is finite. Also we argue that a Frobenius group with finitely generated soluble core is finite. The results mentioned are used to show that a group acting freely on an Abelian group is finite if it is generated by elements of order 3, and the order of a product of every two elements of order 3 in is finite.  相似文献   

5.
Let be a finite-dimensional hereditary algebra over a finite field k, () and () be, respectively, the Hall algebra and the composition algebra of , be the isomorphism classes of finite dimensional -modules and I the isomorphism classes of simple -modules. We define and , in , to be the right and left derivations of () respectively. By using these derivations and the action of the braid group on the set of exceptional sequences of -mod, we provide an effective algorithm of calculating the root vectors of real Schur roots. This means that we get an inductive method to express u as the combinations of elements ui in the Hall algebra, where i I and in is any exceptional -module. Because of the canonical isomorphism between the Drinfeld–Jimbo quantum group and the generic composition algebra, our algorithm is applicable directly to quantum groups. In particular, all the root vectors are obtained in this way in the finite type cases.  相似文献   

6.
7.
Superlocals in Symmetric and Alternating Groups   总被引:1,自引:0,他引:1  
On Aschbacher's definition, a subgroup N of a finite group is called a -superlocal for a prime if . We describe the -superlocals in symmetric and alternating groups, thereby resolving part way Problem 11.3 in the Kourovka Notebook [3].  相似文献   

8.
Basics and results on groups of computable automorphisms are collected in [1].We recall the main definitions. A computable model
is a model in which A is a computable subset of the set ! of natural numbers, the mappings i 7! ni(the number of arguments of fi) and i mi (the number of arguments of Pi) are computable, andall operations fi and predicates Pi are computable uniformly in i. A computable automorphism ofa computable model M is an automorphism of which is a computable function on its universe. Allsuch automorphisms form a group denoted by Autc .  相似文献   

9.
We study into the question of whether a partial order can be induced from a partially right-ordered group onto a space of right cosets of w.r.t. some subgroup of . Examples are constructed showing that the condition of being convex for in is insufficient for this. A necessary and sufficient condition (in terms of a subgroup and a positive cone of ) is specified under which an order of can be induced onto . Sufficient conditions are also given. We establish properties of the class of partially right-ordered groups for which is partially ordered for every convex subgroup , and properties of the class of groups such that is partially ordered for every partial right order on and every subgroup that is convex under .  相似文献   

10.
A sufficient condition for the residual p-finiteness (approximability by the class of finite p-groups) of a free product G = (A * B; H) of groups A and B with a normal amalgamated subgroup H is obtained. This condition is used to prove that if A and B are extensions of residually -groups by -groups, where stands for the class of finitely generated torsion-free nilpotent groups, and if H is a normal p′-isolated polycyclic subgroup, then the group G is residually p-finite (i.e., residually -group), provided the quotient group G/H p H′ is residually p-finite.__________Translated from Matematicheskie Zametki, vol. 78, no. 1, 2005, pp. 125–131.Original Russian Text Copyright © 2005 by E. V. Sokolov.  相似文献   

11.
Let be two edge-colored graphs (without multiple edges or loops). A homomorphism is a mapping : for which, for every pair of adjacent vertices u and v of G 1, (u) and (v) are adjacent in G 2 and the color of the edge (u)(v) is the same as that of the edge uv.We prove a number of results asserting the existence of a graphG , edge-colored from a set C, into which every member from a given class of graphs, also edge-colored from C, maps homomorphically.We apply one of these results to prove that every three-dimensional hyperbolic reflection group, having rotations of orders from the setM ={m1, m2,..., mk}, has a torsion-free subgroup of index not exceeding some bound, which depends only on the setM .  相似文献   

12.
13.
Crossed Modules and Quantum Groups in Braided Categories   总被引:2,自引:0,他引:2  
Let A be a Hopf algebra in a braided category . Crossed modules over A are introduced and studied as objects with both module and comodule structures satisfying a compatibility condition. The category of crossed modules is braided and is a concrete realization of a known general construction of a double or center of a monoidal category. For a quantum braided group the corresponding braided category of modules is identified with a full subcategory in . The connection with cross products is discussed and a suitable cross product in the class of quantum braided groups is built. Majid–Radford theorem, which gives equivalent conditions for an ordinary Hopf algebra to be such a cross product, is generalized to the braided category. Majid's bosonization theorem is also generalized.  相似文献   

14.
We prove a theorem on possible test rank values for groups of the form . It is shown that test rank of a free polynilpotent group is equal to or , for any and every collection of classes. Moreover, for and .  相似文献   

15.
The concept of spin model is due to V. F. R. Jones. The concept of nonsymmetric spin model, which generalizes that of the original (symmetric) spin model, is defined naturally. In this paper, we first determine the diagonal matrices T satisfying the modular invariance or the quasi modular invariance property, i.e., or (respectively), for the character table P of the group association scheme of a cyclic group G of order m. Then we show that a (symmetric or nonsymmetric) spin model on G is constructed from each of the matrices T satisfying the modular or quasi modular invariance property.  相似文献   

16.
We settle Question 10.61, posed by A. Sozutov in the Kourovka Notebook, for the case where .  相似文献   

17.
We study connected Lie groups whose Lie algebra is obtained as the tensor product of a real associative algebra and the algebra of quaternions. It is proved that they carry a natural integrable -structure. We endow such quaternionic Lie groups with a left-invariant Hermitian metric and study the identity connected component of their isometry groups. The determination of such identity connected component is illustrated with a family of examples.  相似文献   

18.
Let be a class of groups. Given a group G, assign to G some set of its subgroups =(G). We say that is a G-covering system of subgroups for (or, in other words, an -covering system of subgroups in G) if G whenever either =Ø or Ø and every subgroup in belongs to . We find the systems of subgroups in the class of finite soluble groups G which are simultaneously the G-covering systems of subgroups for the classes of p-supersoluble and p-nilpotent groups.  相似文献   

19.
For an arbitrary variety of groups and an arbitrary class of groups that is closed on quotient groups, we prove that a quotient group G/N of the group G possesses an invariant system with - and -factors (respectively, is a residually -group) if G possesses an invariant system with - and -factors (respectively, is a residually -group) and N (respectively, N is a maximal invariant -subgroup of the group G).  相似文献   

20.
We study the filling length function for a finite presentation of a group , and interpret this function as an optimal bound on the length of the boundary loop as a van Kampen diagram is collapsed to the basepoint using a combinatorial notion of a null-homotopy. We prove that filling length is well behaved under change of presentation of . We look at 'AD-pairs' (f,g) for a finite presentation : that is, an isoperimetric function f and an isodiametric function g that can be realised simultaneously. We prove that the filling length admits a bound of the form [g+1][log (f+1)+1] whenever (f,g) is an AD-pair for . Further we show that (up to multiplicative constants) if is an isoperimetric function ( ) for a finite presentation then ( ) is an AD-pair. Also we prove that for all finite presentations filling length is bounded by an exponential of an isodiametric function.Partially supported by NSF grant DMS-9800158Supported by EPSRC Award No. 98001683 and Corpus Christi College, Oxford.  相似文献   

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

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