The asymptotic behavior of automorphism groups of function fields over finite fields

Abstract

The purpose of this paper is to investigate the asymptotic behavior of automorphism groups of function fields when genus tends to infinity. Motivated by applications in coding and cryptography, we consider the maximum size of abelian subgroups of the automorphism group Aut(F/Fq) in terms of genus gF for a function field F over a finite field Fq. Although the whole group Aut(F/Fq) could have size (gF4), the maximum size mF of abelian subgroups of the automorphism group Aut(F/Fq) is upper bounded by 4gF+4 for gF 2. In the present paper, we study the asymptotic behavior of mF by defining Mq=gF→∞mF · q mFgF, where F runs through all function fields over Fq. We show that Mq lies between 2 and 3 (or 4) for odd characteristic (or for even characteristic, respectively). This means that mF grows much more slowly than genus does asymptotically. The second part of this paper is to study the maximum size bF of subgroups of Aut(F/Fq) whose order is coprime to q. The Hurwitz bound gives an upper bound bF 84(gF-1) for every function field F/Fq of genus gF 2. We investigate the asymptotic behavior of bF by defining Bq=gF→∞bFgF, where F runs through all function fields over Fq. Although the Hurwitz bound shows Bq 84, there are no lower bounds on Bq in literature. One does not even know if Bq=0. For the first time, we show that Bq 2/3 by explicitly constructing some towers of function fields in this paper.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…