English
Related papers

Related papers: On the hollow enclosed by convex sets

200 papers

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

Combinatorics · Mathematics 2011-07-07 Martin Tancer

Starting with a finite point set $X \subset \mathbf{R}^d$, the peeling process repeatedly removes the set of the vertices of the convex hull of the current set. The number of peeling steps required to completely remove $X$ is called the…

Metric Geometry · Mathematics 2021-04-22 Gergely Ambrus , Peter Nielsen , Caledonia Wilson

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

B\'ar\'any, Katchalski and Pach proved the following quantitative form of Helly's theorem. If the intersection of a family of convex sets in $\mathbb{R}^d$ is of volume one, then the intersection of some subfamily of at most $2d$ members is…

Metric Geometry · Mathematics 2015-03-26 Marton Naszodi

We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…

Data Structures and Algorithms · Computer Science 2016-12-13 Israela Solomon

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

Metric Geometry · Mathematics 2016-01-19 J. Jerónimo-Castro , E. Makai

We prove the following the generalized Tur\'an type result. A collection $\mathcal{T}$ of $r$ sets is an $r$-triangle if for every $T_1,T_2,\dots,T_{r-1}\in \mathcal{T}$ we have $\cap_{i=1}^{r-1}T_i\neq\emptyset$, but $\cap_{T\in…

Combinatorics · Mathematics 2022-01-12 Dániel T. Nagy , Balázs Patkós

We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…

Functional Analysis · Mathematics 2011-11-22 Taras Banakh , Ivan Hetman

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…

Numerical Analysis · Computer Science 2009-06-01 Laura Maruster , Stefan Maruster

Complements of union-closed families of sets, over a finite ground set, are known as simply rooted families of sets. Cubical sets are widely studied topological objects having applications in computational homology. In this paper, we look…

Combinatorics · Mathematics 2024-09-26 Dhruv Bhasin

The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…

Combinatorics · Mathematics 2017-04-25 Abigail Raz

We prove that for certain families of semi-algebraic convex bodies in 3 dimensions, the convex hull of $n$ disjoint bodies has $O(n\lambda_s(n))$ features, where $s$ is a constant depending on the family: $\lambda_s(n)$ is the maximum…

Computational Geometry · Computer Science 2015-09-21 Colm Ó Dúnlaing

For convex sets $K$ and $L$ in ${\mathbb{R}}^d$ we define $R_L(K)$ to be the convex hull of all points belonging to $K$ but not to the interior of $L$. Cutting-plane methods from integer and mixed-integer optimization can be expressed in…

Optimization and Control · Mathematics 2011-06-09 Gennadiy Averkov

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.

Combinatorics · Mathematics 2007-07-23 Tamon Stephen , Hugh Thomas

For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…

Combinatorics · Mathematics 2018-06-07 Demet Taylan

Given a point set $S$ in $\mathbb{R}^d$, a family of sets is $S$-intersecting if its members have a point in common in $S$. Recently, Edwards and Sober\'{o}n proved a fractional version of Halman's theorem for axis-parallel boxes, showing…

Combinatorics · Mathematics 2025-03-18 Taehyun Eom , Minki Kim , Eon Lee

The Helly number of a family of sets with empty intersection is the size of its largest inclusion-wise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected…

Combinatorics · Mathematics 2011-02-25 Éric Colin de Verdière , Grégory Ginot , Xavier Goaoc

Let $\mathcal{W}^{n}$ be the class of $C^{\infty }$ complete simply connected $n-$dimensional manifolds without conjugate points. The hyperbolic space as well as Euclidean space are good examples of such manifolds. Let $% W\in…

Differential Geometry · Mathematics 2019-12-05 Sameh Shenawy

Consider $n$ points $X_1,\ldots,X_n$ in $\mathbb R^d$ and denote their convex hull by $\Pi$. We prove a number of inclusion-exclusion identities for the system of convex hulls $\Pi_I:=conv(X_i\colon i\in I)$, where $I$ ranges over all…

Probability · Mathematics 2016-03-07 Zakhar Kabluchko , Günter Last , Dmitry Zaporozhets

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…

Combinatorics · Mathematics 2020-11-17 George M. Bergman