Abstract
Let be a field and a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group . The group of automorphisms, or stabilizer group, of a given for this action is known to be a finite group. In this article, we address two mainly computational problems concerning automorphism groups. Given a finite subgroup of determine endomorphisms of with that group as 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 extended the Faber-Manes-Viray fixed-point algorithm for to endomorphisms of . A key component is an explicit bound on the size of the automorphism group depending on the degree of the endomorphism.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.