中文
相关论文

相关论文: Approximating a norm by a polynomial

200 篇论文

This paper presents various worst-case results on the positive semidefinite (psd) rank of a nonnegative matrix, primarily in the context of polytopes. We prove that the psd rank of a generic n-dimensional polytope with v vertices is at…

最优化与控制 · 数学 2014-06-03 João Gouveia , Richard Z. Robinson , Rekha R. Thomas

Our main result states that whenever we have a non-Euclidean norm $\|\cdot\|$ on a two-dimensional vector space $X$, there exists some $x\neq 0$ such that for every $\lambda\neq 1, \lambda>0$, there exist $y, z\in X$ verifying that…

度量几何 · 数学 2024-02-09 Javier Cabello Sánchez , Adrián Gordillo-Merino

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…

计算几何 · 计算机科学 2009-09-29 Jiri Matousek , Anastasios Sidiropoulos

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

数据结构与算法 · 计算机科学 2017-04-25 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

计算几何 · 计算机科学 2026-01-26 Sunil Arya , David M. Mount

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

最优化与控制 · 数学 2012-10-26 Tomáš Kepka , Miroslav Korbelář

Let $X\subset\mathbb{R}^n$ be a convex closed and semialgebraic set and let $f$ be a polynomial positive on $X$. We prove that there exists an exponent $N\geq 1$, such that for any $\xi\in\mathbb{R}^n$ the function…

代数几何 · 数学 2018-12-13 Krzysztof Kurdyka , Katarzyna Kuta , Stanisław Spodzieja

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

泛函分析 · 数学 2007-05-23 Stanislaw J. Szarek , Nicole Tomczak-Jaegermann

Recently classes of conic and discrete conic functions were introduced. In this paper we use the term convic instead conic. The class of convic functions properly includes the classes of convex functions, strictly quasiconvex functions and…

最优化与控制 · 数学 2020-11-03 S. I. Veselov , D. V. Gribanov , N. Yu. Zolotykh , A. Yu. Chirkov

With every real polynomial $f$, we associate a family $\{f_{\epsilon r}\}_{\epsilon, r}$ of real polynomials, in explicit form in terms of $f$ and the parameters $\epsilon>0,r\in N$, and such that $\Vert f-f_{\epsilon r}\Vert_1\to 0$ as…

代数几何 · 数学 2007-05-23 Jean B. Lasserre

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

计算复杂性 · 计算机科学 2018-01-16 Alexander A. Sherstov

For a collection of convex bodies $P_1,\dots,P_n \subset \mathbb{R}^d$ containing the origin, a Minkowski complex is given by those subsets whose Minkowski sum does not contain a fixed basepoint. Every simplicial complex can be realized as…

组合数学 · 数学 2018-03-16 Florian Frick , Raman Sanyal

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

复变函数 · 数学 2015-08-28 Gautam Bharali

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

度量几何 · 数学 2007-08-21 Ronen Eldan , Bo'az Klartag

A classical theorem of Alon and Milman states that any $d$ dimensional centrally symmetric convex body has a projection of dimension $m\geq e^{c\sqrt{\ln{d}}}$ which is either close to the $m$-dimensional Euclidean ball or to the…

度量几何 · 数学 2018-05-08 Marton Naszodi

The Nontrivial Projection Problem asks whether every finite-dimensional normed space of dimension greater than one admits a well-bounded projection of non-trivial rank and corank or, equivalently, whether every centrally symmetric convex…

泛函分析 · 数学 2010-09-14 Stanislaw J. Szarek , Nicole Tomczak-Jaegermann

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

组合数学 · 数学 2011-07-07 Martin Tancer

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

代数几何 · 数学 2019-03-19 Nathália Moraes de Oliveira , Enric Nart

For a nonempty compact set D of R we determine the maximal possible dimension of a subspace X of polynomial functions of degree at most m which possesses a positive bases (where positivity is understood on D). The exact value of this…

经典分析与常微分方程 · 数学 2007-08-22 Bálint Farkas , Szilárd Gy. Révész

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

度量几何 · 数学 2017-03-30 Marek Lassak