Computing the Group of an Algebraic Variety over a Finite Field
摘要
We present a practical algorithm to computing the automorphism group of a variety. Our algorithm is based on combinatorial tools from graph theory, in particular the notion of a canonical form. Performance issues and relations to other approaches will be discussed.