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

From MaRDI portal
Publication:5222729




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 mboxAut(F/mathbbFq) in terms of genus gF for a function field F over a finite field mathbbFq. Although the whole group mboxAut(F/mathbbFq) could have size Omega(gF4), the maximum size mF of abelian subgroups of the automorphism group mboxAut(F/mathbbFq) is upper bounded by 4gF+4 for gFge2. In the present paper, we study the asymptotic behavior of mF by defining Mq=limsupgFightarrowinftyfracmFcdotlogqmFgF, where F runs through all function fields over mathbbFq. 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 mboxAut(F/mathbbFq) whose order is coprime to q. The Hurwitz bound gives an upper bound bFle84(gF1) for every function field F/mathbbFq of genus gFge2. We investigate the asymptotic behavior of bF by defining Bq=limsupgFightarrowinftyfracbFgF, where F runs through all function fields over mathbbFq. Although the Hurwitz bound shows Bqle84, there are no lower bounds on Bq in literature. One does not even know if Bq=0. For the first time, we show that Bqge2/3 by explicitly constructing some towers of function fields in this paper.









This page was built for publication: The asymptotic behavior of automorphism groups of function fields over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222729)