ﻻ يوجد ملخص باللغة العربية
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.
This paper presents an algorithm for generating all imaginary and unusual discriminants up to a fixed degree bound that define a quadratic function field of positive 3-rank. Our method makes use of function field adaptations of a method due to Belaba
For a cubic algebraic extension $K$ of $mathbb{Q}$, the behavior of the ideal counting function is considered in this paper. Let $a_{K}(n)$ be the number of integral ideals of the field $K$ with norm $n$. An asymptotic formula is given for the sum $$
In this paper, we study simple cubic fields in the function field setting, and also generalize the notion of a set of exceptional units to cubic function fields, namely the notion of $k$-exceptional units. We give a simple proof that the Galois simpl
Let $Q(alpha)$ be the simplest cubic field, it is known that $Q(alpha)$ can be generated by adjoining a root of the irreducible equation $x^{3}-kx^{2}+(k-3)x+1=0$, where $k$ belongs to $Q$. In this paper we have established a relationship between $al
Let ${mathbb F}_q$ be the finite field with $q=p^k$ elements with $p$ being a prime and $k$ be a positive integer. For any $y, zinmathbb{F}_q$, let $N_s(z)$ and $T_s(y)$ denote the numbers of zeros of $x_1^{3}+cdots+x_s^3=z$ and $x_1^3+cdots+x_{s-1}^