AbstractThe problem of determining the largest volume of a (d + 2)-point set in Ed of unit diameter is settled. The extremal polytopes are described completely
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
For a convex body $K \subset \R^n$, let $$K^z = \{y\in \R^n : \langle y-z, x-z\rangle\le 1, \mbox{\ ...
AbstractThe problem of determining the largest volume of a (d + 2)-point set in Ed of unit diameter ...
AbstractThe aim of this paper is the determination of the largest n-dimensional polytope with n+3 ve...
Abstract. In this paper we investigate the problem of finding the maximum volume polytopes, inscribe...
AbstractThe following conjecture of Fejes Tóth is proved: The density of a lattice of convex bodies ...
AbstractThe following problem is addressed: given a finite set D of points in the plane and an integ...
AbstractFor given integers d,j≥2 and any positive integers n, distributions of n points in the d-dim...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geom...
We will discuss the maximal values of the volume product $\mathcal{P}(K)=\min_{z\in {\rm int}(K)}|K|...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
For a convex body $K \subset \R^n$, let $$K^z = \{y\in \R^n : \langle y-z, x-z\rangle\le 1, \mbox{\ ...
AbstractThe problem of determining the largest volume of a (d + 2)-point set in Ed of unit diameter ...
AbstractThe aim of this paper is the determination of the largest n-dimensional polytope with n+3 ve...
Abstract. In this paper we investigate the problem of finding the maximum volume polytopes, inscribe...
AbstractThe following conjecture of Fejes Tóth is proved: The density of a lattice of convex bodies ...
AbstractThe following problem is addressed: given a finite set D of points in the plane and an integ...
AbstractFor given integers d,j≥2 and any positive integers n, distributions of n points in the d-dim...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geom...
We will discuss the maximal values of the volume product $\mathcal{P}(K)=\min_{z\in {\rm int}(K)}|K|...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
For a convex body $K \subset \R^n$, let $$K^z = \{y\in \R^n : \langle y-z, x-z\rangle\le 1, \mbox{\ ...
DOI
Add to ORKG