English
Related papers

Related papers: Optimal Polynomial Prediction Measures and Extrema…

200 papers

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,…

Complex Variables · Mathematics 2009-07-17 M. Shakeri , M. Bidkham , M. Eshaghi Gordji

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…

Analysis of PDEs · Mathematics 2015-05-05 Sándor Krenedits , Szilárd Gy. Révész

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…

Machine Learning · Computer Science 2020-03-10 Pritish Kamath , Omar Montasser , Nathan Srebro

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,…

Optimization and Control · Mathematics 2013-01-22 Charalambos D. Charalambous , Ioannis Tzortzis , Sergey Loyka , Themistoklis Charalambous

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…

Classical Analysis and ODEs · Mathematics 2017-08-03 Gal Binyamini

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…

Optimization and Control · Mathematics 2020-12-04 Lucas Slot , Monique Laurent

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…

Optimization and Control · Mathematics 2026-05-12 Rohan Rele , Angelia Nedich

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…

Computational Geometry · Computer Science 2019-03-19 Timothy M. Chan , Sariel Har-Peled

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$.…

Optimization and Control · Mathematics 2020-01-31 Lucas Slot , Monique Laurent

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…

Optimization and Control · Mathematics 2024-07-25 Boulos El Hilany , Elias Tsigaridas

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,…

Dynamical Systems · Mathematics 2023-08-15 Hans Oeri , David Goluskin

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…

Algebraic Topology · Mathematics 2020-11-12 Trevor Hyde

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…

Classical Analysis and ODEs · Mathematics 2016-03-25 Gökalp Alpan

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)…

Computational Complexity · Computer Science 2022-05-13 Amol Aggarwal , Josh Alman

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…

Classical Analysis and ODEs · Mathematics 2023-06-27 P. Yu. Glazyrina , Yu. S. Goryacheva , Sz. Gy. Révész

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…

Geometric Topology · Mathematics 2022-05-19 Antonin Guilloux , Julien Marché

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…

Classical Analysis and ODEs · Mathematics 2021-08-11 Brian Simanek

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…

Complex Variables · Mathematics 2022-05-03 Meredith Sargent , Alan Sola

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,…

Number Theory · Mathematics 2025-12-03 Jit Wu Yap , Tien-Cuong Dinh

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…

Classical Analysis and ODEs · Mathematics 2009-09-25 Holger Dette