English
Related papers

Related papers: Optimal polynomial meshes exist on any multivariat…

200 papers

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov

An eigenvalue problem arising in optimal insulation related to the minimization of the heat decay rate of an insulated body is adapted to enforce a positive lower bound imposed on the distribution of insulating material. We prove the…

Numerical Analysis · Mathematics 2024-10-22 Sören Bartels , Giuseppe Buttazzo , Hedwig Keller

It is proved that a convex hypersurface in a Riemannian manifold of sectional curvature at least k is an Alexandrov's space of curvature at least k. This theorem provides an optimal lower curvature bound for an older theorem of Buyalo.

Differential Geometry · Mathematics 2013-03-26 Stephanie Alexander , Vitali Kapovitch , Anton Petrunin

We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…

Combinatorics · Mathematics 2026-05-12 Katarina Krivokuća

By the celebrated Weierstrass Theorem the set of algebraic polynomials is dense in the space of continuous functions on a compact set in R^d. In this paper we study the following question: does the density hold if we approximate only by…

Classical Analysis and ODEs · Mathematics 2007-05-23 David Benko , Andras Kroo

We prove analogs of results of Cox/Schenck on the structure of certain ideals in the bigraded polynomial ring k[s,u;t,v].

Algebraic Geometry · Mathematics 2007-05-23 J. William Hoffman , Hao Hao Wang

We prove existence and uniqueness of optimal maps on $RCD^*(K,N)$ spaces under the assumption that the starting measure is absolutely continuous. We also discuss how this result naturally leads to the notion of exponentiation.

Differential Geometry · Mathematics 2013-05-22 Nicola Gigli , Tapio Rajala , Karl-Theodor Sturm

Polynomial spaces associated to a convex body $C$ in $({\bf R}^+)^d$ have been the object of recent studies. In this work, we consider polynomial spaces associated to non-convex $C$. We develop some basic pluripotential theory including…

Complex Variables · Mathematics 2021-04-09 N. Levenberg , F. Wielonsky

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

A number of results related to statistical classification on convex sets are presented. In particular, the focus is on the case where some of the covariates in the data and observation being classified can be missing. The form of the…

Statistics Theory · Mathematics 2018-05-02 Levon Demirdjian , Majid Mojirsheibani

In this work we discuss a conjecture of Viterbo relating the symplectic capacity of a convex body and its volume. The conjecture states that among all 2n-dimensional convex bodies with a given volume the euclidean ball has maximal…

Symplectic Geometry · Mathematics 2007-05-23 Shiri Artstein-Avidan , Yaron Ostrover

Let $P$ be a set of $n$ points in $\mathbb{R}^2$. For a given positive integer $w<n$, our objective is to find a set $C \subset P$ of points, such that $CH(P\setminus C)$ has the smallest number of vertices and $C$ has at most $n-w$ points.…

Computational Geometry · Computer Science 2021-03-03 Vahideh Keikha

Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…

Optimization and Control · Mathematics 2010-06-28 Philipp Rostalski , Bernd Sturmfels

In 1975 Wegner conjectured that the nerve of every finite good cover in R^d is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R^d such that the intersection of every subcollection is either empty or…

Combinatorics · Mathematics 2010-08-12 Martin Tancer

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

Complex Variables · Mathematics 2024-03-22 Marko Slapar

In 1959, Klee proved that a convex body $K$ is a polyhedron if and only if all of its projections are polygons. In this paper, a new proof of this theorem is given for convex bodies in $\mathbb{R}^3$.

Metric Geometry · Mathematics 2015-03-06 John J. Zanazzi

We prove an existence theorem for convex hypersurfaces of prescribed Gauss curvature in the complement of a compact set in Euclidean space which are close to a cone.

Differential Geometry · Mathematics 2014-01-28 Felix Finster , Oliver C. Schnuerer

We answer in the negative a question by Gruenbaum who asked if there exists a finite basis of affine invariant points. We give a positive answer to another question by Gruenbaum about the "size" of the set of all affine invariant points.…

Functional Analysis · Mathematics 2013-01-15 Mathieu Meyer , Carsten Schuett , Elisabeth M. Werner

We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the…

Algebraic Geometry · Mathematics 2008-07-09 Jean B. Lasserre

We consider the optimal containment of polygonal regions within convex containers with the special property of 'orientedness' - an oriented region enables us to choose a preferred direction on the plane (this direction is not necessarily an…

General Mathematics · Mathematics 2018-09-07 R Nandakumar