Recursive towers of curves over finite fields using graph theory
From MaRDI portal
Abstract: We give a new way to study recursive towers of curves over a finite field, defined from a bottom curve and a correspondence on .In particular, we study their asymptotic behavior. A close examination of singularities leads to a necessary condition for a tower to be asymptotically good. Then, spectral theory on a directed graph and considerations on the class of in lead to the fact that, under some mild assumptions, a recursive tower which does not reach Drinfeld-Vladut bound cannot be optimal in Tsfasmann-Vladut sense. Results are applied to the Bezerra-Garcia-Stichtenoth tower along the paper for illustration.
Recommendations
- A graph aided strategy to produce good recursive towers over finite fields
- On ramification and genus of recursive towers
- scientific article; zbMATH DE number 2231489
- Towards a classification of recursive towers of function fields over finite fields
- Graphs and recursively defined towers of function fields
Cited in
(7)- Correspondences without a core
- Graphs and recursively defined towers of function fields
- Number of points of curves over finite fields in some relative situations from an Euclidean point of view
- AN ASYMPTOTICALLY GOOD TOWER OF CURVES OVER THE FIELD WITH EIGHT ELEMENTS
- A graph aided strategy to produce good recursive towers over finite fields
- Optimal and maximal singular curves
- On self-correspondences on curves
This page was built for publication: Recursive towers of curves over finite fields using graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2801861)