Related papers: Estimating heights using auxiliary functions

Let $k$ be a number field. We consider norm form equations associated to a full $O_k$-module contained in a finite extension field $l$. It is known that the set of solutions is naturally a union of disjoint equivalence classes of solutions.…

We develop a strategy for bounding from above the height of rational points of modular curves with values in number fields, by functions which are polynomial in the curve's level. Our main technical tools come from effective Arakelov…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

We define modular equations in the setting of PEL Shimura varieties as equations describing Hecke correspondences, and prove upper bounds on their degrees and heights. This extends known results about elliptic modular polynomials, and…

We complete the construction of raising and lowering operators, given in a previous work, for the orthogonal polynomials of hypergeometric type on non-homogeneous lattice, and extend these operators to the generalized orthogonal…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

We give a formula with explicit error term for the number of $K$-rational points $P$ satisfying $H(f(P)) \le X$ as $X \to \infty$, where $f$ is a nonconstant morphism between projective spaces defined over a number field $K$ and $H$ is the…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

We introduce descent methods to the study of strong approximation on algebraic varieties. We apply them to two classes of varieties defined by P(t)=N_{K/k}(z): firstly for quartic extensions of number fields K/k and quadratic polynomials…

Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…

We prove some improvements of the classical Weil bound for one variable additive and multiplicative character sums associated to a polynomial over a finite field $k=\Fq$ for two classes of polynomials which are invariant under a large…

In the paper we obtain the asymtotic number of integral quadratic polynomials with bounded heights and discriminants as the upper bound of heights tends to infinity.

In 2016, Ananyan and Hochster gave the first proof of a positive answer to Stillman's Question, which asked for a bound on the projective dimension of a graded polynomial ideal purely in terms of the number and degrees of its generators.…

To derive an eigenvalue problem for the associated Askey-Wilson polynomials, we consider an auxiliary function in two variables which is related to the associated Askey-Wilson polynomials introduced by Ismail and Rahman. The Askey-Wilson…

Let $A$ be a simple abelian variety of dimension $g$ over the field $\mathbb{F}_q$. The paper provides improvements on the Weil estimates for the size of $A(\mathbb{F}_q)$. For an arbitrary value of $q$ we prove $(\lfloor(\sqrt{q}-1)^2…

In this paper, we revisit some known results about stationary varifolds using simpler arguments. In particular, we obtain the height bound and the Lipschitz approximation along with its estimates, and as a consequence, the excess decay

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best…