2000 character limit reached
Good Towers of Function Fields
Published 19 Sep 2013 in math.NT | (1309.4951v1)
Abstract: In this paper, we will give an overview of known and new techniques on how one can obtain explicit equations for candidates of good towers of function fields. The techniques are founded in modular theory (both the classical modular theory and the Drinfeld modular theory). In the classical modular setup, optimal towers can be obtained, while in the Drinfeld modular setup, good towers over any non-prime field may be found. We illustrate the theory with several examples, thus explaining some known towers as well as giving new examples of good explicitly defined towers of function fields.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.