scholarly journals A projective variety with discrete, non-finitely generated automorphism group

2017 ◽  
Vol 212 (1) ◽  
pp. 189-211 ◽  
Author(s):  
John Lesieutre
Keyword(s):  
Automorphism Group ◽  
Projective Variety ◽  
Finitely Generated

scholarly journals Arithmetic hyperbolicity: automorphisms and persistence

2021 ◽  
Author(s):  
Ariyan Javanpeykar
Keyword(s):  
Automorphism Group ◽  
Number Field ◽  
Projective Variety ◽  
Rational Points ◽  
General Criterion ◽  
Finitely Generated ◽  
Integral Points ◽  
Lang's Conjecture ◽  
Lang’S Conjecture

AbstractWe show that if the automorphism group of a projective variety is torsion, then it is finite. Motivated by Lang’s conjecture on rational points of hyperbolic varieties, we use this to prove that a projective variety with only finitely many rational points has only finitely many automorphisms. Moreover, we investigate to what extent finiteness of S-integral points on a variety over a number field persists over finitely generated fields. To this end, we introduce the class of mildly bounded varieties and prove a general criterion for proving this persistence.

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.

scholarly journals THE AUTOMORPHISM GROUP OF A SHIFT OF LINEAR GROWTH: BEYOND TRANSITIVITY

2015 ◽  
Vol 3 ◽  
Author(s):  
VAN CYR ◽  
BRYNA KRA
Keyword(s):  
Automorphism Group ◽  
Finite Groups ◽  
Linear Growth ◽  
Finite Alphabet ◽  
Finitely Generated ◽  
Complexity Function ◽  
Algebraic Properties

For a finite alphabet ${\mathcal{A}}$ and shift $X\subseteq {\mathcal{A}}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group $\text{Aut}(X)$. For such systems, we show that every finitely generated subgroup of $\text{Aut}(X)$ is virtually $\mathbb{Z}^{d}$, in contrast to the behavior when the complexity function grows more quickly. With additional dynamical assumptions we show more: if $X$ is transitive, then $\text{Aut}(X)$ is virtually $\mathbb{Z}$; if $X$ has dense aperiodic points, then $\text{Aut}(X)$ is virtually $\mathbb{Z}^{d}$. We also classify all finite groups that arise as the automorphism group of a shift.

scholarly journals A GENERATING SET FOR THE AUTOMORPHISM GROUP OF A GRAPH PRODUCT OF ABELIAN GROUPS

2012 ◽  
Vol 22 (01) ◽  
pp. 1250003 ◽  
Author(s):  
L. J. CORREDOR ◽  
M. A. GUTIERREZ
Keyword(s):  
Automorphism Group ◽  
London Math ◽  
Abelian Groups ◽  
Graph Products ◽  
Graph Product ◽  
Finitely Generated ◽  
Generating Set ◽  
Labeled Graph

We find a set of generators for the automorphism group Aut G of a graph product G of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup Aut ⋆ G defined in [Automorphisms of graph products of abelian groups, to appear in Groups, Geometry and Dynamics]. We follow closely the plan of M. Laurence's paper [A generating set for the automorphism group of a graph group, J. London Math. Soc. (2)52(2) (1995) 318–334].

Finite Quotients of the Automorphism Group of a Free Group

1977 ◽  
Vol 29 (3) ◽  
pp. 541-551 ◽  
Author(s):  
Robert Gilman
Keyword(s):  
Automorphism Group ◽  
Normal Subgroup ◽  
Free Group ◽  
Outer Automorphism ◽  
Permutation Representation ◽  
Finitely Generated ◽  
Outer Automorphism Group ◽  
Finite Quotients

Let G and F be groups. A G-defining subgroup of F is a normal subgroup N of F such that F/N is isomorphic to G. The automorphism group Aut (F) acts on the set of G-defining subgroups of F. If G is finite and F is finitely generated, one obtains a finite permutation representation of Out (F), the outer automorphism group of F. We study these representations in the case that F is a free group.

scholarly journals COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS

2010 ◽  
Vol 20 (03) ◽  
pp. 343-355 ◽  
Author(s):  
JEREMY MACDONALD
Keyword(s):  
Automorphism Group ◽  
Word Problem ◽  
Free Group ◽  
Polynomial Time ◽  
Free Groups ◽  
Finitely Generated

We show that the compressed word problem in a finitely generated fully residually free group ([Formula: see text]-group) is decidable in polynomial time, and use this result to show that the word problem in the automorphism group of an [Formula: see text]-group is decidable in polynomial time.

The automorphism group of a finitely generated virtually abelian group

2016 ◽  
Vol 8 (1) ◽  
Author(s):  
Bettina Eick
Keyword(s):  
Abelian Group ◽  
Automorphism Group ◽  
Automorphism Groups ◽  
Finitely Generated ◽  
Crystallographic Groups ◽  
Practical Algorithm

AbstractWe describe a practical algorithm to compute the automorphism group of a finitely generated virtually abelian group. As application, we describe the automorphism groups of some small-dimensional crystallographic groups.

scholarly journals Free Steiner triple systems and their automorphism groups

2014 ◽  
Vol 14 (02) ◽  
pp. 1550025 ◽  
Author(s):  
Alexander Grishkov ◽  
Diana Rasskazova ◽  
Marina Rasskazova ◽  
Izabella Stuhl
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Steiner Triple Systems ◽  
Finitely Generated ◽  
Combinatorial Structures ◽  
Triple Systems ◽  
Free Objects

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is not finitely generated if the loop is more than 3-generated. For the free Steiner loop with three generators we describe the generator elements of the automorphism group and some relations between them.

scholarly journals On the polyhedrality of global Okounkov bodies

2016 ◽  
Vol 16 (1) ◽  
Author(s):  
David Schmitz ◽  
Henrik Seppänen
Keyword(s):  
General Result ◽  
Projective Variety ◽  
Smooth Projective Variety ◽  
Alternative Proof ◽  
Finitely Generated ◽  
Inductive Methods ◽  
Effective Cone

AbstractWe prove that the existence of a finite Minkowski basis for Okounkov bodies on a smooth projective variety with respect to an admissible flag implies the rational polyhedrality of the global Okounkov body. As an application of this general result, we deduce that the global Okounkov body of a surface with finitely generated pseudo-effective cone with respect to a general flag is rational polyhedral. We give an alternative proof for this fact which recovers the generators more explicitly. We also prove the rational polyhedrality of global Okounkov bodies in the case of certain homogeneous 3-folds using inductive methods.

Sign in / Sign up

Export Citation Format

Share Document