Search Results

On Closures of Finite Permutation Groups

Download or Read eBook On Closures of Finite Permutation Groups PDF written by Jing Xu and published by . This book was released on 2005 with total page 111 pages. Available in PDF, EPUB and Kindle.
On Closures of Finite Permutation Groups
Author :
Publisher :
Total Pages : 111
Release :
ISBN-10 : OCLC:225354058
ISBN-13 :
Rating : 4/5 (58 Downloads)

Book Synopsis On Closures of Finite Permutation Groups by : Jing Xu

Book excerpt: [Formulae and special characters in this field can only be approximated. See PDF version for accurate reproduction] In this thesis we investigate the properties of k-closures of certain finite permutation groups. Given a permutation group G on a finite set Ω, for k ≥ 1, the k-closure G(k) of G is the largest subgroup of Sym(Ω) with the same orbits as G on the set Ωk of k-tuples from Ω. The first problem in this thesis is to study the 3-closures of affine permutation groups. In 1992, Praeger and Saxl showed if G is a finite primitive group and k ≥ 2 then either G(k) and G have the same socle or (G(k),G) is known. In the case where the socle of G is an elementary abelian group, so that G is a primitive group of affine transformations of a finite vector space, the fact that G(k) has the same socle as G gives little information about the relative sizes of the two groups G and G(k). In this thesis we use Aschbacher’s Theorem for subgroups of finite general linear groups to show that, if G ≤ AGL(d, p) is an affine permutation group which is not 3-transitive, then for any point α ∈ Ω, Gα and (G(3) ∩ AGL(d, p))α lie in the same Aschbacher class. Our results rely on a detailed analysis of the 2-closures of subgroups of general linear groups acting on non-zero vectors and are independent of the finite simple group classification. In addition, modifying the work of Praeger and Saxl in [47], we are able to give an explicit list of affine primitive permutation groups G for which G(3) is not affine. The second research problem is to give a partial positive answer to the so-called Polycirculant Conjecture, which states that every transitive 2-closed permutation group contains a semiregular element, that is, a permutation whose cycles all have the same length. This would imply that every vertex-transitive graph has a semiregular automorphism. In this thesis we make substantial progress on the Polycirculant Conjecture by proving that every vertex-transitive, locally-quasiprimitive graph has a semiregular automorphism. The main ingredient of the proof is the determination of all biquasiprimitive permutation groups with no semiregular elements. Publications arising from this thesis are [17, 54].


On Closures of Finite Permutation Groups Related Books

On Closures of Finite Permutation Groups
Language: en
Pages: 111
Authors: Jing Xu
Categories: Finite groups
Type: BOOK - Published: 2005 - Publisher:

DOWNLOAD EBOOK

[Formulae and special characters in this field can only be approximated. See PDF version for accurate reproduction] In this thesis we investigate the properties
Closures of Finite Permutation Groups and Relation Algebras
Language: en
Pages: 12
Authors: C. E. Praeger
Categories:
Type: BOOK - Published: 1990 - Publisher:

DOWNLOAD EBOOK

Closures of Finite Primitive Permutation Groups
Language: en
Pages: 9
Authors: C. E. Praeger
Categories:
Type: BOOK - Published: 1990 - Publisher:

DOWNLOAD EBOOK

Finite Permutation Groups
Language: en
Pages: 125
Authors: Helmut Wielandt
Categories: Mathematics
Type: BOOK - Published: 2014-05-10 - Publisher: Academic Press

DOWNLOAD EBOOK

Finite Permutation Groups provides an introduction to the basic facts of both the theory of abstract finite groups and the theory of permutation groups. This bo
Oligomorphic Permutation Groups
Language: en
Pages: 172
Authors: Peter J. Cameron
Categories: Mathematics
Type: BOOK - Published: 1990-06-29 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

The study of permutations groups has always been closely associated with that of highly symmetric structures. The objects considered here are countably infinite
Scroll to top