Towards a classification of recursive towers of function fields over finite fields
type: Item
instance of: scholarly article
title: Towards a classification of recursive towers of function fields over finite fields
zbMATH Open document ID: 1104.11052
author: Arnaldo Garcia
author: Henning Stichtenoth
author: Peter Beelen
published in: Finite Fields and their Applications
publication date: 2006-02-07T00:00:00Z
review text: The authors deal with the question of classification of recursive towers of function fields over finite fields. Recall that a tower of function fields over \(\mathbb{F}_q\) is an infinite sequence \(\mathcal{F}=(F_0,F_1,\dots)\) of function fields \(F_n/\mathbb{F}_q\) such that (1) \(F_0 \subset F_1 \subset \dots\) and for all \(n \geq 0\) the extension \(F_{n+1}/F_n\) is separable of degree greater than \(1\). (2) For some \(r \geq 0\) the function field \(F_r\) has genus greater than \(1\). (3) For all \(n\), \(\mathbb{F}_q\) is algebraically closed in \(F_i\). If one denotes by \(g(F_n)\) the genus of \(F_n\) and by \(N(F_n)\) the number of rational places, the limit \[ \lambda(\mathcal{F})=\lim_{n \to \infty} \frac{N(F_n)}{g(F_n)} \] exists and the main purpose of these constructions is to compare it with \[ \limsup_{g \to \infty} \frac{N_q(g)}{g} \] where \(N_q(g)\) is the maximal number of points of an absolutely irreducible, projective smooth curve of genus \(g\) over \(\mathbb{F}_q\). Asymptotically good towers (i.e. such that \(\lambda(\mathcal{F})>0\)) are difficult to construct and most examples in the literature are of the following type. Definition: \(\mathcal{F}\) is recursive if it can be described by two separable rational functions \(f(T),g(T) \in \mathbb{F}_q(T)\), i.e. if there are elements \(x_i\) with (1) \(F_0=\mathbb{F}_q(x_0)\) is the rational function field. (2) \(F_{n+1}=F_n(x_{n+1})\) and \(f(x_{n+1})=g(x_n)\) for all \(n \geq 0\). (3) \([F_{n+1} : F_n]=\deg f(T)\) for all \(n \geq 0\) (the degree of \(f(T)=a(T)/b(T)\) with \(a,b \in \mathbb{F}_q[T]\) coprime is \(\max(\deg(a),\deg(b))\)). The authors prove then the following theorem which can be seen as a first step towards the classification of recursive towers. Theorem: Let \(\mathcal{F}\) be a tower which can be described recursively by the equation \(f_1(Y)=g_1(X)\) with \(f_1(T),g_1(T) \in \mathbb{F}_q(T)\). Let \(F=\mathbb{F}_q(x,y)\) with \(f(y)=g(x)\) and set \(z=f_1(y)=g_1(x) \in…
reviewed by: Christophe Ritzenthaler
Mathematics Subject Classification ID: 11R58
zbMATH DE Number: 5004386
zbMATH Keywords: recursive tower
zbMATH Keywords: classification
zbMATH Keywords: asymptotically good
zbMATH Keywords: function fields
MaRDI profile type: Publication
full work available at URL: j.ffa.2005.01.004
OpenAlex ID: W2044023351
cites work: On ramification and genus of recursive towers
cites work: On towers of function fields of Artin-Schreier type
cites work: A tower with non-Galois steps which attains the Drinfeld-Vladut bound
cites work: An explicit tower of function fields over cubic finite fields and Zink’s lower bound
cites work: Number of points of an algebraic curve
cites work: On the asymptotic behaviour of some towers of function fields over finite fields
cites work: Q4485863
cites work: On tame towers over finite fields
cites work: On towers and composita of towers of function fields over finite fields
cites work: AN ASYMPTOTICALLY GOOD TOWER OF CURVES OVER THE FIELD WITH EIGHT ELEMENTS
cites work: Algebraic function fields and codes
cites work: Q3705352
DOI: 10.1016/J.FFA.2005.01.004
description: scientific article; zbMATH DE number 5004386