2000 character limit reached
Not so many non-disjoint translations (1711.04058v1)
Published 11 Nov 2017 in math.LO
Abstract: We show that, consistently, there is a Borel set which has uncountably many pairwise very non-disjoint translations, but does not allow a perfect set of such translations.