Related papers: Covering functionals of convex polytopes with few …
We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric…
We prove that the number of vertices of a polytope of a particular kind is exponentially large in the dimension of the polytope. As a corollary, we prove that an n-dimensional centrally symmetric polytope with O(n) facets has 2^{Omega(n)}…
We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that…
We resolve a conjecture of Kalai relating approximation theory of convex bodies by simplicial polytopes to the face numbers and primitive Betti numbers of these polytopes and their toric varieties. The proof uses higher notions of…
Results on the upper and lower semicontinuity of functionals defined on spaces of convex and more general functions are established. In particular, the following result is obtained. Let $\phi(v; \cdot)$ be the density of the absolutely…
Entropy functionals (i.e. convex integral functionals) and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Dual equalities and…
All the work made so far on edge-covering a graph by cliques focus on finding the minimum number of cliques that cover the graph. On this paper, we fix the number of cliques that cover a graph by the same number of vertices that the graph…
It is known that Shintani zeta functions, which generalise multiple zeta functions, extend to meromorphic functions with poles on affine hyperplanes. We refine this result in showing that the poles lie on hyperplanes parallel to the facets…
A classification of SL$(n)$ invariant valuations on the space of convex polytopes in $R^n$ without any continuity assumptions is established. A corresponding result is obtained on the space of convex polytopes in $R^n$ that contain the…
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…
We study the class of real-valued functions on convex subsets of R^n which are computed by the maximum of finitely many affine functionals with integer slopes. We prove several results to the effect that this property of a function can be…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
This paper generalizes the first author's preceding works concerning admissible functions on certain Fano manifolds. Here, we study a larger class of functions which can be less symmetric than the ones studied before. When the sup of these…
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,…
In a locally finite tiling of n-dim Euclidean space by convex polytopes, each point of the space is either a vertex of at least two tiles, or no vertex at all.
We determine upper and lower bounds for the minimal number of balls of a given radius needed to cover the space of schlicht functions.
New sharp affine isoperimetric inequalities for volume decomposition functionals $X_{2}$ and $X_{3}$ in $\mathbb{R}^n$ are established. To fulfil this task, we prove the recursion formulas for volume decomposition functionals and find out…
We classify the d-dimensional simplicial, terminal, and reflexive polytopes with at least 3d-2 vertices. In particular, it turns out that these are all smooth Fano polytopes. This improves on previous results of Casagrande in 2006 and Oebro…