Related papers: Estimating heights using auxiliary functions

Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins,…

The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.

We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev's summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gr\"obner basis algorithms.

Let $K/\mathbb{Q}$ be an algebraic extension of fields, and let $\alpha \not= 0$ be contained in an algebraic closure of $K$. If $\alpha$ can be approximated by roots of numbers in $K^{\times}$ with respect to the Weil height, we prove that…

In this article we obtain lower and upper bounds for global dimensions of a class of artinian algebras in terms of global dimensions of a finite subset of their artinian subalgebras. Finding these bounds for the global dimension of an…

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…

Given a toric metrized R-divisor on a toric variety over a global field, we give a formula for the essential minimum of the associated height function. Under suitable positivity conditions, we also give formulae for all the successive…

Let $n\in\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\mathcal{P}_n(Q)$ denote the set of polynomials over $\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding…

We consider drawings of graphs in the plane in which vertices are assigned distinct points in the plane and edges are drawn as simple curves connecting the vertices and such that the edges intersect only at their common endpoints. There is…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…

Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…

This survey provides an exposition of a suite of techniques based on the theory of polynomials, collectively referred to as polynomial methods, which have recently been applied to address several challenging problems in statistical…

The height probabilities for the recurrent configurations in the Abelian Sandpile Model on the square lattice have analytic expressions, in terms of multidimensional quadratures. At first, these quantities have been evaluated numerically…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

Let $k$ be a number field, let $\theta$ be a nonzero algebraic number, and let $H(\cdot)$ be the Weil height on the algebraic numbers. In response to a question by T. Loher and D. W. Masser, we prove an asymptotic formula for the number of…

Recently, R\'emond stated a very general conjecture on lower bounds of a normalized height on either an abelian variety or a power of the multiplicative group. In this note, we extend a particular case of this conjecture to split…