English
Related papers

Related papers: The covariogram determines three-dimensional conve…

200 papers

In the paper "Isoperimetry of waists and local versus global asymptotic convex geometries", it was proved that the existence of nicely bounded sections of two symmetric convex bodies K and L implies that the intersection of randomly rotated…

Functional Analysis · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

We define higher polyhedral K-groups for commutative rings, starting from the stable groups of elementary automorphisms of polyhedral algebras. Both Volodin's theory and Quillen's + construction are developed. In the special case of…

K-Theory and Homology · Mathematics 2007-05-23 Winfried Bruns , Joseph Gubeladze

We prove that the complement ${\mathcal S}:={\mathbb R}^3\setminus{\mathcal K}$ of a 3-dimensional convex polyhedron ${\mathcal K}\subset{\mathbb R}^3$ and its closure $\overline{{\mathcal S}}$ are polynomial images of ${\mathbb R}^3$. The…

Algebraic Geometry · Mathematics 2014-03-10 José F. Fernando , Carlos Ueno

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

Statistics Theory · Mathematics 2009-06-22 Bernd Sturmfels , Caroline Uhler

In spin based quantum dot arrays, material or fabrication imprecisions affect the behaviour of the device, which must be taken into account when controlling it. This requires measuring the shape of specific convex polytopes. In this work,…

Machine Learning · Computer Science 2022-10-19 Oswin Krause , Torbjørn Rasmussen , Bertram Brovang , Anasua Chatterjee , Ferdinand Kuemmeth

Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…

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

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

Let $\mathcal{P}$ and $\mathcal{P}'$ be $3$-dimensional convex polytopes in $\mathbb{R}^3$ and $S \subseteq \mathbb{R}^3$ be a non-empty intersection of an open set with a sphere. As a consequence of a somewhat more general result it is…

Metric Geometry · Mathematics 2020-09-23 Konrad Engel , Bastian Laasch

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Alexander Schwartz

Horizontal and vertical generating functions and recursion relations have been investigated by Comtet for triangular double sequences. In this paper we investigate the horizontal and vertical log-concavity of triangular sequences assigned…

Combinatorics · Mathematics 2021-02-04 Bernhard Heim , Markus Neuhauser

We give a general formula for the equivariant complex $K$-theory $K_G^*(V)$ of a finite dimensional real linear space $V$ equipped with a linear action of a compact group $G$ in terms of the representation theory of a certain double cover…

K-Theory and Homology · Mathematics 2009-03-06 Siegfried Echterhoff , Oliver Pfante

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

Computational Geometry · Computer Science 2025-08-22 Supanut Chaidee , Kokichi Sugihara

The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…

Combinatorics · Mathematics 2017-08-23 Dennis Amelunxen , Martin Lotz

We study touching cones of a (not necessarily closed) convex set in a finitedimensional real Euclidean vector space and we draw relationships to other concepts in Convex Geometry. Exposed faces correspond to normal cones by an antitone…

Metric Geometry · Mathematics 2016-05-17 Stephan Weis

The aim of this note is to investigate the properties of the convex hull and the homothetic convex hull functions of a convex body $K$ in Euclidean $n$-space, defined as the volume of the union of $K$ and one of its translates, and the…

Metric Geometry · Mathematics 2021-09-24 Ákos G. Horváth , Zsolt Lángi

This paper presents bounds for the best approximation, with respect to the Hausdorff metric, of a convex body $K$ by a circumscribed polytope $P$ with a given number of facets. These bounds are of particular interest if $K$ is elongated. To…

Metric Geometry · Mathematics 2016-12-15 Gilles Bonnet

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…

Functional Analysis · Mathematics 2026-02-27 Han Huang , Mark Rudelson

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Complex Variables · Mathematics 2019-09-11 Sushil Gorai

Assume $K$ is a convex body in $R^d$, and $X$ is a (large) finite subset of $K$. How many convex polytopes are there whose vertices come from $X$? What is the typical shape of such a polytope? How well the largest such polytope (which is…

Combinatorics · Mathematics 2007-05-23 Imre Bárány

In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…

Functional Analysis · Mathematics 2007-05-23 Charles A. Akemann , Nik Weaver