Intersection patterns of planar sets

Abstract: Let

m a t h c a l A = A_{1}, l d o t s, A_{n}

be a family of sets in the plane. For

0 l e q i < n

, denote by

f_{i}

the number of subsets

s i g m a

of

1, l d o t s, n

of cardinality

i + 1

that satisfy

. Let

k g e q 2

be an integer. We prove that if each

k

-wise and

(k + 1)

-wise intersection of sets from

m a t h c a l A

is empty, or a single point, or both open and path-connected, then

f_{k + 1} = 0

implies

f_{k} l e q c f_{k - 1}

for some positive constant

c

depending only on

k

. Similarly, let

b g e q 2, k > 2 b

be integers. We prove that if each

k

-wise or

(k + 1)

-wise intersection of sets from

m a t h c a l A

has at most

b

path-connected components, which all are open, then

f_{k + 1} = 0

implies

f_{k} l e q c f_{k - 1}

for some positive constant

c

depending only on

b

and

k

. These results also extend to two-dimensional compact surfaces.

Recommendations

Cites Work

Cited In (5)

This page was built for publication: Intersection patterns of planar sets