Related papers: Optimal Polynomial Prediction Measures and Extrema…
In this paper we obtain new results concerning maximum modulus of the polar derivative of a polynomial with restricted zeros. Our results generalize and refine upon the results of Aziz and Shah [An integral mean estimate for polynomial,…
The century old extremal problem, solved by Carath\'eodory and Fej\'er, concerns a nonnegative trigonometric polynomial normalized by a0 = 1, and the quantity to be maximized is the coefficient a1. In the complex exponential form, the…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
The aim of this paper is to investigate extremum problems with pay-off being the total variational distance metric defined on the space of probability measures, subject to linear functional constraints on the space of probability measures,…
Consider a polynomial vector field $\xi$ in $\mathbb{C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of…
We consider a hierarchy of upper approximations for the minimization of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$ proposed recently by Lasserre (arXiv:1907.097784, 2019). This hierarchy relies on using the push-forward…
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
We consider the problem of computing the minimum value $f_{\min,K}$ of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$, which can be reformulated as finding a probability measure $\nu$ on $K$ minimizing $\int_K f d\nu$.…
We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
We compute the compactly supported Euler characteristic of the space of degree $d$ irreducible polynomials in $n$ variables with real coefficients and show that the values are given by the digits in the so-called balanced binary expansion…
Let $K$ be a non-polar compact subset of $\mathbb{R}$ and $\mu_K$ denote the equilibrium measure of $K$. Furthermore, let $P_n\left(\cdot, \mu_K\right)$ be the $n$-th monic orthogonal polynomial for $\mu_K$. It is shown that…
For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…
In 1939 Tur\'{a}n raised the question about lower estimations of the maximum norm of the derivatives of a polynomial $p$ of maximum norm $1$ on the compact set $K$ of the complex plain under the normalization condition that the zeroes of…
We study a class of 2-variable polynomials called exact polynomials which contains $A$-polynomials of knot complements. The Mahler measure of these polynomials can be computed in terms of a volume function defined on the vanishing set of…
Let G be a bounded region with simply connected closure and having analytic boundary and let mu be a positive measure carried by the closure of G together with finitely many pure points outside G. We provide estimates on the norms of the…
We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…
Let $K$ be a number field, $X$ a smooth projective variety over $K$ and $f: X \to X$ a polarized endomorphism of degree $d \geq 2$. We prove an exponential lower bound on $[K(\Per_n):K]$, where $\Per_n$ is the set of $n$-periodic points,…
We consider the problem of maximizing the sum of squares of the leading coefficients of polynomials $P_{i_1}(x),\ldots ,P_{i_m}(x)$ (where $P_j(x)$ is a polynomial of degree $j$) under the restriction that the sup-norm of $\sum_{j=1}^m…