Related papers: A new Algorithm for the Computation of logarithmic…
We present an algorithm for computing the 2-group of narrow logarithmic divisor classes of degree 0 for number fields F. As an application, we compute in some cases the 2-rank of the wild kernel WK2(F).
We study the l-part of the the wild \'etale kernels WK2i(F) of an arbitary number field F for a given prime l in connection with the logarithmic l-class groups. From the logarithmic arithmetic we deduce rank formulas, periodicity and…
By using the logarithmic approach of the classical kernels for the K2 of number fields, we compute the 2-rank of the wild kernel WK2(F) and the 2-rank of the subgroup of infinite heigh elements in K2(F) in terms of positive class groups for…
We present an algorithm for computing the 2-group of the positive divisor classes of a number field F in case F has exceptional dyadic places. As an application, we compute the 2-rank of the wild kernel WK2(F) in K2(F) for such number…
In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…
We classify the types of root systems $R$ in the rings of integers of number fields $K$ such that the Weyl group $W(R)$ lies in the group $\mathcal L(K)$ generated by ${\rm Aut} (K)$ and multiplications by the elements of $K^*$. We also…
We announce new methods for using prismatic cohomology to compute the K-groups of $\mathbb{Z}/p^n$ and related rings. We use computer algebra methods to compute these K-groups through a large range in specific cases and also obtain explicit…
In this paper, we develop general machinery for computing the classifying ring $L^A$ of one-dimensional formal $A$-modules, for various commutative rings $A$. We then apply the machinery to obtain calculations of $L^A$ for various number…
Arithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an algorithm which, given such a group Gamma, returns a fundamental domain and a finite presentation for Gamma with a computable isomorphism.
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…
There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…
In this paper we analyze the computational costs of various operations and algorithms in algebraic number fields using exact arithmetic. Let $K$ be an algebraic number field. In the first half of the paper, we calculate the running time and…
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we…
We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra and…