Related papers: Counting bounded elements of a number field

We give a proposal for future development of the model theory of valued fields. We also summarize some recent results on p-adic numbers.

We look for a deep connection between mathematics and physics. Our approach is to propose a set theory T which leads to a concise mathematical description of physical fields and to a finite unit of action. The concept of "definability" of…

Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…

We give a numerical characterization of the possible extremal Betti numbers (values as well as positions) of any homogeneous ideal in a polynomial ring over a field.

We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.

We estimate the number of principal ideals $ I $ of norm $ \mathrm{N}(I) \leq x $ in the family of the simplest cubic fields. The advantage of our result is that it provides the correct order of magnitude for arbitrary $ x \geq 1 $, even…

This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…

Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…

Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…

In this paper, we prove a general result computing the number of rational points of bounded height on a projective variety $V$ which is covered by lines. The main technical result used to achieve this is an upper bound on the number of…

We give upper and lower bounds on the number of points on abelian varieties over finite fields, and lower bounds specific to Jacobian varieties. We also determine exact formulas for the maximum and minimum number of points on Jacobian…

An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…

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.

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…