Related papers: Arithmetically equivalent number fields have appro…

Let $K$ be a number field. The $K$-arithmetic type of a rational prime $\ell$ is the tuple $A_{K}(\ell)=(f^{K}_{1},...,f^{K}_{g_{\ell}})$ of the residue degrees of $\ell$ in $K$, written in ascending order. A well known result of Perlis…

Given a number field $K$ one associates to it the set $\Lambda_K$ of Dedekind zeta-functions of finite abelian extensions of $K$. In this short note we present a proof of the following Theorem: for any number field $K$ the set $\Lambda_K$…

It is a classic result that two number fields have equal Dedekind zeta functions if and only if the arithmetic type of a prime $p$ is the same in both fields for almost all prime $p$. Here, almost all means with the possible exception of a…

The Euclidean minimum $M(K)$ of a number field $K$ is an important numerical invariant that indicates whether $K$ is norm-Euclidean. When $K$ is a non-CM field of unit rank 2 or higher, Cerri showed $M(K)$, as the supremum in the Euclidean…

Given two distinct number fields $K$ and $M$, and finite order Hecke characters $\chi$ of $K$ and $\eta$ of $M$ respectively, we say that the pairs $(\chi, K)$ and $(\eta, M)$ are arithmetically equivalent if the associated L-functions…

Let $K$ be a number field. We give an arithmetic characterization at infinity of the differential operator of $K[x,d/dx]$ with minimal degree in $x$ annihilating a given $E$-function.

Let K be a number field. A finite group G is called K-admissible if there exists a G-crossed product K-division algebra. K-admissibility has a necessary condition called K-preadmissibility that is known to be sufficient in many cases. It is…

This is a revised version of ANT-0045. If K is a number field of degree n with discriminant D, if K=Q(a) then H(a)>c(n)|D|^(1/(2n-2)) where H(a) is the height of the minimal polynomial of a. We ask if one can always find a generator a of K…

Suppose $f(x,y)$ is a binary form of degree $d$ with coefficients in a field $K \subseteq \mathbb C$. The $K$-rank of $f$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We prove…

A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…

Two number fields are said to be Brauer equivalent if there is an isomorphism between their Brauer groups that commutes with restriction. In this paper we prove a variety of number theoretic results about Brauer equivalent number fields…

What is the probability for a number field of composite degree $d$ to have a nontrivial subfield? As the reader might expect the answer heavily depends on the interpretation of probability. We show that if the fields are enumerated by the…

There exist numerous results in the literature proving that within certain families of totally real number fields, the minimal rank of a universal quadratic lattice over such a field can be arbitrarily large. Kala introduced a technique of…

We show that for each abelian number field $K$ of sufficiently large degree $d$ there exists an element $\alpha\in K$ with $K=\IQ(\alpha)$ and absolute Weil height $H(\alpha)\ll_d |\Delta_K|^{1/2d}$ , where $\Delta_K$ denotes the…

In this short note we introduce the Belyi degree of a number field K, which is the smallest degree of a dessin d'enfant having K as field of moduli. After the description of some general properties (for example, the fact that there exist…

Suppose $K$ is a number field and $a_K(m)$ is the number of integral ideals of norm equal to $m$ in $K$, then for any integer $l$, we asymptotically evaluate the sum \[ \sum_{m\leqslant T} a_K^l(m) \] as $T\to\infty$. We also consider the…

Types over a discrete valued field $(K,v)$ are computational objects that parameterize certain families of monic irreducible polynomials in $K_v[x]$, where $K_v$ is the completion of $K$ at $v$. Two types are considered to be equivalent if…

In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all norm-Euclidean cubic number fields with discriminants -999 < d < 10000.

Solving a longstanding problem on equiangular lines, we determine, for each given fixed angle and in all sufficiently large dimensions, the maximum number of lines pairwise separated by the given angle. Fix $0 < \alpha < 1$. Let…

Two number fields with equal Dedekind zeta function are not necessarily isomorphic. However, if the number fields have equal sets of Dirichlet $L$-series then they \emph{are} isomorphic. We extend this result by showing that the…