scholarly journals Bounds and quotient actions of innately transitive groups

2005 ◽  
Vol 79 (1) ◽  
pp. 95-112 ◽  
Author(s):  
John Bamberg
Keyword(s):  
Permutation Groups ◽  
Primitive Groups ◽  
Transitive Groups ◽  
Parameter Bounds

AbstractFinite innately transitive permutation groups include all finite quasiprimitive and primitive permutation groups. In this paper, results in the theory of quasiprimitive and primitive groups are generalised to innately transitive groups, and in particular, we extend results of Praeger and Shalev. Thus we show that innately transitive groups possess parameter bounds which are similar to those for primitive groups. We also classify the innately transitive types of quotient actions of innately transitive groups.

scholarly journals Affine Primitive Groups and Semisymmetric Graphs

10.37236/2549 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Hua Han ◽  
Zaiping Lu
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Infinite Family ◽  
Permutation Groups ◽  
Primitive Groups ◽  
The Third ◽  
Semisymmetric Graphs

In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization,of the complete bipartite graph $K_{p^{sp^t},p^{sp^t}}$ into connected semisymmetric graphs, where $p$ is an prime, $1\le t\le s$ with $s\ge2$ while $p=2$.

scholarly journals Derangements in cosets of primitive permutation groups

2015 ◽  
Vol 18 (1) ◽  
Author(s):  
Andrei Pavelescu
Keyword(s):  
Fixed Point ◽  
Finite Fields ◽  
Permutation Groups ◽  
Normal Subgroups ◽  
Primitive Groups ◽  
Branched Coverings ◽  
Affine Groups ◽  
Nonabelian Subgroup ◽  
Projective Curves ◽  
Curves Over Finite Fields

AbstractMotivated by questions arising in connection with branched coverings of connected smooth projective curves over finite fields, we study the proportion of fixed-point free elements (derangements) in cosets of normal subgroups of primitive permutations groups. Using the Aschbacher–O'Nan–Scott Theorem for primitive groups to partition the problem, we provide complete answers for affine groups and groups which contain a regular normal nonabelian subgroup.

scholarly journals Invariance groups of finite functions and orbit equivalence of permutation groups

2015 ◽  
Vol 13 (1) ◽  
Author(s):  
Eszter K. Horváth ◽  
Géza Makay ◽  
Reinhard Pöschel ◽  
Tamás Waldhauser
Keyword(s):  
Symmetric Group ◽  
Partial Answer ◽  
Permutation Groups ◽  
Computational Results ◽  
Orbit Equivalence ◽  
Alternating Groups ◽  
Primitive Groups ◽  
Complete Answer ◽  
The Difference ◽  
Invariance Groups

AbstractWhich subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections and the corresponding closure operators on Sn, which turn out to provide a generalization of orbit equivalence of permutation groups. We also present some computational results, which show that all primitive groups except for the alternating groups arise as invariance groups of functions defined on a three-element domain.

scholarly journals A Note on Primitive Permutation Groups of Prime Power Degree

2015 ◽  
Vol 2015 ◽  
pp. 1-4
Author(s):  
Qian Cai ◽  
Hua Zhang
Keyword(s):  
Prime Power ◽  
Permutation Groups ◽  
Simple Type ◽  
Present Stage ◽  
Primitive Groups ◽  
Short Survey ◽  
Product Action ◽  
Action Type ◽  
Affine Type

Primitive permutation groups of prime power degree are known to be affine type, almost simple type, and product action type. At the present stage finding an explicit classification of primitive groups of affine type seems untractable, while the product action type can usually be reduced to almost simple type. In this paper, we present a short survey of the development of primitive groups of prime power degree, together with a brief description on such groups.

scholarly journals Transitive Extensions of a Class of Doubly Transitive Groups

1966 ◽  
Vol 27 (1) ◽  
pp. 159-169 ◽  
Author(s):  
Michio Suzuki
Keyword(s):  
Recent Result ◽  
Permutation Group ◽  
Unitary Group ◽  
Simple Groups ◽  
Permutation Groups ◽  
Transitive Permutation Group ◽  
Precise Statement ◽  
Transitive Groups ◽  
Recent Theorem ◽  
Doubly Transitive Groups

1. When a permutation group G on a set Ω is given, a transitive extension G of G is defined to be a transitive permutation group on the set Γ which is a union of Ω and a new point ∞ such that the stabilizer of ∞ in G1 is isomorphic to G as a permutation group on Ω. The purpose of this paper is to prove that many known simple groups which can be represented as doubly transitive groups admit no transitive extension. Precise statement is found in Theorem 2. For example, the simple groups discovered by Ree [5] do not admit transitive extensions. Theorem 2 includes also a recent result of D. R. Hughes [3] which states that the unitary group U3(q) q>2 does not admit a transitive extension. As an application we prove a recent theorem of H. Nagao [4], which generalizes a theorem of Wielandt on the non-existence of 8-transitive permutation groups not containing the alternating groups under Schreier’s conjecture.

scholarly journals Seminormal and subnormal subgroup lattices for transitive permutation groups

2006 ◽  
Vol 80 (1) ◽  
pp. 45-64
Author(s):  
Cheryl E. Praeger
Keyword(s):  
Subnormal Subgroup ◽  
Subgroup Lattice ◽  
Permutation Groups ◽  
Transitive Permutation Group ◽  
Transitive Groups ◽  
Lattices Of Subgroups ◽  
Subgroup Lattices ◽  
A Chain ◽  
Seminormal Subgroup ◽  
Composition Factors

AbstractVarious lattices of subgroups of a finite transitive permutation group G can be used to define a set of ‘basic’ permutation groups associated with G that are analogues of composition factors for abstract finite groups. In particular G can be embedded in an iterated wreath product of a chain of its associated basic permutation groups. The basic permutation groups corresponding to the lattice L of all subgroups of G containing a given point stabiliser are a set of primitive permutation groups. We introduce two new subgroup lattices contained in L, called the seminormal subgroup lattice and the subnormal subgroup lattice. For these lattices the basic permutation groups are quasiprimitive and innately transitive groups, respectively.

Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree

2020 ◽  
Vol 63 (4) ◽  
pp. 1071-1091
Author(s):  
Luke Morgan ◽  
Cheryl E. Praeger ◽  
Kyle Rosa
Keyword(s):  
Fixed Point ◽  
Normal Subgroup ◽  
Symmetric Group ◽  
Minimal Normal Subgroup ◽  
Structural Information ◽  
Minimal Degree ◽  
Permutation Groups ◽  
Primitive Groups ◽  
Base Size ◽  
Abstract Structure

AbstractIn this paper, we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. These groups have recently been investigated in terms of their abstract structure, in a similar way to the O'Nan–Scott Theorem for primitive groups. Our goal here is to explore aspects of such groups which may be useful in place of precise structural information. We give bounds on the order, base size, minimal degree, fixed point ratio, and chief length of an arbitrary finite semiprimitive group in terms of its degree. To establish these bounds, we study the structure of a finite semiprimitive group that induces the alternating or symmetric group on the set of orbits of an intransitive minimal normal subgroup.

scholarly journals Cycle Index, Weight Enumerator, and Tutte Polynomial

10.37236/1663 ◽  
2002 ◽  
Vol 9 (1) ◽  
Author(s):  
Peter J. Cameron
Keyword(s):  
Permutation Group ◽  
Linear Code ◽  
Tutte Polynomial ◽  
Weight Enumerator ◽  
Permutation Groups ◽  
Cycle Index ◽  
Transitive Groups ◽  
Index Weight

With every linear code is associated a permutation group whose cycle index is the weight enumerator of the code (up to a trivial normalisation). There is a class of permutation groups (the IBIS groups) which includes the groups obtained from codes as above. With every IBIS group is associated a matroid; in the case of a group from a code, the matroid differs only trivially from that which arises directly from the code. In this case, the Tutte polynomial of the code specialises to the weight enumerator (by Greene's Theorem), and hence also to the cycle index. However, in another subclass of IBIS groups, the base-transitive groups, the Tutte polynomial can be derived from the cycle index but not vice versa. I propose a polynomial for IBIS groups which generalises both Tutte polynomial and cycle index.

scholarly journals A NOTE ON PERMUTATION GROUPS AND THEIR REGULAR SUBGROUPS

2008 ◽  
Vol 85 (2) ◽  
pp. 283-287 ◽  
Author(s):  
MING-YAO XU
Keyword(s):  
Positive Integer ◽  
Transitive Group ◽  
Permutation Groups ◽  
Transitive Groups

AbstractIn this note we first prove that, for a positive integern>1 withn≠porp2wherepis a prime, there exists a transitive group of degreenwithout regular subgroups. Then we look at 2-closed transitive groups without regular subgroups, and pose two questions and a problem for further study.

scholarly journals THE CONTRIBUTION OF L. G. KOVÁCS TO THE THEORY OF PERMUTATION GROUPS

2015 ◽  
Vol 102 (1) ◽  
pp. 20-33
Author(s):  
CHERYL E. PRAEGER ◽  
CSABA SCHNEIDER
Keyword(s):  
Permutation Groups ◽  
Primitive Groups

The work of L. G. (Laci) Kovács (1936–2013) gave us a deeper understanding of permutation groups, especially in the O’Nan–Scott theory of primitive groups. We review his contribution to this field.

Sign in / Sign up

Export Citation Format

Share Document