Related papers: An Explicit Shimura Tower of Function Fields over …
In this paper, we recursively construct explicit elements of provably high order in finite fields. We do this using the recursive formulas developed by Elkies to describe explicit modular towers. In particular, we give two explicit…
We introduce a new construction of towers of algebraic curves over finite fields and provide a simple example of an optimal tower.
This paper concerns towers of curves over a finite field with many rational points, following Garcia--Stichtenoth and Elkies. We present a new method to produce such towers. A key ingredient is the study of algebraic solutions to Fuchsian…
We give a general recipe for explicitly constructing asymptotically optimal towers of modular curves such as {X_0(l^n): n=1,2,3,...}. We illustrate the method by giving equations for eight towers with various geometric features. We conclude…
We give explicit equations for the simplest towers of Drinfeld modular curves over any finite field, and observe that they coincide with the asymptotically optimal towers of curves constructed by Garcia and Stichtenoth.
In 2000, based on his procedure for constructing explicit towers of modular curves, Elkies deduced explicit equations of rank-2 Drinfeld modular curves which coincide with the asymptotically optimal towers of curves constructed by Garcia…
In these notes, we explore possible stable properties for the zeta function of a geometric Zp-tower of curves over a finite field of characteristic p, in the spirit of Iwasawa theory. A number of fundamental questions and conjectures are…
In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…
For a family of K3 surfaces we implement a variation of a general construction of towers of algebraic curves over finite fields given in a previous paper. As a result we get a good tower over $k=\mathbb{F}_{p^2}$, that is optimal if $p=3$.
We construct an explicit asymptotically good tower of curves over the field with eight elements. Its limit is 3/2.
Over all non-prime finite fields, we construct some recursive towers of function fields with many rational places. Thus we obtain a substantial improvement on all known lower bounds for Ihara's quantity $A(\ell)$, for $\ell = p^n$ with $p$…
In this paper we construct Galois towers with good asymptotic properties over any non-prime finite field $\mathbb F_{\ell}$; i.e., we construct sequences of function fields $\mathcal{N}=(N_1 \subset N_2 \subset \cdots)$ over $\mathbb…
We show the existence of toric resolution tower for an irreducible curve singularity which is explicitly described by Tschirnhausen polynomials. We deduce for a smooth affine plane curve from its topology restrictions for its singularity at…
Certain towers of function fields with complete splitting of rational places at each stage are constructed. Also, families oof towers with positive N/g ratios are described.
In this paper we study the problem of constructing non-trivial subtowers and supertowers of recursive towers of function fields over finite fields.
The explicit construction of function fields tower with many rational points relative to the genus in the tower play a key role for the construction of asymptotically good algebraic-geometric codes. In 1997 Garcia, Stichtenoth and Thomas…
In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.
In this paper we investigate examples of good and optimal Drinfeld modular towers of function fields. Surprisingly, the optimality of these towers has not been investigated in full detail in the literature. We also give an algorithmic…
The notion of a Frobenius coring is introduced, and it is shown that any such coring produces a tower of Frobenius corings and Frobenius extensions. This establishes a one-to-one correspondence between Frobenius corings and extensions.
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.