English
Related papers

Related papers: Reducing the Large Set Threshold for Oertel's Conj…

200 papers

We study the problem of reconstructing a convex body using only a finite number of measurements of outer normal vectors. More precisely, we suppose that the normal vectors are measured at independent random locations uniformly distributed…

Computational Geometry · Computer Science 2014-02-21 Hiba Abdallah , Quentin Mérigot

Let $d \ge 2$, and let $K \subset {\Bbb{R}}^d$ be a convex body containing the origin $0$ in its interior. In a previous paper we have proved the following. The body $K$ is $0$-symmetric if and only if the following holds. For each $\omega…

Metric Geometry · Mathematics 2015-07-07 E. Makai , H. Martini

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Computational Complexity · Computer Science 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

Let $H_d$ denote the smallest integer $n$ such that for every convex body $K$ in $\Re^d$ there is a $0<\lambda < 1$ such that $K$ is covered by $n$ translates of $\lambda K$. In the book \emph{Research problems in discrete geometry.} by…

Metric Geometry · Mathematics 2009-01-20 Marton Naszodi

The aperture angle alpha(x, Q) of a point x not in Q in the plane with respect to a convex polygon Q is the angle of the smallest cone with apex x that contains Q. The aperture angle approximation error of a compact convex set C in the…

Computational Geometry · Computer Science 2010-08-26 Hee-Kap Ahn , Sang Won Bae , Otfried Cheong , Joachim Gudmundsson

We obtain a new upper estimate on the Euclidean diameter of the intersection of the kernel of a random matrix with iid rows with a given convex body. The proof is based on a small-ball argument rather than on concentration and thus the…

Functional Analysis · Mathematics 2013-12-13 Shahar Mendelson

We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…

Metric Geometry · Mathematics 2015-03-24 Alexander Koldobsky

The second and fourth authors have conjectured that a certain hollow tetrahedron $\Delta$ of width $2+\sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture:…

Combinatorics · Mathematics 2021-05-31 Gennadiy Averkov , Giulia Codenotti , Antonio Macchia , Francisco Santos

More than twenty-five years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for positive integers $n,k$ with $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose…

Combinatorics · Mathematics 2014-07-22 Ameera Chowdhury , Ghassan Sarkis , Shahriar Shahriari

Minkowski's Theorem asserts that every centered measure on the sphere which is not concentrated on a great subsphere is the surface area measure of some convex body, and, moreover, the surface area measure determines a convex body uniquely.…

Classical Analysis and ODEs · Mathematics 2017-04-18 Galyna V. Livshyts

We classify all tuples of lattice polyhedra of relative mixed volume 1 and all minimal (by inclusion) tuples of polyhedra of relative mixed volume 2. We also prove a conjecture by A. Esterov, which states that all tuples with finite…

Combinatorics · Mathematics 2020-11-05 Ziyi Zhang

We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain…

Geometric Topology · Mathematics 2014-03-11 Francesco Costantino , François Guéritaud , Roland van der Veen

In 1921 Blichfeldt gave an upper bound on the number of integral points contained in a convex body in terms of the volume of the body. More precisely, he showed that $#(K\cap\Z^n)\leq n! \vol(K)+n$, whenever $K\subset\R^n$ is a convex body…

Metric Geometry · Mathematics 2007-05-23 Martin Henk , Joerg M. Wills

Given a finite poset $\mathcal P$, the hypercube-height, denoted by $h^*(\mathcal P)$, is defined to be the largest $h$ such that, for any natural number $n$, the subsets of $[n]$ of size less than $h$ do not contain an induced copy of…

Combinatorics · Mathematics 2025-10-01 Tomáš Flídr , Maria-Romina Ivan , Sean Jaffe

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

We show that, for any prime power p^k and any convex body K (i.e., a compact convex set with interior) in Rd, there exists a partition of K into p^k convex sets with equal volume and equal surface area. We derive this result from a more…

Metric Geometry · Mathematics 2011-09-05 Boris Aronov , Alfredo Hubard

In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a…

Metric Geometry · Mathematics 2022-06-23 Marcelo Campos , Peter van Hintum , Robert Morris , Marius Tiba

Let A be a bounded subset of IR^d. We give an upper bound on the volume of the symmetric difference of A and f(A) where f is a translation, a rotation, or the composition of both, a rigid motion. The volume is measured by the d-dimensional…

Metric Geometry · Mathematics 2010-10-13 Daria Schymura

For each dimension $d$, $d$-dimensional integral simplices with exactly one interior integral point have bounded volume. This was first shown by Hensley. Explicit volume bounds were determined by Hensley, Lagarias and Ziegler, Pikhurko, and…

Combinatorics · Mathematics 2014-12-16 Gennadiy Averkov , Jan Krümpelmann , Benjamin Nill

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi