English
Related papers

Related papers: Optimal Lagrange Interpolation Projectors and Lege…

200 papers

We study uniform estimates for the family of fundamental Lagrange polynomials associated with any Leja sequence for the complex unit disk. The main result claims that all these polynomials are uniformly bounded on the disk, i.e.…

Complex Variables · Mathematics 2015-11-10 Amadeo Irigoyen

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

Algebraic Geometry · Mathematics 2009-06-25 Gabriela Jeronimo , Daniel Perrucci

Let a three-dimensional hyperbolic polyhedron $\mathcal P$ have finite volume $\mathrm{vol}(\mathcal P)$ and a finite number of vertices $\mathrm{ver}(\mathcal P)$. We call its normalized volume the quantity $\omega(\mathcal P) =…

Geometric Topology · Mathematics 2026-05-19 A. Egorov , A. Vesnin

The maximum of the absolute value of a real homogeneous polynomial of degree $d\ge 3$ on the unit sphere corresponds to the spectral norm of the induced real $d$-symmetric tensor $\mathcal{S}$. We give two sequences of upper bounds on the…

Functional Analysis · Mathematics 2021-04-20 Shmuel Friedland

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

Number Theory · Mathematics 2018-01-04 Anish Ghosh , Alexander Gorodnik , Amos Nevo

We study the problem of finding the Lowner-John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive…

Optimization and Control · Mathematics 2020-06-22 Areesh Mittal , Grani A. Hanasusanto

We study the volume entropy of a class of presentations (including the classical ones) for all surface groups, called \emph{minimal geometric presentations}. We rediscover a formula first obtained by Cannon and Wagreich with the computation…

Dynamical Systems · Mathematics 2014-07-08 Lluís Alsedà , David Juher , Jérôme Los , Francesc Mañosas

The Mahler volume of a centrally symmetric convex body K is defined as M(K)= (Vol K)(Vol K^dual). Mahler conjectured that this volume is minimized when K is a cube. We introduce the bottleneck conjecture, which stipulates that a certain…

Metric Geometry · Mathematics 2014-11-11 Greg Kuperberg

The main goal of the paper is to provide a quantitative lower bound greater than $1$ for the relative projection constant $\lambda(Y, X)$, where $X$ is a subspace of $\ell_{2p}^m$ space and $Y \subset X$ is an arbitrary hyperplane. As a…

Functional Analysis · Mathematics 2017-10-02 Tomasz Kobos

We study multivariate monomial Vandermonde matrices $V_N(Z)$ with arbitrary distinct nodes $Z=\{z_1,\dots,z_s\}\subset B_2^n$ in the high-degree regime $N\ge s-1$. Introducing a projection-based geometric statistic -- the \emph{max-min…

Classical Analysis and ODEs · Mathematics 2026-01-21 Omer Friedland , Yosef Yomdin

Let $K$ be an algebraically closed field of characteristic zero and ${P_n=K[x_1,\ldots,x_n]}$ the polynomial ring. Any $K$-derivation $D$ on $P_n$ is of the form ${ D=\sum_{i=1}^n f_i(x_1,\ldots,x_n)\frac{\partial}{\partial x_i} },$ where…

Rings and Algebras · Mathematics 2026-02-24 Y. Chapovskyi , A. Petravchuk

We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…

Combinatorics · Mathematics 2018-05-15 Iskander Aliev , Martin Henk , Timm Oertel

It is proved that the simplex is a strict local minimum for the volume product, P(K)=min(vol(K) vol(K^z)), K^z is the polar body of K with respect to z, the minimum is taken over z in the interior of K, in the Banach-Mazur space of…

Metric Geometry · Mathematics 2014-01-14 Jaegil Kim , Shlomo Reisner

Let $S$ be a compact infinite set in the complex plane with $0\notin{S}$, and let $R_n$ be the minimal residual polynomial on $S$, i.e., the minimal polynomial of degree at most $n$ on $S$ with respect to the supremum norm provided that…

Complex Variables · Mathematics 2013-06-26 Klaus Schiefermayr

We study the space of orthogonally additive $n$-homogeneous polynomials on $C(K)$. There are two natural norms on this space. First, there is the usual supremum norm of uniform convergence on the closed unit ball. As every orthogonally…

Functional Analysis · Mathematics 2018-07-10 Christopher Boyd , Raymond A. Ryan , Nina Snigireva

In this note we prove mean convergence of Lagrange interpolation at the zeros of para-orthogonal polynomials for measures in the unit circle which does not belong to Szeg\H{o}'s class in the unit circle. When the measure is in Szeg\H{o}'s…

Classical Analysis and ODEs · Mathematics 2022-11-11 Glenier Bello , Manuel Bello-Hernández

We consider the problem of approximating a semialgebraic set with a sublevel-set of a polynomial function. In this setting, it is standard to seek a minimum volume outer approximation and/or maximum volume inner approximation. As there is…

Optimization and Control · Mathematics 2022-05-30 James Guthrie

Let $n \geq 2$ be an integer such that an equiangular set of vectors $w_1, \ldots, w_d$ of the maximal possible cardinality (in relation to the the general Gerzon upper bound) exists in $\mathbb{K}^n$, where $\mathbb{K}=\mathbb{R}$ or…

Functional Analysis · Mathematics 2025-06-02 Tomasz Kobos

The longstanding Godbersen's conjecture states that for any convex body $K \subset \mathbb R^n$ of volume $1$ and any $j \in \{0, \ldots, n\}$, the mixed volume $V_j = V(K[j], -K[n - j])$ is bounded by $\binom{n}{j}$, with equality if and…

Metric Geometry · Mathematics 2024-12-10 Shiri Artstein-Avidan , Eli Putterman

We study the integer minimization of a quasiconvex polynomial with quasiconvex polynomial constraints. We propose a new algorithm that is an improvement upon the best known algorithm due to Heinz (Journal of Complexity, 2005). This…

Optimization and Control · Mathematics 2017-01-06 Robert Hildebrand , Matthias Köppe