Related papers: Containment and inscribed simplices

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…

We prove that for every compactum X with dim_Z X <= n >= 2 there is a cell-like resolution r: Z --> X from a compactum Z onto X such that dim Z <= n and for every integer k and every abelian group G such that dim_G X <= k >= 2 we have dim_G…

We prove that for any $n\in \mathbb{N}$ there is a convex body $K\subseteq \mathbb{R}^n$ whose surface area is at most $n^{\frac12+o(1)}$, yet the translates of $K$ by the integer lattice $\mathbb{Z}^n$ tile $\mathbb{R}^n$.

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…

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

A simplicial complex K is called d-representable if it is the nerve of a collection of convex sets in R^d; K is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at most d-1 that is contained…

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

Let $\# K$ be a number of integer lattice points contained in a set $K$. In this paper we prove that for each $d\in {\mathbb N}$ there exists a constant $C(d)$ depending on $d$ only, such that for any origin-symmetric convex body $K \subset…

We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…

We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the…

If $g$ is a map from a space $X$ into $\mathbb R^m$ and $q$ is an integer, let $B_{q,d,m}(g)$ be the set of all lines $\Pi^d\subset\mathbb R^m$ such that $|g^{-1}(\Pi^d)|\geq q$. Let also $\mathcal H(q,d,m,k)$ denote the maps $g\colon…

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…

We associate to a finite digraph $D$ a lattice polytope $P_D$ whose vertices are the rows of the Laplacian matrix of $D$. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem,…

To every convex body $K \subseteq \mathbb{R}^d$, one may associate a minimal matrix convex set $\mathcal{W}^{\textrm{min}}(K)$, and a maximal matrix convex set $\mathcal{W}^{\textrm{max}}(K)$, which have $K$ as their ground level. The main…

We prove the existence of similar and multi-similar point configurations (or simplexes) in sets of fractional Hausdorff measure in Euclidean space. These results can be viewed as variants, for thin sets, of theorems for sets of positive…

We characterize the polytopes in $\mathbb{R}^d$ (not necessarily convex or connected ones) which multi-tile the space by translations along a given lattice. We also give a necessary and sufficient condition for two polytopes in…