Tabulation of cubic function fields via polynomial binary cubic forms

We present a method for tabulating all cubic function fields over $\mathbb{F}_q(t)$ whose discriminant $D$ has either odd degree or even degree and the leading coefficient of $-3D$ is a non-square in $\mathbb{F}_{q}^*$, up to a given bound $B$ on the degree of $D$. Our method is based on a generalization of Belabas' method for tabulating cubic number fields. The main theoretical ingredient is a generalization of a theorem of Davenport and Heilbronn to cubic function fields, along with a reduction theory for binary cubic forms that provides an efficient way to compute equivalence classes of binary cubic forms. The algorithm requires $O(B^4 q^B)$ field operations as $B \rightarrow \infty$. The algorithm, examples and numerical data for $q=5,7,11,13$ are included.Comment: 30 pages, minor typos corrected, extra table entries added, revamped complexity analysis of the algorithm. To appear in Mathematics of Computatio

Black Box Galois Representations

We develop methods to study $2$-dimensional $2$-adic Galois representations $\rho$ of the absolute Galois group of a number field $K$, unramified outside a known finite set of primes $S$ of $K$, which are presented as Black Box representations, where we only have access to the characteristic polynomials of Frobenius automorphisms at a finite set of primes. Using suitable finite test sets of primes, depending only on $K$ and $S$, we show how to determine the determinant $\det\rho$, whether or not $\rho$ is residually reducible, and further information about the size of the isogeny graph of $\rho$ whose vertices are homothety classes of stable lattices. The methods are illustrated with examples for $K=\mathbb{Q}$, and for $K$ imaginary quadratic, $\rho$ being the representation attached to a Bianchi modular form. These results form part of the first author's thesis.Comment: 40 pages, 3 figures. Numerous minor revisions following two referees' report