Related papers: Genus computation of global function fields
The second generalized GK function fields $K_n$ are a recently found family of maximal function fields over the finite field with $q^{2n}$ elements, where $q$ is a prime power and $n \ge 1$ an odd integer. In this paper we construct many…
We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…
In the first part of this paper, we develop a general framework that permits a comparison between explicit class field theories for a family of rational function fields $\mathbb{F}_s(t)$ over arbitrary constant fields $\mathbb{F}_s$ and…
In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…
We develop two methods for expressing the global index of the gradient of a 2 variable polynomial function $f$: in terms of the atypical fibres of $f$, and in terms of the clusters of Milnor arcs at infinity. These allow us to derive upper…
Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…
This paper provides an algorithm enumerating superspecial trigonal curves of genus $5$ over finite fields. Executing the algorithm over a computer algebra system Magma, we enumerate them over finite fields $\mathbb{F}_{p^a}$ for any natural…
Let k be a local field and let A be the two-by-two matrix algebra over k. In our previous work we developed a theory that allows the computation of the set of maximal orders in A containing a given suborder. This set is given as a sub-tree…
A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…
The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…
We construct compact descriptions of function fields and number fields.
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
We introduce an algorithm that computes explicit class fields of an imaginary quadratic field $K$ for a given modulus $\mathfrak{f}\subset\mathcal{O}_K$ more efficiently than the use of their classical counterparts. Therein, we prove the…
Let H be a connected reductive group defined over a non-archimedean local field F of characteristic p>0. Using Poincar\'e series, we globalize supercuspidal representations of H(F) in such a way that we have control over ramification at all…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate…
In this paper we give an algorithm for the computation of all the Arf numerical semigroups with a given genus. Moreover, we generalize the concept of genus of a numerical semigroup to good semigroups of $\mathbb{N}^r$ and we give a…