scholarly journals The Double Transitivity of a Class of Permutation Groups

1965 ◽  
Vol 17 ◽  
pp. 480-493 ◽  
Author(s):  
Ronald D. Bercov
Keyword(s):  
Finite Groups ◽  
Abelian Groups ◽  
Transitive Group ◽  
Primitive Group ◽  
Permutation Groups ◽  
Regular Subgroup

Certain finite groups H do not occur as a regular subgroup of a uniprimitive (primitive but not doubly transitive) group G. If such a group H occurs as a regular subgroup of a primitive group G, it follows that G is doubly transitive. Such groups H are called B-groups (8) since the first example was given by Burnside (1, p. 343), who showed that a cyclic p-group of order greater than p has this property (and is therefore a B-group in our terminology).Burnside conjectured that all abelian groups are B-groups. A class of counterexamples to this conjecture due to W. A. Manning was given by Dorothy Manning in 1936 (3).

On Permutation Groups with Regular Subgroup

1974 ◽  
Vol 17 (3) ◽  
pp. 359-361
Author(s):  
R. D. Bercov
Keyword(s):  
Cyclic Group ◽  
Primitive Group ◽  
Permutation Groups ◽  
Regular Subgroup

W. Burnside [3, p. 343] showed that a cyclic group of order pm (p prime, m > l) cannot occur as a regular subgroup of a simply transitive primitive group. (For definitions and notation see [9].) Groups which are contained regularly in a primitive group G only when G is doubly transitive are therefore called B-groups [9, p. 64].

The primitive permutation groups of degree less than 1000

1988 ◽  
Vol 103 (2) ◽  
pp. 213-238 ◽  
Author(s):  
John D. Dixon ◽  
Brian Mortimer
Keyword(s):  
Finite Groups ◽  
Primitive Group ◽  
Simple Groups ◽  
Permutation Groups ◽  
Finite Simple Groups ◽  
Primitive Groups ◽  
Concrete Form

Our object is to describe all of the-primitive permutation groups of degree less than 1000 together with some of their significant properties. We think that such a list is of interest in illustrating in concrete form the kinds of primitive groups which arise, in suggesting conjectures about primitive groups, and in settling small exceptional cases which often occur in proofs of theorems about permutation groups. The range that we consider is large enough to allow examples of most of the types of primitive group to appear. Earlier lists (of varying completeness and accuracy) of primitive groups of degree d have been published by: C. Jordan (1872) [21] ford≤ 17, by W. Burnside (1897) [5] ford≤ 8, by Manning (1929) [34–38] ford≤ 15, by C. C. Sims (1970) [45] ford≤ 20, and by B. A. Pogorelev (1980) [42] ford≤ 50. Unpublished lists have also been prepared by C. C. Sims ford≤ 50 and by Mizutani[41] ford≤ 48. Using the classification of finite simple groups which was completed in 1981 we have been able to extend the list much further. Our task has been greatly simplified by the detailed information about many finite simple groups which is available in theAtlas of Finite Groupswhich we will refer to as theAtlas[8].

Pointwise bound for ℓ-torsion in class groups: Elementary abelian extensions

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jiuya Wang
Keyword(s):  
Galois Group ◽  
Prime Number ◽  
Finite Groups ◽  
Upper Bound ◽  
Abelian Groups ◽  
Class Groups ◽  
Abelian Extensions ◽  
Pointwise Bound ◽  
First Case

AbstractElementary abelian groups are finite groups in the form of {A=(\mathbb{Z}/p\mathbb{Z})^{r}} for a prime number p. For every integer {\ell>1} and {r>1}, we prove a non-trivial upper bound on the {\ell}-torsion in class groups of every A-extension. Our results are pointwise and unconditional. This establishes the first case where for some Galois group G, the {\ell}-torsion in class groups are bounded non-trivially for every G-extension and every integer {\ell>1}. When r is large enough, the unconditional pointwise bound we obtain also breaks the previously best known bound shown by Ellenberg and Venkatesh under GRH.

On enhanced power graphs of finite groups

2018 ◽  
Vol 17 (08) ◽  
pp. 1850146 ◽  
Author(s):  
Sudip Bera ◽  
A. K. Bhuniya
Keyword(s):  
Finite Groups ◽  
Abelian Groups ◽  
Cyclic Subgroups ◽  
Power Graph ◽  
Vertex Set ◽  
One To One

Given a group [Formula: see text], the enhanced power graph of [Formula: see text], denoted by [Formula: see text], is the graph with vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are edge connected in [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] and [Formula: see text] for some [Formula: see text]. Here, we show that the graph [Formula: see text] is complete if and only if [Formula: see text] is cyclic; and [Formula: see text] is Eulerian if and only if [Formula: see text] is odd. We characterize all abelian groups and all non-abelian [Formula: see text]-groups [Formula: see text] such that [Formula: see text] is dominatable. Besides, we show that there is a one-to-one correspondence between the maximal cliques in [Formula: see text] and the maximal cyclic subgroups of [Formula: see text].

Profinite Modules

1973 ◽  
Vol 16 (3) ◽  
pp. 405-415
Author(s):  
Gerard Elie Cohen
Keyword(s):  
Finite Group ◽  
General Theory ◽  
Finite Length ◽  
Finite Groups ◽  
Inverse Limit ◽  
Abelian Groups ◽  
Point Of View ◽  
Inverse Limits ◽  
Profinite Groups ◽  
Inverse Systems

An inverse limit of finite groups has been called in the literature a pro-finite group and we have extensive studies of profinite groups from the cohomological point of view by J. P. Serre. The general theory of non-abelian modules has not yet been developed and therefore we consider a generalization of profinite abelian groups. We study inverse systems of discrete finite length R-modules. Profinite modules are inverse limits of discrete finite length R-modules with the inverse limit topology.

Conjugacy Separability of Certain Polygonal Products

1996 ◽  
Vol 39 (3) ◽  
pp. 294-307 ◽  
Author(s):  
Goansu Kim
Keyword(s):  
Finite Groups ◽  
Abelian Groups ◽  
Finitely Generated ◽  
Cyclic Subgroups ◽  
Conjugacy Separability ◽  
Conjugacy Separable

AbstractWe show that polygonal products of polycyclic-by-finite groups amalgamating central cyclic subgroups, with trivial intersections, are conjugacy separable. Thus polygonal products of finitely generated abelian groups amalgamating cyclic subgroups, with trivial intersections, are conjugacy separable. As a corollary of this, we obtain that the group A1 *〈a1〉A2 *〈a2〉 • • • *〈am-1〉Am is conjugacy separable for the abelian groups Ai.

scholarly journals Permutation groups containing a regular abelian subgroup: the tangled history of two mistakes of Burnside

2019 ◽  
Vol 168 (3) ◽  
pp. 613-633 ◽  
Author(s):  
MARK WILDON
Keyword(s):  
Finite Groups ◽  
Prime Power ◽  
Prime Power Order ◽  
Open Problems ◽  
Related Literature ◽  
Cyclic Groups ◽  
Computational Data ◽  
Regular Subgroup ◽  
History Of ◽  
Order State

AbstractA group K is said to be a B-group if every permutation group containing K as a regular subgroup is either imprimitive or 2-transitive. In the second edition of his influential textbook on finite groups, Burnside published a proof that cyclic groups of composite prime-power degree are B-groups. Ten years later, in 1921, he published a proof that every abelian group of composite degree is a B-group. Both proofs are character-theoretic and both have serious flaws. Indeed, the second result is false. In this paper we explain these flaws and prove that every cyclic group of composite order is a B-group, using only Burnside’s character-theoretic methods. We also survey the related literature, prove some new results on B-groups of prime-power order, state two related open problems and present some new computational data.

scholarly journals On Primitive Extensions of Rank 3 of Symmetric Groups

1966 ◽  
Vol 27 (1) ◽  
pp. 171-177 ◽  
Author(s):  
Tosiro Tsuzuku
Keyword(s):  
Permutation Group ◽  
Symmetric Groups ◽  
Transitive Group ◽  
Permutation Groups ◽  
Minimal Set ◽  
Finite Set ◽  
Rank 2 ◽  
One To One

1. Let Ω be a finite set of arbitrary elements and let (G, Ω) be a permutation group on Ω. (This is also simply denoted by G). Two permutation groups (G, Ω) and (G, Γ) are called isomorphic if there exist an isomorphism σ of G onto H and a one to one mapping τ of Ω onto Γ such that (g(i))τ=gσ(iτ) for g ∊ G and i∊Ω. For a subset Δ of Ω, those elements of G which leave each point of Δ individually fixed form a subgroup GΔ of G which is called a stabilizer of Δ. A subset Γ of Ω is called an orbit of GΔ if Γ is a minimal set on which each element of G induces a permutation. A permutation group (G, Ω) is called a group of rank n if G is transitive on Ω and the number of orbits of a stabilizer Ga of a ∊ Ω, is n. A group of rank 2 is nothing but a doubly transitive group and there exist a few results on structure of groups of rank 3 (cf. H. Wielandt [6], D. G. Higman M).

scholarly journals Impartial achievement games for generating nilpotent groups

2019 ◽  
Vol 22 (3) ◽  
pp. 515-527
Author(s):  
Bret J. Benesh ◽  
Dana C. Ernst ◽  
Nándor Sieben
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Abelian Groups ◽  
Nilpotent Groups ◽  
Generating Set ◽  
Odd Order ◽  
Impartial Game ◽  
A Finite Group

AbstractWe study an impartial game introduced by Anderson and Harary. The game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nim-numbers of this game for finite groups of the form{T\times H}, whereTis a 2-group andHis a group of odd order. This includes all nilpotent and hence abelian groups.

Sign in / Sign up

Export Citation Format

Share Document