Related papers: Estimating heights using auxiliary functions

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…

This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…

Let n be a positive integer. We consider the Sylvester Resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a quadratic polynomial, we find the resultant's height. If f is…

In this paper, we investigate Weil polynomials and their relationship with isogeny classes of abelian varieties over finite fields. We give a necessary condition for a degree 12 polynomial with integer coefficients to be a Weil polynomial.…

Let $k$ be a number field and $V(k)$ an $n$-dimensional projective variety over $k$. We use the $K$-theory of a $C^*$-algebra $A_V$ associated to $V(k)$ to define a height of points of $V(k)$. The corresponding counting function is…

We give a generalization of weighted Weil heights. These heights generalize both Weil's heights and Dobrowolski's height. We study Northcott numbers for our heights. Our results generalize the authors' former work on Vidaux and Videla's…

We study the use of approximate Lagrange multipliers and discrete actions in solving convex optimisation problems. We observe that descent, which can be ensured using a wide range of approaches (gradient, subgradient, Newton, etc.), is…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

Given a vector space $V$ of homogeneous polynomials of the same degree over an infinite field, consider a generic subspace $W$ of $V$. The main result of this paper is a lower-bound (in general sharp) for the dimensions of the spaces…

The problem of evaluation of higher derivatives of Airy functions in a closed form is investigated. General expressions for the polynomials which have arisen in explicit formulae for these derivatives are given in terms of particular values…

We revisit the Ou-Wang's approach to the cone restriction problem via polynomial partitioning. By recasting their inductive scheme as a recursive algorithm and incorporating the nested polynomial Wolff axioms, we obtain improved bounds for…

We consider the problem of explicitly computing Beilinson--Bloch heights of homologically trivial cycles on varieties defined over number fields. Recent results have established a congruence, up to the rational span of logarithms of primes,…

This paper aims to construct a new family of numbers and polynomials which are related to the Bell numbers and polynomials by means of the confluent hypergeometric function. We give various properties of these numbers and polynomials…

It has recently been shown that the auxiliary field method is an interesting tool to compute approximate analytical solutions of the Schr\"{o}dinger equation. This technique can generate the spectrum associated with an arbitrary potential…

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

Let g be a nonconstant rational map from the projective line to itself that has degree greater than one and is defined over a number field. The map g gives rise to generalized Mahler measures for polynomials in one variable. We use…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…