Related papers: Norm relations and computational problems in numbe…

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

In this paper we investigate the connection between relations among various invariants of number field s $L^H$ coresponding to subgroups $H$ acting on $L$ and of linear relations among norm idempotents.

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…

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…

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

Let C be an algebraically closed field and X a projective curve over C. Consider an ordinary linear differential equation, or a linear differ- ence equation, with coefficients in the field of rational functions of X, and assume that its…

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

We show that semigroup C*-algebras attached to ax+b-semigroups over rings of integers determine number fields up to arithmetic equivalence, under the assumption that the number fields have the same number of roots of unity. For finite…

We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…

This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…

We compute the Z-rank of the subgroup of elements of the multiplicative group of a number field K that are norms from every finite level of the cyclotomic Z{\ell}-extension of K. Thus we compare its {\ell}-adification with the group of…

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…

Let $G$ be a finite group. Then there exists a first-order statement $S(G)$ in the language of rings without parameters and depending only on $G$ such that, for any field $K$, we have that $K\models S(G)$ if and only if $K$ has a Galois…

We study cyclotomic association schemes over a finite commutative ring $R$ with identity. The main interest for us is to identify the normal cyclotomic schemes $C$, i.e. those for which $Aut(C)$ is a subgroup of the one-dimensional affine…

We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…

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…

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

For each finite subgroup $G$ of $PGL_2(\mathbb{Q})$, and for each integer $n$ coprime to $6$, we construct explicitly infinitely many Galois extensions of $\mathbb{Q}$ with group $G$ and whose ideal class group has $n$-rank at least…

Let $H$ be a skew field of finite dimension over its center $k$. We solve the Inverse Galois Problem over the field of fractions $H(X)$ of the ring of polynomial functions over $H$ in the variable $X$, if $k$ contains an ample field.

In this article, we focus on orders in arbitrary number fields, consider their Picard groups and finally obtain ring class fields corresponding to them. The Galois group of the ring class field is isomorphic to the Picard group. As an…