Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Borel sets without perfectly many overlapping translations IV (2302.12964v1)

Published 25 Feb 2023 in math.LO

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.

Summary

We haven't generated a summary for this paper yet.