Abstract

The notion of (k,m)(k,m)-agreeable society was introduced by Deborah Berg et al.: a family of convex subsets of Rd\R^d is called (k,m)(k,m)-agreeable if any subfamily of size mm contains at least one non-empty kk-fold intersection. In that paper, the (k,m)(k,m)-agreeability of a convex family was shown to imply the existence of a subfamily of size βnβn with non-empty intersection, where nn is the size of the original family and β∈[0,1]β\in[0,1] is an explicit constant depending only on k,mk,m and dd. The quantity β(k,m,d)β(k,m,d) is called the minimal \emph{agreement proportion} for a (k,m)(k,m)-agreeable family in Rd\R^d. If we only assume that the sets are convex, simple examples show that β=0β=0 for (k,m)(k,m)-agreeable families in Rd\R^d where k<dk<d. In this paper, we introduce new techniques to find positive lower bounds when restricting our attention to families of dd-boxes, i.e. cuboids with sides parallel to the coordinates hyperplanes. We derive explicit formulas for the first non-trivial case: the case of (2,3)(2,3)-agreeable families of dd-boxes with d≥2d\geq 2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.