scholarly journals On the exponent of a finite group with an automorphism group of order twelve

2011 ◽  
Vol 331 (1) ◽  
pp. 482-489 ◽  
Author(s):  
Pavel Shumyatsky
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
A Finite Group

scholarly journals Automorphism orbits of finite groups

1986 ◽  
Vol 40 (2) ◽  
pp. 253-260 ◽  
Author(s):  
Thomas J. Laffey ◽  
Desmond MacHale
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Finite Groups ◽  
Prime Power ◽  
Structure Theorem ◽  
Equivalence Classes ◽  
Prime Power Order ◽  
A Finite Group

AbstractLet G be a finite group and let Aut(G) be its automorphism group. Then G is called a k-orbit group if G has k orbits (equivalence classes) under the action of Aut(G). (For g, hG, we have g ~ h if ga = h for some Aut(G).) It is shown that if G is a k-orbit group, then kGp + 1, where p is the least prime dividing the order of G. The 3-orbit groups which are not of prime-power order are classified. It is shown that A5 is the only insoluble 4-orbit group, and a structure theorem is proved about soluble 4-orbit groups.

Tournaments With a Given Automorphism Group

1964 ◽  
Vol 16 ◽  
pp. 485-489 ◽  
Author(s):  
J. W. Moon
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Oriented Graph ◽  
Not Given ◽  
Oriented Graphs ◽  
Vertex Set ◽  
A Finite Group ◽  
Graph Form

The set of all adjacency-preserving automorphisms of the vertex set of a graph form a group which is called the (automorphism) group of the graph. In 1938 Frucht (2) showed that every finite group is isomorphic to the group of some graph. Since then Frucht, Izbicki, and Sabidussi have considered various other properties that a graph having a given group may possess. (For pertinent references and definitions not given here see Ore (4).) The object in this paper is to treat by similar methods a corresponding problem for a class of oriented graphs. It will be shown that a finite group is isomorphic to the group of some complete oriented graph if and only if it has an odd number of elements.

Quasirecognition of E6(q) by the orders of maximal abelian subgroups

2018 ◽  
Vol 17 (07) ◽  
pp. 1850122 ◽  
Author(s):  
Zahra Momen ◽  
Behrooz Khosravi
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Simple Group ◽  
Outer Automorphism ◽  
Composition Factor ◽  
Outer Automorphism Group ◽  
Abelian Subgroups ◽  
A Finite Group ◽  
Nonabelian Composition Factor

In [Li and Chen, A new characterization of the simple group [Formula: see text], Sib. Math. J. 53(2) (2012) 213–247.], it is proved that the simple group [Formula: see text] is uniquely determined by the set of orders of its maximal abelian subgroups. Also in [Momen and Khosravi, Groups with the same orders of maximal abelian subgroups as [Formula: see text], Monatsh. Math. 174 (2013) 285–303], the authors proved that if [Formula: see text], where [Formula: see text] is not a Mersenne prime, then every finite group with the same orders of maximal abelian subgroups as [Formula: see text], is isomorphic to [Formula: see text] or an extension of [Formula: see text] by a subgroup of the outer automorphism group of [Formula: see text]. In this paper, we prove that if [Formula: see text] is a finite group with the same orders of maximal abelian subgroups as [Formula: see text], then [Formula: see text] has a unique nonabelian composition factor which is isomorphic to [Formula: see text].

scholarly journals On groups admitting a noncyclic abelian automorphism group

1973 ◽  
Vol 9 (3) ◽  
pp. 363-366 ◽  
Author(s):  
J.N. Ward
Keyword(s):  
Fixed Point ◽  
Finite Group ◽  
Automorphism Group ◽  
Fixed Points ◽  
Free Operator ◽  
A Finite Group

It is shown that a condition of Kurzwell concerning fixed-points of certain operators on a finite group G is sufficient to ensure that G is soluble. The result generalizes those of Martineau on elementary abelian fixed-point-free operator groups.

Groups of real genus p + 1, where p is prime

2014 ◽  
Vol 14 (03) ◽  
pp. 1550040
Author(s):  
Coy L. May
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Klein Surface ◽  
The Real ◽  
A Finite Group ◽  
Large Groups

Let G be a finite group. The real genusρ(G) is the minimum algebraic genus of any compact bordered Klein surface on which G acts. We classify the large groups of real genus p + 1, that is, the groups such that |G| ≥ 3(g - 1), where the genus action of G is on a bordered surface of genus g = p + 1. The group G must belong to one of four infinite families. In addition, we determine the order of the largest automorphism group of a surface of genus g for all g such that g = p + 1, where p is a prime.

scholarly journals On Galois projective group rings

1991 ◽  
Vol 14 (1) ◽  
pp. 149-153
Author(s):  
George Szeto ◽  
Linjun Ma
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Galois Group ◽  
Group Ring ◽  
Projective Group ◽  
Group Rings ◽  
Inner Automorphism ◽  
A Finite Group

LetAbe a ring with1,Cthe center ofAandG′an inner automorphism group ofAinduced by {Uαin​A/αin a finite groupGwhose order is invertible}. LetAG′be the fixed subring ofAunder the action ofG′.IfAis a Galcis extension ofAG′with Galois groupG′andCis the center of the subring∑αAG′UαthenA=∑αAG′Uαand the center ofAG′is alsoC. Moreover, if∑αAG′Uαis Azumaya overC, thenAis a projective group ring.

scholarly journals On the power of a prime dividing the order of the automorphism group of a finite group

1960 ◽  
Vol 4 (4) ◽  
pp. 163-170 ◽  
Author(s):  
J. C. Howarth
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Image Position ◽  
A Finite Group

The existence of a function g of hhaving the property that pr divides the order of the automorphism group of a finite group G whenever pg divides the order of G was first established by Ledermann and Neumann [4], who showed that the least such function g(h) satisfies the inequalityLater Green [2] improved this estimate toIn the Present paper this will be revised, for sufficiently large h, to

scholarly journals On automorphism groups of low complexity subshifts

2015 ◽  
Vol 36 (1) ◽  
pp. 64-95 ◽  
Author(s):  
SEBASTIÁN DONOSO ◽  
FABIEN DURAND ◽  
ALEJANDRO MAASS ◽  
SAMUEL PETITE
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Polynomial Complexity ◽  
Automorphism Groups ◽  
Low Complexity ◽  
Topological Dynamics ◽  
Main Technique ◽  
Shift Map ◽  
The One ◽  
A Finite Group

In this article, we study the automorphism group$\text{Aut}(X,{\it\sigma})$of subshifts$(X,{\it\sigma})$of low word complexity. In particular, we prove that$\text{Aut}(X,{\it\sigma})$is virtually$\mathbb{Z}$for aperiodic minimal subshifts and certain transitive subshifts with non-superlinear complexity. More precisely, the quotient of this group relative to the one generated by the shift map is a finite group. In addition, we show that any finite group can be obtained in this way. The class considered includes minimal subshifts induced by substitutions, linearly recurrent subshifts and even some subshifts which simultaneously exhibit non-superlinear and superpolynomial complexity along different subsequences. The main technique in this article relies on the study of classical relations among points used in topological dynamics, in particular, asymptotic pairs. Various examples that illustrate the technique developed in this article are provided. In particular, we prove that the group of automorphisms of a$d$-step nilsystem is nilpotent of order$d$and from there we produce minimal subshifts of arbitrarily large polynomial complexity whose automorphism groups are also virtually$\mathbb{Z}$.

On the order of the automorphism group of a finite group. II

1956 ◽  
Vol 235 (1201) ◽  
pp. 235-246 ◽  
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Upper Bound ◽  
Group Ii ◽  
A Finite Group

Corresponding to a fixed prime p there exists a function g(h) such that the order of the automorphism group of a finite group G is divisible by p h , provided that the order of G is divisible by p g(h) . An explicit upper bound for g(h) is obtained.

Sign in / Sign up

Export Citation Format

Share Document