AbstractWe Count the number of solutions with height less than or equal to B to a system of linear equations over a number field. We give explicit asymptotic estimates for the number of such solutions as B goes to infinity, where the constants involved depend on the classical invariants of the number field (degree, discriminant, class number. etc.). The problem is reformulated as an estimate for the number of lattice points in a certain bounded domain
We define a computable function f from positive integers to positive integers. We formulate a hypoth...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
Let k be a number field and S a finite set of places of k containing the archimedean ones. We count ...
AbstractWe Count the number of solutions with height less than or equal to B to a system of linear e...
We consider systems of polynomial equations and inequalities to be solved in integers. By applying t...
AbstractWe count points of fixed degree and bounded height on a linear projective variety defined ov...
AbstractIn this paper, we give a reduction theorem for the number of solutions of any diagonal equat...
Abstract. We count algebraic numbers of fixed degree over a fixed algebraic number field. When the h...
We count points of fixed degree and bounded height on a linear projective variety defined over a num...
AbstractThe largest possible number of representations of an integer in thek-fold sumsetkA=A+…+Ais m...
An important problem in analytic and geometric combinatorics is estimating the number of lattice poi...
Let k be a number field. For H→∞ , we give an asymptotic formula for the number of algebraic integer...
We make a start on the investigation of “small” solutions to systems of homogeneous linear equations...
Let k be a number field. For H→∞, we give an asymptotic formula for the number of algebraic integers...
AbstractWe make a start on the investigation of “small” solutions to systems of homogeneous linear e...
We define a computable function f from positive integers to positive integers. We formulate a hypoth...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
Let k be a number field and S a finite set of places of k containing the archimedean ones. We count ...
AbstractWe Count the number of solutions with height less than or equal to B to a system of linear e...
We consider systems of polynomial equations and inequalities to be solved in integers. By applying t...
AbstractWe count points of fixed degree and bounded height on a linear projective variety defined ov...
AbstractIn this paper, we give a reduction theorem for the number of solutions of any diagonal equat...
Abstract. We count algebraic numbers of fixed degree over a fixed algebraic number field. When the h...
We count points of fixed degree and bounded height on a linear projective variety defined over a num...
AbstractThe largest possible number of representations of an integer in thek-fold sumsetkA=A+…+Ais m...
An important problem in analytic and geometric combinatorics is estimating the number of lattice poi...
Let k be a number field. For H→∞ , we give an asymptotic formula for the number of algebraic integer...
We make a start on the investigation of “small” solutions to systems of homogeneous linear equations...
Let k be a number field. For H→∞, we give an asymptotic formula for the number of algebraic integers...
AbstractWe make a start on the investigation of “small” solutions to systems of homogeneous linear e...
We define a computable function f from positive integers to positive integers. We formulate a hypoth...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
Let k be a number field and S a finite set of places of k containing the archimedean ones. We count ...