On automorphism groups of countable structures

1998 ◽  
Vol 63 (3) ◽  
pp. 891-896 ◽  
Author(s):  
Su Gao
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Polish Groups ◽  
Equivalent Models ◽  
Complete Metrics ◽  
Countable Structure

AbstractStrengthening a theorem of D. W. Kueker, this paper completely charaterizes which countable structures do not admit uncountable Lω1ω-elementarily equivalent models. In particular, it is shown that if the automorphism group of a countable structure M is abelian, or even just solvable, then there is no uncountable model of the Scott sentence of M. These results arise as part of a study of Polish groups with compatible left-invariant complete metrics.

scholarly journals AUTOMORPHISM GROUPS OF RANDOMIZED STRUCTURES

2017 ◽  
Vol 82 (3) ◽  
pp. 1150-1179 ◽  
Author(s):  
TOMÁS IBARLUCÍA
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Original Structure ◽  
Polish Groups ◽  
Separable Models

AbstractWe study automorphism groups of randomizations of separable structures, with focus on the ℵ0-categorical case. We give a description of the automorphism group of the Borel randomization in terms of the group of the original structure. In the ℵ0-categorical context, this provides a new source of Roelcke precompact Polish groups, and we describe the associated Roelcke compactifications. This allows us also to recover and generalize preservation results of stable and NIP formulas previously established in the literature, via a Banach-theoretic translation. Finally, we study and classify the separable models of the theory of beautiful pairs of randomizations, showing in particular that this theory is never ℵ0-categorical (except in basic cases).

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.

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.

scholarly journals On a Theorem of Bers, with Applications to the Study of Automorphism Groups of Domains

2016 ◽  
Vol 59 (2) ◽  
pp. 346-353
Author(s):  
Steven Krantz
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Holomorphic Functions ◽  
Biholomorphic Equivalence ◽  
Algebras Of Holomorphic Functions

AbstractWe study and generalize a classical theoremof L. Bers that classifies domains up to biholomorphic equivalence in terms of the algebras of holomorphic functions on those domains. Then we develop applications of these results to the study of domains with noncompact automorphism group

scholarly journals A note on subgroups of automorphism groups of full shifts

2016 ◽  
Vol 38 (4) ◽  
pp. 1588-1600 ◽  
Author(s):  
VILLE SALO
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Endomorphism Monoid ◽  
Direct Products ◽  
Free Products ◽  
Group Case ◽  
Sofic Shift ◽  
Full Shift

We discuss the set of subgroups of the automorphism group of a full shift and submonoids of its endomorphism monoid. We prove closure under direct products in the monoid case and free products in the group case. We also show that the automorphism group of a full shift embeds in that of an uncountable sofic shift. Some undecidability results are obtained as corollaries.

scholarly journals A SURVEY ON THE AUTOMORPHISM GROUPS OF THE COMMUTING GRAPHS AND POWER GRAPHS

2019 ◽  
pp. 729
Author(s):  
Mahsa Mirzargar
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
The Other ◽  
Power Graph ◽  
Commuting Graph ◽  
Vertex Set ◽  
Delta G ◽  
Nite Group

Let G be a nite group. The power graph P(G) of a group G is the graphwhose vertex set is the group elements and two elements are adjacent if one is a power of the other. The commuting graph \Delta(G) of a group G, is the graph whose vertices are the group elements, two of them joined if they commute. When the vertex set is G-Z(G), this graph is denoted by \Gamma(G). Since the results based on the automorphism group of these kinds of graphs are so sporadic, in this paper, we give a survey of all results on the automorphism group of power graphs and commuting graphs obtained in the literature.

scholarly journals Automorphism groups of covering posets and of dense posets

1992 ◽  
Vol 35 (1) ◽  
pp. 115-120
Author(s):  
Gerhard Behrendt
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Natural Homomorphism ◽  
Partially Ordered ◽  
Maximal Chains

Given a poset (X, ≦), the covering poset (C(X), ≦) consists of the set C(X) of covering pairs, that is, pairs (a, b)∈X2 with a<b such that there is no c∈X with a<c<b, partially ordered by (a, b)≦(a′, b′) if and only if (a, b) = (a′, b′) or b≦a′. There is a natural homomorphism v from the automorphism group of (X, ≦) into the automorphism group of (C(X), ≦). It is shown that given groups G, H and a homomorphism α from G into H there exists a poset (X, ≦) and isomorphisms φψ from G onto Aut(X, ≦), respectively from H onto Aut(C(X), ≦) such that φv = αψ. It is also shown that every group is isomorphic to the automorphism group of a poset all of whose maximal chains are isomorphic to the nationals.

scholarly journals Abelian Varieties as Automorphism Groups of Smooth Projective Varieties

2018 ◽  
Vol 2020 (7) ◽  
pp. 1942-1956
Author(s):  
Davide Lombardo ◽  
Andrea Maffei
Keyword(s):  
Automorphism Group ◽  
Projective Variety ◽  
Automorphism Groups ◽  
Abelian Varieties ◽  
Smooth Projective Variety ◽  
Projective Varieties ◽  
Smooth Projective Varieties

Abstract We determine which complex abelian varieties can be realized as the automorphism group of a smooth projective variety.

Existence of regular 3-polytopes of order 2𝑛

2019 ◽  
Vol 22 (4) ◽  
pp. 579-616 ◽  
Author(s):  
Dong-Dong Hou ◽  
Yan-Quan Feng ◽  
Dimitri Leemans
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Partial Answer ◽  
Regular Polytopes ◽  
Regular Polytope ◽  
Positive Integers

AbstractIn this paper, we prove that for any positive integers {n,s,t} such that {n\geq 10}, {s,t\geq 2} and {n-1\geq s+t}, there exists a regular polytope with Schläfli type {\{2^{s},2^{t}\}} and its automorphism group is of order {2^{n}}. Furthermore, we classify regular polytopes with automorphism groups of order {2^{n}} and Schläfli types {\{4,2^{n-3}\},\{4,2^{n-4}\}} and {\{4,2^{n-5}\}}, therefore giving a partial answer to a problem proposed by Schulte and Weiss in [Problems on polytopes, their groups, and realizations, Period. Math. Hungar. 53 2006, 1–2, 231–255].

Strong map-symmetry of SL(3,K) and PSL(3,K) for every finite field K

2020 ◽  
pp. 2150048
Author(s):  
Antonio Breda d’Azevedo ◽  
Domenico A. Catalano
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Automorphism Groups ◽  
Group Automorphism ◽  
Regular Maps ◽  
Strong Map

In this paper, we show that for any finite field [Formula: see text], any pair of map-generators (that is when one of the generators is an involution) of [Formula: see text] and [Formula: see text] has a group automorphism that inverts both generators. In the theory of maps, this corresponds to say that any regular oriented map with automorphism group [Formula: see text] or [Formula: see text] is reflexible, or equivalently, there are no chiral regular maps with automorphism group [Formula: see text] or [Formula: see text]. As remarked by Leemans and Liebeck, also [Formula: see text] and [Formula: see text] are not automorphism groups of chiral regular maps. These two results complete the work of the above authors on simples groups supporting chiral regular maps.

Sign in / Sign up

Export Citation Format

Share Document