Simplicity of some automorphism groups
نویسندگان
چکیده
a r t i c l e i n f o a b s t r a c t Let M be a countably infinite first order relational structure which is homogeneous in the sense of Fraïssé. We show, under the assumption that the class of finite substructures of M has the free amalgamation property, along with the assumption that Aut(M) is transitive on M but not equal to Sym(M), that Aut(M) is a simple group. This generalises results of Truss, Rubin and others. The proof uses the Polish group structure of the automorphism group and generalises to certain other homogeneous structures, with prospects for further application.
منابع مشابه
Simplicity of the automorphism groups of some Hrushovski constructions
we show that the automorphism groups of certain countable structures obtained using the Hrushovski amalgamation method are simple groups. The structures we consider are the ‘uncollapsed’ structures of infinite Morley rank obtained by the ab initio construction and the (unstable) א0-categorical pseudoplanes. The simplicity of the automorphism groups of these follows from results which generalize...
متن کاملOn the nilpotency class of the automorphism group of some finite p-groups
Let $G$ be a $p$-group of order $p^n$ and $Phi$=$Phi(G)$ be the Frattini subgroup of $G$. It is shown that the nilpotency class of $Autf(G)$, the group of all automorphisms of $G$ centralizing $G/ Fr(G)$, takes the maximum value $n-2$ if and only if $G$ is of maximal class. We also determine the nilpotency class of $Autf(G)$ when $G$ is a finite abelian $p$-group.
متن کاملSimplicity of some twin tree automorphism groups with trivial commutation relations
We prove simplicity for incomplete rank 2 Kac-Moody groups over algebraic closures of finite fields with trivial commutation relations between root groups corresponding to prenilpotent pairs. We don’t use the (yet unknown) simplicity of the corresponding finitely generated groups (i.e., when the ground field is finite). Nevertheless we use the fact that the latter groups are just infinite (modu...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کامل1-Designs from the group $PSL_{2}(59)$ and their automorphism groups
In this paper, we consider the projective special linear group $PSL_2(59)$ and construct some 1-designs by applying the Key-Moori method on $PSL_2(59)$. Moreover, we obtain parameters of these designs and their automorphism groups. It is shown that $PSL_2(59)$ and $PSL_2(59):2$ appear as the automorphism group of the constructed designs.
متن کاملAutomorphism Group of a Possible 2-(121, 16, 2) Symmetric Design
Let D be a symmetric 2-(121, 16, 2) design with the automorphism group of Aut(D). In this paper the order of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of fixed points of these automorphisms. Also we will show that |Aut(D)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. In addition we prese...
متن کامل