The asymptotic behavior of automorphism groups of function fields over finite fields
Liming Ma, Chaoping Xing

TL;DR
This paper investigates the asymptotic growth of automorphism groups of function fields over finite fields, providing bounds on abelian subgroup sizes and subgroup orders coprime to the base field, with implications for coding and cryptography.
Contribution
It establishes new bounds on the growth rates of automorphism subgroup sizes, including the first lower bound on the asymptotic ratio of subgroup size to genus.
Findings
Maximum abelian subgroup size grows slower than genus, bounded by 4g+4.
The limsup of scaled abelian subgroup size is between 2 and 4 depending on characteristic.
The paper provides the first explicit lower bound (2/3) for the asymptotic ratio of subgroup size coprime to q.
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 in terms of genus for a function field over a finite field . Although the whole group could have size , the maximum size of abelian subgroups of the automorphism group is upper bounded by for . In the present paper, we study the asymptotic behavior of by defining , where runs through all function fields over . We show that lies between and (or ) for odd…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Algebraic Geometry and Number Theory
