Related papers: Genus computation of global function fields

Let $G$ be an absolutely almost simple algebraic group over a field $K$. The genus ${\bf gen}_K(G)$ of $G$ is the set of $K$-isomorphism classes of $K$-forms $G'$ of $G$ that have the same $K$-isomorphism classes of maximal $K$-tori as $G$.…

The goal of this paper is to calculate explicitly the field index of any quintic number field $K$ generated by a complex root $\al$ of a monic irreducible trinomial $F(x) = x^5+ax+b \in \Z[x]$. In such a way we provide a complete answer to…

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…

Using a remainder theorem for valuations of a field, we give a new perspective on the norm function of a global field. We define the Euler totient function of a global field and recover the essential analytical properties of the classical…

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…

Let $K$ be a global function field. We obtain a set of formulas for the densities of the Kodaira types and Tamagawa numbers of elliptic curves over a completion of $K$ that is independent of the field's characteristic. Furthermore, for a…

Let X(F,G) be the G-character variety of F where G is a rank 1 complex affine algebraic group and F is a finitely presentable discrete group. We describe an algorithm, which we implement in Mathematica, SageMath, and in Python, that takes a…

In this paper we present a fast and accurate numerical algorithm for the computation of hyperspherical Bessel functions of large order and real arguments. For the hyperspherical Bessel functions of closed type, no stable algorithm existed…

We present an algorithm for the computation of logarithmic l-class groups of number fields. Our principal motivation is the effective determination of the l-rank of the wild kernel in the K-theory of number fields.

We study the theory of a global field k as a k-vector space with a predicate for one of the absolute values on k. For example, we prove that in this language a global field with an ultrametric or real archimedean absolute value has a…

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

In this paper, we consider a general notion of convolution. Let $D$ be a finite domain and let $D^n$ be the set of $n$-length vectors (tuples) of $D$. Let $f : D \times D \to D$ be a function and let $\oplus_f$ be a coordinate-wise…

We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term…

We adapt an old local-to-global technique of Ore to compute, under certain mild assumptions, an integral basis of a number field without a previous factorization of the discriminant of the defining polynomial. In a first phase, the method…

We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…

Let K be a local field of characteristic zero, O its ring of integers and F(x) a monic irreducible polynomial with coefficients in O. K. Okutsu attached to F(x) certain primitive divisor polynomials F_1(x),..., F_r(x), that are specially…

We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

We revisit the classical problem of computing the \emph{contour tree} of a scalar field $f:\mathbb{M} \to \mathbb{R}$, where $\mathbb{M}$ is a triangulated simplicial mesh in $\mathbb{R}^d$. The contour tree is a fundamental topological…