English
Related papers

Related papers: Low $M^*$-estimates on coordinate subspaces

200 papers

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…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , David M. Mount

We estimate some mixed $L^{p}\left( L^{2}\right) $ norms of the discrepancy between the volume and the number of integer points in $r\Omega-x$, a dilated by a factor $r$ and translated by a vector $x$ of a convex body $\Omega$ in…

Number Theory · Mathematics 2019-04-08 Leonardo Colzani , Bianca Gariboldi , Giacomo Gigante

For any nonempty, compact and fiberwise convex set $K$ in $T^*\mathbb{R}^n$, we prove an isomorphism between symplectic homology of $K$ and a certain relative homology of loop spaces of $\mathbb{R}^n$. We also prove a formula which computes…

Symplectic Geometry · Mathematics 2021-06-15 Kei Irie

In this paper we study various Rogers-Shephard type inequalities for the lattice point enumerator $\mathrm{G}_{n}(\cdot)$ on $\mathbb{R}^n$. In particular, for any non-empty convex bounded sets $K,L\subset\mathbb{R}^n$, we show that…

Metric Geometry · Mathematics 2022-03-01 David Alonso-Gutiérrez , Eduardo Lucas , Jesús Yepes Nicolás

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

Computational Geometry · Computer Science 2018-01-11 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Our main result states that the hyperspace of convex compact subsets of a compact convex subset $X$ in a locally convex space is an absolute retract if and only if $X$ is an absolute retract of weight $\le\omega_1$. It is also proved that…

General Topology · Mathematics 2009-11-05 Lidia Bazylevych , Dušan Repovš , Michael Zarichnyi

This paper follows the generalisation of the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$ established by W. M. Schmidt in 1967. Let $A$ and $B$ be two subspaces of $\mathbb{R}^n$ of respective dimensions $d$…

Number Theory · Mathematics 2021-06-09 Elio Joseph

The covariogram g_K(x) of a convex body K \subseteq E^d is the function which associates to each x \in E^d the volume of the intersection of K with K+x. Matheron asked whether g_K determines K, up to translations and reflections in a point.…

Metric Geometry · Mathematics 2007-05-23 Gennadiy Averkov , Gabriele Bianchi

This thesis consists of five papers about reduced spherical convex bodies and in particular spherical bodies of constant width on the $d$-dimensional sphere $S^d$. In paper I we present some facts describing the shape of reduced bodies of…

Metric Geometry · Mathematics 2024-09-12 Michał Musielak

We show that a constant factor approximation of the shortest and closest lattice vector problem in any norm can be computed in time $2^{0.802\, n}$. This contrasts the corresponding $2^n$ time, (gap)-SETH based lower bounds for these…

Data Structures and Algorithms · Computer Science 2021-10-07 Thomas Rothvoss , Moritz Venzin

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

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

Metric Geometry · Mathematics 2013-10-25 Matthias Henze

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

Metric Geometry · Mathematics 2025-10-28 Steven Hoehner , Carsten Schütt , Elisabeth Werner

Given a convex body C in R^d containing the origin in its interior and a real number tau > 1 we seek to construct a polytope P in C with as few vertices as possible such that C in tau P. Our construction is nearly optimal for a wide range…

Metric Geometry · Mathematics 2012-07-09 Alexander Barvinok

In this article we show the following result: if $C$ is an $n$-dimensional convex and compact subset, $f:C\rightarrow[0,\infty)$ is concave, and $\phi:[0,\infty)\rightarrow[0,\infty)$ is a convex function with $\phi(0)=0$, we then…

Functional Analysis · Mathematics 2021-01-29 Bernardo González Merino

We consider the problem of finding a small hitting set in an {\it infinite} range space $\cF=(Q,\cR)$ of bounded VC-dimension. We show that, under reasonably general assumptions, the infinite dimensional convex relaxation can be solved…

Computational Geometry · Computer Science 2017-02-14 Khaled Elbassioni

This note is motivated by the article of Bamerni, Kadets and Kili\c{c}man [J. Math. Anal. Appl. 435 (2), 1812--1815 (2016)]. We consider the remaining problem which claims that if $A$ is a dense subset of a finite dimensional space $X$,…

Functional Analysis · Mathematics 2024-05-01 Salah Herzi , Habib Marzougui

In this paper we prove that if $f$ is a self-mapping of a nonempty subset $K$ of a normed space $X$ that satisfies some mild conditions, then the minimal displacement of large iterations $f^n$ always dominates that of $f$ along certain…

Functional Analysis · Mathematics 2021-11-05 Cleon S. Barroso

It is proved that for a symmetric convex body K in R^n, if for some tau > 0, |K cap (x+tau K)| depends on ||x||_K only, then K is an ellipsoid. As a part of the proof, smoothness properties of convolution bodies ls are studied.

Functional Analysis · Mathematics 2016-09-06 Mathieu Meyer , Shlomo Reisner , M. Schmuckenschlager

Given a strictly convex multiobjective optimization problem with objective functions $f_1,\dots,f_N$, let us denote by $x_0$ its solution, obtained as minimum point of the linear scalarized problem, where the objective function is the…

Optimization and Control · Mathematics 2023-03-06 Carlo Alberto De Bernardi , Enrico Miglierina , Elena Molho , Jacopo Somaglia