Related papers: Distribution of orders in number fields

For a binary quadratic form $Q$, we consider the action of $\mathrm{SO}_Q$ on a two-dimensional vector space. This representation yields perhaps the simplest nontrivial example of a prehomogeneous vector space that is not irreducible, and…

We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…

In this article, we introduce a class of invariants of cubic fields termed generalized discriminants. We then obtain asymptotics for the families of cubic fields ordered by these invariants. In addition, we determine which of these families…

We consider cubic number fields ordered by their discriminants, and show that there exist arbitrarily long sequences that contain only fields with class numbers greater than a given bound.

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…

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…

Building on work by Zagier, Bousquet-M\'elou et al., and Khamis, we give an asymptotic formula for the number of labelled interval orders on an $n$-element set.

We determine the set of catenary degrees, the set of distances, and the unions of sets of lengths of the monoid of nonzero ideals and of the monoid of invertible ideals of orders in quadratic number fields.

Let $K$ be a number field with ring of integers $\mathbb{Z}_K$. We prove two asymptotic formulas connected with the distribution of irreducible elements in $\mathbb{Z}_K$. First, we estimate the maximum number of nonassociated irreducibles…

We study the probability distribution of the number of common zeros of a system of $m$ random $n$-variate polynomials over a finite commutative ring $R$. We compute the expected number of common zeros of a system of polynomials over $R$.…

We study discrete orderings in the real spectrum of a commutative ring by defining discrete prime cones and give an algebro-geometric meaning to some kind of diophantine problems over discretely ordered rings. Also for a discretely ordered…

In the paper, we study the asymptotic distribution of real algebraic integers of fixed degree as their na\"{\i}ve height tends to infinity. For an arbitrary interval $I \subset \mathbb{R}$ and sufficiently large $Q>0$, we obtain an…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers.

In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.

A class of probability distributions is characterized via equalities in law between two order statistics shifted by independent exponential variables. An explicit formula for the quintile function of the identified family of distributions…

The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…

Let $k$ be a number field and $S$ a finite set of places of $k$ containing the archimedean ones. We count the number of algebraic points of bounded height whose coordinates lie in the ring of $S$-integers of $k$. Moreover, we give an…

Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.