2000 character limit reached
Borel sets without perfectly many overlapping translations IV
Published 25 Feb 2023 in math.LO | (2302.12964v1)
Abstract: We show that, consistently, there exists a Borel set B subset Cantor admitting a sequence (eta_alpha:alpha<lambda) of distinct elements of Cantor such that (eta_alpha+B) cap (eta_beta+B) is uncountable for all alpha,beta<lambda but with no perfect set P such that |(eta+B) cap (nu+B)|\>5 for any distinct eta,nu from P. This answers two questions from our previous works.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.