English
Related papers

Related papers: Best approximation of functions by log-polynomials

200 papers

It was recently shown in [4] that, for $L_2$-approximation of functions from a Hilbert space, function values are almost as powerful as arbitrary linear information, if the approximation numbers are square-summable. That is, we showed that…

Numerical Analysis · Mathematics 2023-05-15 Mario Ullrich

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

Combinatorics · Mathematics 2018-04-05 David Handelman

We introduce the notion of G-hypergeometric function, where G is a complex Lie group. In the case when G is a complex torus, this notion amounts to the notion of Gelfand's A-hypergeometric function. We show that the integral $\int…

Algebraic Geometry · Mathematics 2011-03-22 A. Stoyanovsky

Lorentzian polynomials are a fascinating class of real polynomials with many applications. Their definition is specific to the nonnegative orthant. Following recent work, we examine Lorentzian polynomials on proper convex cones. For a…

Algebraic Geometry · Mathematics 2024-05-22 Grigoriy Blekherman , Papri Dey

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

Number Theory · Mathematics 2017-03-10 Shuntaro Yamagishi

According to a 2002 theorem by Cardaliaguet and Tahraoui, an isotropic, compact and connected subset of the group $\operatorname{GL}^+(2)$ of invertible $2\times2-\,$matrices is rank-one convex if and only if it is polyconvex. In a 2005…

Analysis of PDEs · Mathematics 2020-09-22 Jendrik Voss , Ionel-Dumitrel Ghiba , Robert J. Martin , Patrizio Neff

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Commutative Algebra · Mathematics 2020-03-03 Tigran Ananyan , Melvin Hochster

We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…

Combinatorics · Mathematics 2018-11-06 Nima Anari , Kuikui Liu , Shayan Oveis Gharan , Cynthia Vinzant

We present the first formulation of the optimal polynomial approximation of the solution of linear non-autonomous systems of ODEs in the framework of the so-called $\star$-product. This product is the basis of new approaches for the…

Classical Analysis and ODEs · Mathematics 2024-06-14 Stefano Pozza

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Metric Geometry · Mathematics 2017-07-07 Julian Grote , Elisabeth M. Werner

We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we…

Optimization and Control · Mathematics 2025-03-25 Namrata Kundu , Yves Lucet

Let $G$ be a group and let $K$ be a commensurated subgroup of $G$. Then there is a totally disconnected, locally compact (t.d.l.c.) group $\hat{G}_K$ that contains the profinite completion of $K$ as an open compact subgroup and also…

Group Theory · Mathematics 2015-09-03 Colin D. Reid

For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…

Functional Analysis · Mathematics 2023-07-11 Christopher Felder

It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…

Classical Analysis and ODEs · Mathematics 2019-01-15 K. A. Kopotun , D. Leviatan , I. A. Shevchuk

For a closed connected surface with a metric g, we consider the regularized trace of the inverse of the Laplace-Beltrami operator. We minimize this on the class of smooth metrics conformal to g having the same area, and show that the…

Spectral Theory · Mathematics 2007-11-21 Kate Okikiolu

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

Optimization and Control · Mathematics 2023-01-24 Ngoc Hoang Anh Mai

We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…

Functional Analysis · Mathematics 2017-10-31 L Baratchart , Juliette Leblond , Fabien Seyfert

For an integral convex polytope $\mathcal{P} \subset \mathbb{R}^d$, we recall $L_\mathcal{P}(n)=|n\mathcal{P} \cap \mathbb{Z}^d|$ the Ehrhart polynomial of $\mathcal{P}$. Let $g_r(\mathcal{P})$ be the $r$th coefficients of…

Combinatorics · Mathematics 2020-09-08 Akiyoshi Tsuchiya

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

Number Theory · Mathematics 2025-09-10 Kiseok Yeon

A seminal result of Nisan and Szegedy (STOC, 1992) shows that for any total Boolean function, the degree of the real polynomial that computes the function, and the minimal degree of a real polynomial that point-wise approximates the…

Computational Complexity · Computer Science 2025-07-21 Arkadev Chattopadhyay , Yogesh Dahiya , Shachar Lovett