Papers
Topics
Authors
Recent
Search
2000 character limit reached

Helly numbers of Algebraic Subsets of $\mathbb R^d$

Published 10 Aug 2015 in math.MG and math.CO | (1508.02380v1)

Abstract: We study $S$-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in $\mathbb Rd$ with a proper subset $S\subset \mathbb Rd$. We contribute new results about their $S$-Helly numbers. We extend prior work for $S=\mathbb Rd$, $\mathbb Zd$, and $\mathbb Z{d-k}\times\mathbb Rk$; we give sharp bounds on the $S$-Helly numbers in several new cases. We considered the situation for low-dimensional $S$ and for sets $S$ that have some algebraic structure, in particular when $S$ is an arbitrary subgroup of $\mathbb Rd$ or when $S$ is the difference between a lattice and some of its sublattices. By abstracting the ingredients of Lov\'asz method we obtain colorful versions of many monochromatic Helly-type results, including several colorful versions of our own results.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.