scholarly journals COHERENT EXTENSION OF PARTIAL AUTOMORPHISMS, FREE AMALGAMATION AND AUTOMORPHISM GROUPS

2019 ◽  
Vol 85 (1) ◽  
pp. 199-223 ◽  
Author(s):  
DAOUD SINIORA ◽  
SŁAWOMIR SOLECKI
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Extension Property ◽  
Finite Subgroup ◽  
Homogeneous Structure ◽  
Extension Theorems ◽  
Locally Finite ◽  
Finite Structures ◽  
Image Position ◽  
Fraïssé Class

AbstractWe give strengthened versions of the Herwig–Lascar and Hodkinson–Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous structures. For instance, we establish a coherent form of the extension property for partial automorphisms for certain Fraïssé classes. We deduce from these results that the isometry group of the rational Urysohn space, the automorphism group of the Fraïssé limit of any Fraïssé class that is the class of all ${\cal F}$-free structures (in the Herwig–Lascar sense), and the automorphism group of any free homogeneous structure over a finite relational language all contain a dense locally finite subgroup. We also show that any free homogeneous structure admits ample generics.

Automorphism groups of arithmetically saturated models

2006 ◽  
Vol 71 (1) ◽  
pp. 203-216 ◽  
Author(s):  
Ermek S. Nurkhaidarov
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Open Subgroup ◽  
Peano Arithmetic ◽  
Standard System ◽  
Permutation Groups ◽  
Saturated Model ◽  
Saturated Models ◽  
Homogeneous Set ◽  
Image Position

In this paper we study the automorphism groups of countable arithmetically saturated models of Peano Arithmetic. The automorphism groups of such structures form a rich class of permutation groups. When studying the automorphism group of a model, one is interested to what extent a model is recoverable from its automorphism group. Kossak-Schmerl [12] show that if M is a countable, arithmetically saturated model of Peano Arithmetic, then Aut(M) codes SSy(M). Using that result they prove:Let M1. M2 be countable arithmetically saturated models of Peano Arithmetic such that Aut(M1) ≅ Aut(M2). Then SSy(M1) = SSy(M2).We show that if M is a countable arithmetically saturated of Peano Arithmetic, then Aut(M) can recognize if some maximal open subgroup is a stabilizer of a nonstandard element, which is smaller than any nonstandard definable element. That fact is used to show the main theorem:Let M1, M2be countable arithmetically saturated models of Peano Arithmetic such that Aut(M1) ≅ Aut(M2). Then for every n < ωHere RT2n is Infinite Ramsey's Theorem stating that every 2-coloring of [ω]n has an infinite homogeneous set. Theorem 0.2 shows that for models of a false arithmetic the converse of Kossak-Schmerl Theorem 0.1 is not true. Using the results of Reverse Mathematics we obtain the following corollary:There exist four countable arithmetically saturated models of Peano Arithmetic such that they have the same standard system but their automorphism groups are pairwise non-isomorphic.

Rigid homogeneous chains

1981 ◽  
Vol 89 (1) ◽  
pp. 07-17 ◽  
Author(s):  
A. M. W. Glass ◽  
Yuri Gurevich ◽  
W. Charles Holland ◽  
Saharon Shelah
Keyword(s):  
Automorphism Group ◽  
General Problem ◽  
Automorphism Groups ◽  
Ordered Sets ◽  
First Order ◽  
Image Position

Classifying (unordered) sets by the elementary (first order) properties of their automorphism groups was undertaken in (7), (9) and (11). For example, if Ω is a set whose automorphism group, S(Ω), satisfiesthen Ω has cardinality at most ℵ0 and conversely (see (7)). We are interested in classifying homogeneous totally ordered sets (homogeneous chains, for short) by the elementary properties of their automorphism groups. (Note that we use ‘homogeneous’ here to mean that the automorphism group is transitive.) This study was begun in (4) and (5). For any set Ω, S(Ω) is primitive (i.e. has no congruences). However, the automorphism group of a homogeneous chain need not be o-primitive (i.e. it may have convex congruences). Fortunately, ‘o-primitive’ is a property that can be captured by a first order sentence for automorphisms of homogeneous chains. Hence our general problem falls naturally into two parts. The first is to classify (first order) the homogeneous chains whose automorphism groups are o-primitive; the second is to determine how the o-primitive components are related for arbitrary homogeneous chains whose automorphism groups are elementarily equivalent.

Automorphism groups and invariant theory on ℙN

2018 ◽  
Vol 17 (09) ◽  
pp. 1850162 ◽  
Author(s):  
João Alberto de Faria ◽  
Benjamin Hutz
Keyword(s):  
Fixed Point ◽  
Automorphism Group ◽  
Invariant Theory ◽  
Automorphism Groups ◽  
Finite Subgroup ◽  
Fixed Point Algorithm ◽  
Projective Linear Group ◽  
Rationality Problems ◽  
Stabilizer Group ◽  
A Finite Group

Let [Formula: see text] be a field and [Formula: see text] a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group [Formula: see text]. The group of automorphisms, or stabilizer group, of a given [Formula: see text] for this action is known to be a finite group. In this paper, we apply methods of invariant theory to automorphism groups by addressing two mainly computational problems. First, given a finite subgroup of [Formula: see text], determine endomorphisms of [Formula: see text] with that group as a subgroup of its automorphism group. In particular, we show that every finite subgroup occurs infinitely often and discuss some associated rationality problems. Inversely, given an endomorphism, determine its automorphism group. In particular, we extend the Faber–Manes–Viray fixed-point algorithm for [Formula: see text] to endomorphisms of [Formula: see text]. A key component is an explicit bound on the size of the automorphism group depending on the degree of the endomorphism.

On a Class of One-Relator Groups

1980 ◽  
Vol 32 (2) ◽  
pp. 414-420 ◽  
Author(s):  
A. M. Brunner
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Finitely Presented Group ◽  
One Relator Groups ◽  
Image Position ◽  
The University ◽  
Finitely Presented

In this paper, we consider the class of groups G(l, m; k) which are defined by the presentationwhere k, l, m are integers, and |l| > m > 0, k > 0. Groups in this class possess many properties which seem unusual, especially for one-relator groups. The basis for the results obtained below is the determination of endomorphisms.For certain of the groups, we are able to calculate their automorphism groups. One consequence of this is to produce examples of one-relator groups with infinitely generated automorphism groups. This answers a question raised by G. Baumslag (in a colloquium lecture at the University of Waterloo). Our examples are, perhaps, the simplest possible; J. Lewin [10] has found an example of a finitely presented group with an infinitely generated automorphism group.

SEMILATTICES AND THE RAMSEY PROPERTY

2015 ◽  
Vol 80 (4) ◽  
pp. 1236-1259 ◽  
Author(s):  
MIODRAG SOKIĆ
Keyword(s):  
Automorphism Group ◽  
Minimal Flow ◽  
Linear Extensions ◽  
Ramsey Property ◽  
Linear Orderings ◽  
Topological Interpretation ◽  
Finite Lattices ◽  
Image Position ◽  
Fraïssé Class ◽  
Uniquely Ergodic

AbstractWe consider${\cal S}$, the class of finite semilattices;${\cal T}$, the class of finite treeable semilattices; and${{\cal T}_m}$, the subclass of${\cal T}$which contains trees with branching bounded bym. We prove that${\cal E}{\cal S}$, the class of finite lattices with linear extensions, is a Ramsey class. We calculate Ramsey degrees for structures in${\cal S}$,${\cal T}$, and${{\cal T}_m}$. In addition to this we give a topological interpretation of our results and we apply our result to canonization of linear orderings on finite semilattices. In particular, we give an example of a Fraïssé class${\cal K}$which is not a Hrushovski class, and for which the automorphism group of the Fraïssé limit of${\cal K}$is not extremely amenable (with the infinite universal minimal flow) but is uniquely ergodic.

scholarly journals Some finiteness conditions for automorphism groups

1987 ◽  
Vol 29 (2) ◽  
pp. 259-265
Author(s):  
Silvana Franciosi ◽  
Francesco de Giovanni
Keyword(s):  
Automorphism Group ◽  
Finite Order ◽  
Automorphism Groups ◽  
Torsion Group ◽  
Finite Subgroup ◽  
Finiteness Conditions

Many authors have investigated the behaviour of the elements of finite order of a group G when finiteness conditions are imposed on the automorphism group Aut G of G. The first result was obtained in 1955 by Baer [1], who proved thata torsion group with finitely many automorphisms is finite. This theorem was generalized by Nagrebeckii in [6], where he proved that if the automorphism group Aut G is finite then the set of elements of finite order of G is a finite subgroup.

scholarly journals BOUNDEDNESS PROPERTIES OF AUTOMORPHISM GROUPS OF FORMS OF FLAG VARIETIES

2020 ◽  
Vol 25 (4) ◽  
pp. 1161-1184
Author(s):  
A. GULD
Keyword(s):  
Automorphism Group ◽  
Linear Group ◽  
General Linear Group ◽  
Automorphism Groups ◽  
Finite Subgroup ◽  
Flag Variety ◽  
General Linear ◽  
Roots Of Unity ◽  
Flag Varieties ◽  
Projective General Linear Group

Abstract We call a flag variety admissible if its automorphism group is the projective general linear group. (This holds in most cases.) Let K be a field of characteristic 0, containing all roots of unity. Let the K-variety X be a form of an admissible flag variety. We prove that X is either ruled, or the automorphism group of X is bounded, meaning that there exists a constant C ∈ ℕ such that if G is a finite subgroup of AutK(X), then the cardinality of G is smaller than C.

CONJUGATION IN TREE AUTOMORPHISM GROUPS

2001 ◽  
Vol 11 (05) ◽  
pp. 529-547 ◽  
Author(s):  
PIOTR W. GAWRON ◽  
VOLODYMYR V. NEKRASHEVYCH ◽  
VITALY I. SUSHCHANSKY
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Rooted Tree ◽  
Symmetric Groups ◽  
Wreath Products ◽  
Rooted Trees ◽  
Full Description ◽  
Finite Tree ◽  
Locally Finite ◽  
Infinite Sequences

It is given a full description of conjugacy classes in the automorphism group of the locally finite tree and of a rooted tree. They are characterized by their types (a labeled rooted trees) similar to the cyclical types of permutations. We discuss separately the case of a level homogenous tree, i.e. conjugality in wreath products of infinite sequences of symmetric groups. It is proved those automorphism groups of rooted and homogenous non-rooted trees are ambivalent.

Existentially closed central extensions of locally finite p-groups

1986 ◽  
Vol 100 (2) ◽  
pp. 281-301 ◽  
Author(s):  
Felix Leinen ◽  
Richard E. Phillips
Keyword(s):  
Central Extensions ◽  
Locally Finite ◽  
Existentially Closed ◽  
Image Position

Throughout, p will be a fixed prime, and will denote the class of all locally finite p-groups. For a fixed Abelian p-group A, we letwhere ζ(P) denotes the centre of P. Notice that A is not a class in the usual group-theoretic sense, since it is not closed under isomorphisms.

scholarly journals Serre’s Property (FA) for automorphism groups of free products

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Naomi Andrew
Keyword(s):  
Automorphism Group ◽  
Free Product ◽  
Finite Groups ◽  
Automorphism Groups ◽  
Sufficient Conditions ◽  
Free Products ◽  
Cyclic Groups ◽  
Link Type ◽  
Open Case

AbstractWe provide some necessary and some sufficient conditions for the automorphism group of a free product of (freely indecomposable, not infinite cyclic) groups to have Property (FA). The additional sufficient conditions are all met by finite groups, and so this case is fully characterised. Therefore, this paper generalises the work of N. Leder [Serre’s Property FA for automorphism groups of free products, preprint (2018), https://arxiv.org/abs/1810.06287v1]. for finite cyclic groups, as well as resolving the open case of that paper.

Sign in / Sign up

Export Citation Format

Share Document