Related papers: Lower bounds for cube-ideal set-systems
In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…
We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…
A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…
Let C be a clutter and let I(C) be its edge ideal. This is a survey paper on the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regularity of R/I(C) and apply this criterion to give…
We develop a numerical method for the computation of a minimal convex and compact set, $\mathcal{B}\subset\mathbb{R}^N$, in the sense of mean width. This minimisation is constrained by the requirement that $\max_{b\in\mathcal{B}}\langle b ,…
The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…
We consider bounded integer knapsacks where the weights and variable upper bounds together form a superincreasing sequence. The elements of this superincreasing knapsack are exactly those vectors that are lexicographically smaller than the…
This paper develops a unified framework for estimating the volume of a set in $\mathbb{R}^d$ based on observations of points uniformly distributed over the set. The framework applies to all classes of sets satisfying one simple axiom: a…
We prove new quantitative bounds on the additive structure of sets obeying an $L^3$ 'control' assumption, which arises naturally in several questions within additive combinatorics. This has a number of applications - in particular we…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
In this paper we consider a general problem set-up for a wide class of convex and robust distributed optimization problems in peer-to-peer networks. In this set-up convex constraint sets are distributed to the network processors who have to…
Any planar shape $P\subset \mathbb{C}$ can be embedded isometrically as part of the boundary surface $S$ of a convex subset of $\mathbb{R}^3$ such that $\partial P$ supports the positive curvature of $S$. The complement $Q = S \setminus P$…
A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…
Both the combinatorial and the circuit diameters of polyhedra are of interest to the theory of linear programming for their intimate connection to a best-case performance of linear programming algorithms. We study the diameters of dual…
In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…
We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…
Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…
Motivated by using combinatorics to study jets of monomial ideals, we extend a definition of jets from graphs to clutters. We offer some structural results on their vertex covers, and show an interesting connection between the cover ideal…