English
Related papers

Related papers: A Geometric Lower Bound Theorem

200 papers

We associate convex bodies to a wide class of graded G-algebras where G is a connected reductive group. These convex bodies give information about the Hilbert function as well as multiplicities of irreducible representations appearing in…

Algebraic Geometry · Mathematics 2012-03-30 Kiumars Kaveh , Askold G. Khovanskii

Recently, Bo'az Klartag showed that arbitrary convex bodies have Gaussian marginals in most directions. We show that Klartag's quantitative estimates may be improved for many uniformly convex bodies. These include uniformly convex bodies…

Functional Analysis · Mathematics 2008-04-05 Emanuel Milman

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Metric Geometry · Mathematics 2022-07-12 Han Huang , Boaz A. Slomka , Tomasz Tkocz , Beatrice-Helen Vritsiou

We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the…

Metric Geometry · Mathematics 2021-11-03 Grigory Ivanov , Márton Naszódi

We consider unimodality and related properties of f-vectors of polytopes in various dimensions. By a result of Kalai (1988), f-vectors of 5-polytopes are unimodal. In higher dimensions much less can be said; we give an overview on current…

Combinatorics · Mathematics 2007-05-23 Axel Werner

We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…

Metric Geometry · Mathematics 2020-03-02 Florian Besau , Steven Hoehner , Gil Kur

The convex body isoperimetric conjecture in the plane asserts that the least perimeter to enclose given area inside a unit disk is greater than inside any other convex set of area $\pi$. In this note we confirm two cases of the conjecture:…

Differential Geometry · Mathematics 2021-04-13 Bo-Hshiung Wang , Ye-Kai Wang

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , G"unter M. Ziegler

We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…

Metric Geometry · Mathematics 2013-12-23 David Alonso-Gutiérrez , Bernardo González , Carlos Hugo Jiménez

We present a spherical version of the theorem of Blaschke that every body of constant width $w < \frac{\pi}{2}$ can be approximated as well as we wish in the sense of the Hausdorff distance by a body of constant width $w$ whose boundary…

Metric Geometry · Mathematics 2021-06-17 Marek Lassak

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Functional Analysis · Mathematics 2022-06-22 Daniel J. Fresen

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…

Geometric Topology · Mathematics 2022-09-08 Jean Raimbault

We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…

Computational Geometry · Computer Science 2025-05-27 Jiaqi Zheng , Tiow-Seng Tan

The Gilbert-Johnson-Keerthi (GJK) algorithm is an iterative improvement technique for finding the minimum distance between two convex objects. It can easily be extended to work with concave objects and return the pair of closest points. [4]…

Computational Geometry · Computer Science 2015-06-01 Jeff Linahan

A minimal geodesic on a Riemannian manifold is a geodesic defined on $\mathbb{R}$ that lifts to a globally distance minimizing curve on the universal covering. Bangert proved that there is a lower bound for the number of geometrically…

Differential Geometry · Mathematics 2024-04-12 Bernd Ammann , Clara Loeh

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…

Metric Geometry · Mathematics 2007-05-23 Ezra Miller , Igor Pak

The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…

Metric Geometry · Mathematics 2017-08-29 Alexander Koldobsky , Christos Saroglou , Artem Zvavitch

We prove that if for relative equilibrium solutions of a generalisation of quasi-homogeneous $n$-body problems the masses and rotation are given, then the minimum distance between the point masses of such a relative equilibrium has a…

Dynamical Systems · Mathematics 2015-06-24 Pieter Tibboel

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, are conjectured for these…

Combinatorics · Mathematics 2009-04-24 Eran Nevo

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes
‹ Prev 1 3 4 5 6 7 10 Next ›