Related papers: Explicit genus formula for any separable cubic glo…
We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…
In this paper, a new criterion is given to determine the $p-$rationality of some complex cubic number fields in terms of $ p-$divisibility of certain terms of a third-order recurrence sequence, several illustrated examples are…
We determine the distribution of discriminants of wildly ramified elementary-abelian extensions of local and global function fields in characteristic $p$. For local and rational function fields, we also give precise formulae for the number…
We classify cuts in (totally) ordered abelian groups $\g$ and compute the coinitiality and cofinality of all cuts in case $\g$ is divisible, in terms of data intrinsically associated to the invariance group of the cut. We relate cuts with…
It is shown that any finitely generated subring of a global field has a universal first-order definition in its fraction field. This covers Koenigsmann's result for the ring of integers and its subsequent extensions to rings of integers in…
We study on finite unramified extensions of global function fields (function fields of one valuable over a finite field). We show two results. One is an extension of Perret's result about the ideal class group problem. Another is a…
The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ of a ribbon graph $G$ is the generating function that enumerates all partial duals of $G$. In this paper, we give a categorification for this polynomial. The key ingredient of…
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…
Let $K$ be a local field with finite residue field, we define a normal form for Eisenstein polynomials depending on the choice of a uniformizer $\pi_K$ and of residue representatives. The isomorphism classes of extensions generated by the…
We describe a procedure for generating families of cyclic cubic fields with explicit fundamental units. This method generates all known families and gives new ones.
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
Group cohomology of polynomial growth is defined for any finitely generated discrete group, using cochains that have polynomial growth with respect to the word length function. We give a geometric condition that guarantees that it agrees…
For a cyclic Kummer extension $K$ of a rational function field $k$ is considered, via class field theory, the extended Hilbert class field $K_H^+$ of $K$ and the corresponding extended genus field $K_g^+$ of $K$ over $k$, along the lines of…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
We study the minimal number of ramified primes in Galois extensions of rational function fields over finite fields with prescribed finite Galois group. In particular, we obtain a general conjecture in analogy with the well studied case of…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…