scholarly journals Automorphism Groups of Compact Complex Surfaces

Author(s):  
Yuri Prokhorov ◽  
Constantin Shramov

Abstract We study automorphism groups and birational automorphism groups of compact complex surfaces. We show that the automorphism group of such a surface $X$ is always Jordan, and the birational automorphism group is Jordan unless $X$ is birational to a product of an elliptic and a rational curve.

2020 ◽  
Vol 211 (9) ◽  
pp. 1310-1322 ◽  
Author(s):  
Yu. G. Prokhorov ◽  
C. A. Shramov

2020 ◽  
Vol 31 (11) ◽  
pp. 2050083
Author(s):  
Constantin Shramov

We classify finite groups acting by birational transformations of a nontrivial Severi–Brauer surface over a field of characteristic zero that are not conjugate to subgroups of the automorphism group. Also, we show that the automorphism group of a smooth cubic surface over a field [Formula: see text] of characteristic zero that has no [Formula: see text]-points is abelian, and find a sharp bound for the Jordan constants of birational automorphism groups of such cubic surfaces.


2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Naomi Andrew

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.


2006 ◽  
Vol 71 (1) ◽  
pp. 203-216 ◽  
Author(s):  
Ermek S. Nurkhaidarov

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.


2016 ◽  
Vol 59 (2) ◽  
pp. 346-353
Author(s):  
Steven Krantz

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


2017 ◽  
Vol 82 (3) ◽  
pp. 1150-1179 ◽  
Author(s):  
TOMÁS IBARLUCÍA

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).


2016 ◽  
Vol 38 (4) ◽  
pp. 1588-1600 ◽  
Author(s):  
VILLE SALO

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.


Author(s):  
Mahsa Mirzargar

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.


Sign in / Sign up

Export Citation Format

Share Document