Related papers: Estimating heights using auxiliary functions
New upper bounds on the pointwise behaviour of Christoffel function on convex domains in ${\mathbb{R}}^d$ are obtained. These estimates are established by explicitly constructing the corresponding "needle"-like algebraic polynomials having…
We consider Guth's approach to the Fourier restriction problem via polynomial partitioning. By writing out his induction argument as a recursive algorithm and introducing new geometric information, known as the polynomial Wolff axioms, we…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required…
We generalize the known constructions of A-hypergeometric functions. In particular, we show that periods of middle dimension on affine or projective complex algebraic varieties are A-hypergeometric functions of coefficients of polynomial…
It is well-known that every convex function admits an affine support at every interior point of a domain. Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
In this paper, we derive new bounds for the zeros of quaternionic polynomials by applying localization theorems, which includes Gershgorin-type theorems for the left eigenvalues of matrices of left monic quaternionic polynomials. These…
We describe an algorithmic method to determine the image of restriction maps for Siegel modular forms with \textit{arbitrary} characters and arbitrary weight. A program has been implemented in the mathematical software \texttt{Java} to…
Complex signed measures of finite total variation are a powerful signal model in many applications. Restricting to the $d$-dimensional torus, finitely supported measures allow for exact recovery if the trigonometric moments up to some order…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…
Let $k$ be a number field and $K$ a finite extension of $k$. We count points of bounded height in projective space over the field $K$ generating the extension $K/k$. As the height gets large we derive asymptotic estimates with a…
Let $P$ and $Q$ be polynomials in one variable over an algebraically closed field $k$ of characteristic zero. Let $f$ and $g$ be elements of a function field $\K$ over $k$ such that $P(f)=Q(g).$ We give conditions on $P$ and $Q$ such that…
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…
We prove a sharp upper bound for the projective dimension of ideals of height two generated by quadrics in a polynomial ring with arbitrary large number of variables.
Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…