We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b,d) such that the following holds. If F is a finite family of subsets of R^d such that the ith reduced Betti number (with Z_2 coefficients in singular homology) of the intersection of any proper subfamily G of F is at most b for every non-negative integer i less or equal to (d-1)/2, then F has Helly number at most h(b,d). These topological conditions are sharp: not controlling any of these first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
Using algebra in geometry Pavel Paták Department: Department of Algebra Supervisor: Mgr. Pavel Růžič...
AbstractMotivated by the famous theorem of Helly on convex sets of Rd, a finite set system F is said...
We show that very weak topological assumptions are enough to ensure the existence of a Helly-type th...
We show that very weak topological assumptions are enough to ensure the existence of a Helly-type th...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
We show that very weak topological assumptions are enough to ensure the existence of a Helly-type th...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
Using algebra in geometry Pavel Paták Department: Department of Algebra Supervisor: Mgr. Pavel Růžič...
AbstractMotivated by the famous theorem of Helly on convex sets of Rd, a finite set system F is said...
We show that very weak topological assumptions are enough to ensure the existence of a Helly-type th...
We show that very weak topological assumptions are enough to ensure the existence of a Helly-type th...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
We show that very weak topological assumptions are enough to ensure the existence of a Helly-type th...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
International audienceThe Helly number of a family of sets with empty intersection is the size of it...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
Using algebra in geometry Pavel Paták Department: Department of Algebra Supervisor: Mgr. Pavel Růžič...
AbstractMotivated by the famous theorem of Helly on convex sets of Rd, a finite set system F is said...