Related papers: Sunflowers of Convex Open Sets

Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…

Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…

Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…

Let $H$ be a Hilbert space. For a closed convex body $A$ denote by $r(A)$ the supremum of radiuses of balls, contained in $A$. We prove, that $\sum_{n=1}^\infty r(A_n) \ge r(A)$ for every covering of a convex closed body $A \subset H$ by a…

Let $V$ be a finite nonempty set. A transit function is a map $R:V\times V\rightarrow 2^V$ such that $R(u,u)=\{u\}$, $R(u,v)=R(v,u)$ and $u\in R(u,v)$ hold for every $u,v\in V$. A set $K\subseteq V$ is $R$-convex if $R(u,v)\subset K$ for…

The sunspot penumbra comprises numerous thin, radially elongated filaments that are central for heat transport within the penumbra, but whose structure is still not clear. To investigate the fine-scale structure of these filaments, we…

This article presents a new set representation named the hybrid zonotope that is equivalent to the union of $2^N$ constrained zonotopes -- convex polytopes -- through the addition of $N$ binary zonotope factors. The major contribution of…

A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries…

A collection of sets is intersecting, if any pair of sets in the collection has nonempty intersection. A collection of sets \(\mathcal{C}\) has the Helly property if any intersecting subcollection has nonempty intersection. A graph is…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…

We prove that for any set $F$ of $n\ge 2$ pairwise disjoint open convex sets in $\mathbb{R}^3$, the connected components of the set of lines intersecting every member of $F$ are contractible. The same result holds for directed lines.

We consider cubic graphs formed with $k \geq 2$ disjoint claws $C_i \sim K_{1, 3}$ ($0 \leq i \leq k-1$) such that for every integer $i$ modulo $k$ the three vertices of degree 1 of $\ C_i$ are joined to the three vertices of degree 1 of…

The stable and unstable manifolds of an invariant set of a piecewise-smooth map are themselves piecewise-smooth. Consequently, as parameters of a piecewise-smooth map are varied, an invariant set can develop a homoclinic connection when its…

A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

In this paper, we prove there exist at least $[\frac{n+1}{2}]+1$ geometrically distinct closed characteristics on every compact convex hypersurface $\Sg$ in $\R^{2n}$. Moreover, there exist at least $[\frac{n}{2}]+1$ geometrically distinct…

A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We…

A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…

Given a hypergraph $H = (V,E)$, what is the smallest subset $X \subseteq V$ such that $e \cap X \neq \emptyset$ holds for all $e \in E$? This problem, known as the hitting set problem, is a basic problem in parameterized complexity theory.…