Related papers: On the multiple Borsuk numbers of sets

Given $2\le k\le n$, the minimal $(n-1)$-dimensional Gaussian measure of the union of the boundaries of $k$ disjoint sets of equal Gaussian measure in $\R^n$ whose union is $\R^n$ is of order $\sqrt{\log k}$. A similar results holds also…

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…

A subset $S$ of $\mathbb R^d$ has the Borsuk property if it can be decomposed into at most $d+1$ parts of diameter smaller than $S$. This is an important geometric property, inspired by a conjecture of Borsuk from the 1930s, which has…

A map from a manifold to a Euclidean space is said to be k-regular if the image of any distinct k points are linearly in- dependent. For k-regular maps on manifolds, lower bounds of the dimension of the ambient Euclidean space have been…

Our aim in this note is to show that, for any $\epsilon>0$, there exists a union-closed family $\mathcal F$ with (unique) smallest set $S$ such that no element of $S$ belongs to more than a fraction $\epsilon$ of the sets in $\mathcal F$.…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

The midpoint set M(S) of a set S of points is the set of all midpoints of pairs of points in S. We study the largest cardinality of a midpoint set M(S) in a finite-dimensional normed space, such that M(S) is contained in the unit sphere,…

The dimension of a graph $G$ is the smallest $d$ for which its vertices can be embedded in $d$-dimensional Euclidean space in the sense that the distances between endpoints of edges equal $1$ (but there may be other unit distances).…

The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…

The width of a closed convex subset of Euclidean space is the distance between two parallel supporting planes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still…

This paper investigates a real-valued topological invariant of 3-manifolds called topological volume. For a given 3-manifold M it is defined as the smallest volume of the complement of a (possibly empty) hyperbolic link in M. Various…

We give the sharp lower bound of the volume product of $n$-dimensional convex bodies which are invariant under a discrete subgroup $SO(K)=\{ g \in SO(n); g(K)=K \}$, where $K$ is an $n$-cube or $n$-simplex. This provides new partial results…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

The boxicity of a graph $G$ is the minimum non-negative integer $k$ such that $G$ can be isomorphic to the intersection graph of a family of boxes in Euclidean $k$-space, where a box in Euclidean $k$-space is the Cartesian product of $k$…

In 1933, Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? This problem has been studied by many authors, and a lot of partial results have been discovered. In…

Given a set of $n$ points in $d$ dimensions, the Euclidean $k$-means problem (resp. the Euclidean $k$-median problem) consists of finding $k$ centers such that the sum of squared distances (resp. sum of distances) from every point to its…

We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…