首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
We consider one–factorizations of complete graphs which possess an automorphism group fixing k ≥ 0 vertices and acting regularly (i.e., sharply transitively) on the others. Since the cases k = 0 and k = 1 are well known in literature, we study the case k≥ 2 in some detail. We prove that both k and the order of the group are even and the group necessarily contains k − 1 involutions. Constructions for some classes of groups are given. In particular we extend the result of [7]: let G be an abelian group of even order and with k − 1 involutions, a one–factorization of a complete graph admitting G as an automorphism group fixing k vertices and acting regularly on the others can be constructed.  相似文献   

2.
Semigroups of matrices (over an ordered field) with non-negative entries are considered. A complete characterization is obtained for the semigroups which are minimal transitive on the positive (or non-negative) cone of the underlying vector space. Consequently, an explicit form for the semigroups sharply transitive on the cone is derived.  相似文献   

3.
    
Semigroups of matrices (over an ordered field) with non-negative entries are considered. A complete characterization is obtained for the semigroups which are minimal transitive on the positive (or non-negative) cone of the underlying vector space. Consequently, an explicit form for the semigroups sharply transitive on the cone is derived.  相似文献   

4.
    
The problem of classifying cyclic Steiner quadruple systems (CSQSs) is considered. A computational approach shows that the number of isomorphism classes of such designs with orders 26 and 28 is 52,170 and 1,028,387, respectively. It is further shown that CSQSs of order 2p, where p is a prime, are isomorphic iff they are multiplier equivalent. Moreover, no CSQSs of order less than or equal to 38 are isomorphic but not multiplier equivalent.  相似文献   

5.
    
In this paper, we classify finite permutation groups with a transitive abelian subgroup that are almost simple, quasiprimitive and innately transitive, which extend the results of Li and Praeger that is on finite permutation groups with a transitive cyclic subgroup.  相似文献   

6.
    
For which groups G of even order 2n does a 1‐factorization of the complete graph K2n exist with the property of admitting G as a sharply vertex‐transitive automorphism group? The complete answer is still unknown. Using the definition of a starter in G introduced in 4 , we give a positive answer for new classes of groups; for example, the nilpotent groups with either an abelian Sylow 2‐subgroup or a non‐abelian Sylow 2‐subgroup which possesses a cyclic subgroup of index 2. Further considerations are given in case the automorphism group G fixes a 1‐factor. © 2005 Wiley Periodicals, Inc. J Combin Designs  相似文献   

7.
    
Let be a 2‐factorization of the complete graph Kv admitting an automorphism group G acting doubly transitively on the set of vertices. The vertex‐set V(Kv) can then be identified with the point‐set of AG(n, p) and each 2‐factor of is the union of p‐cycles which are obtained from a parallel class of lines of AG(n, p) in a suitable manner, the group G being a subgroup of A G L(n, p) in this case. The proof relies on the classification of 2‐(v, k, 1) designs admitting a doubly transitive automorphism group. The same conclusion holds even if G is only assumed to act doubly homogeneously. © 2006 Wiley Periodicals, Inc. J Combin Designs  相似文献   

8.
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.  相似文献   

9.
    
We study sharp permutation groups of type {0, k} and observe that, once the isomorphism type of a point stabilizer is fixed, there are only finitely many possibilities for such a permutation group. We then show that a sharp permutation group of type {0, k} in which a point stabilizer is isomorphic to the alternating group on 5 letters must be a geometric group. There is, up to permutation isomorphism, one such permutation group.  相似文献   

10.
    
The purpose in this paper is to complete the classification of primitive sharp permutation groups of type ({0, k}, n) by proving that no such group can be almost simple.  相似文献   

11.
    
《Journal of Graph Theory》2018,87(3):305-316
For a finite set V and a positive integer k with , letting be the set of all k‐subsets of V, the pair is called the complete k‐hypergraph on V, while each k‐subset of V is called an edge. A factorization of the complete k‐hypergraph of index , simply a ‐factorization of order n, is a partition of the edges into s disjoint subsets such that each k‐hypergraph , called a factor, is a spanning subhypergraph of . Such a factorization is homogeneous if there exist two transitive subgroups G and M of the symmetric group of degree n such that G induces a transitive action on the set and M lies in the kernel of this action. In this article, we give a classification of homogeneous factorizations of that admit a group acting transitively on the edges of . It is shown that, for and , there exists an edge‐transitive homogeneous ‐factorization of order n if and only if is one of (32, 3, 5), (32, 3, 31), (33, 4, 5), , and , where and q is a prime power with .  相似文献   

12.
Endomorphisms of superelliptic jacobians   总被引:1,自引:0,他引:1  
Let K be a field of characteristic zero, n ≥ 5 an integer, f(x) an irreducible polynomial over K of degree n, whose Galois group contains a doubly transitive simple non-abelian group. Let p be an odd prime, the ring of integers in the pth cyclotomic field, C f, p : y p  =  f(x) the corresponding superelliptic curve and J(C f, p ) its jacobian. Assuming that either n  =  p + 1 or p does not divide n(n  −  1), we prove that the ring of all endomorphisms of J(C f, p ) coincides with . The same is true if n  =  4, the Galois group of f(x) is the full symmetric group S 4 and K contains a primitive pth root of unity. An erratum to this article can be found at  相似文献   

13.
In this paper, we give analogue of Jörgensen's inequality for nonelementary groups of isometries of complex hyperbolic 2-space generated by two elements, one of which is either loxodromic or boundary elliptic for the same group of isometries of quaternionic hyperbolic 2-space. And we give a sufficient condition for a nonelementary subgroup of isometries of quaternionic hyperbolic 2-space generated by two elements one of which is parabolic not to be discrete.  相似文献   

14.
在本文中我们研究有限CN-群, 即每个子群都c-正规的有限群. 我们得到以下结果:群G是CN-群当且仅当G的每个子群都在G中正规.群G是CN-群当且仅当G可解且c-正规性是传递的.设p是一个奇素数, P是一个p-群, 则P是一个CN-群当且仅当Φ(P)≤Z(P).我们也得到了一些CN-群的直积为CN-群的判别条件.  相似文献   

15.
A group G is said to be a T-group (resp. PT-group, PST-group), if normality (resp. permutability, S-permutability) is a transitive relation. In this paper, we get the characterization of finite solvable PST-groups. We also give a new characterization of finite solvable PT-groups.   相似文献   

16.
An answer is given to a problem proposed by Bannai and Ito for {l,l+s,l+s+t}-sharp permutation group, and the result is used to determine L-sharp groups for L={l,l+1,l+3}and{l,l+2,l+3}.  相似文献   

17.
    
Given natural numbers n?3 and 1?a, r?n?1, the rose window graph Rn(a, r) is a quartic graph with vertex set ${{{x}}_{{i}}|{{i}}in {mathbb{Z}}_{{n}}} cup {{{y}}_{{i}}|{{i}}in{mathbb{Z}}_{{n}}}Given natural numbers n?3 and 1?a, r?n?1, the rose window graph Rn(a, r) is a quartic graph with vertex set ${{{x}}_{{i}}|{{i}}in {mathbb{Z}}_{{n}}} cup {{{y}}_{{i}}|{{i}}in{mathbb{Z}}_{{n}}}$ and edge set ${{{{x}}_{{i}},{{x}}_{{{i+1}}}} mid {{i}}in {mathbb{Z}}_n } cup {{{{y}}_{{{i}}},{{y}}_{{{i+r}}}}mid {{i}} in{mathbb{Z}}_{{n}}}cup {{{{x}}_{{{i}}},{{y}}_{{{i}}}} mid {{i}}in {mathbb{Z}}_{{{n}}}}cup {{{{x}}_{{{i+a}}},{{y}}_{{{i}}}} mid{{i}} in {mathbb{Z}}_{{{n}}}}$. In this article a complete classification of edge‐transitive rose window graphs is given, thus solving one of the three open problems about these graphs posed by Steve Wilson in 2001. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 216–231, 2010  相似文献   

18.
An answer is given to a problem proposed by Bannai and Ito for {I, I + s, I + s + t}-sharp permutation group, and the result is used to determineL-sharp groups for L={I, I + 1, I + 3} and {I, I + 2, I + 3}.  相似文献   

19.
    
In this exposition of quantum permutation groups, an alternative to the ‘Gelfand picture’ of compact quantum groups is proposed. This point of view is inspired by algebraic quantum mechanics and interprets the states of an algebra of continuous functions on a quantum permutation group as quantum permutations. This interpretation allows talk of an element of a quantum permutation group, and allows a clear understanding of the difference between deterministic, random, and quantum permutations. The interpretation is illustrated by various quantum permutation group phenomena.  相似文献   

20.
本用Mathematica语言研究置换群运算的计算机实现.并进而实现对于给定的n,设计判断交代群An是否为单群的程序.  相似文献   

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

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