Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 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

Asymmetric infinite sumsets in large sets of integers (2502.03112v1)

Published 5 Feb 2025 in math.DS, math.CO, and math.NT

Abstract: We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that ${mb_1 + \ell b_2 \colon b_1,b_2\in B\ \text{and}\ b_1<b_2 \}+t \subset A,$ verifying a conjecture of Kra, Moreira, Richter and Robertson. We also consider the patterns $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\ \text{and}\ b_1 \leq b_2 \}$, for infinite $B\subset \mathbb{N}$ and prove that any set $A\subset \mathbb{N}$ with lower density $\underline{d}(A)\>1/2$ contains such configurations up to a shift. We show that the value $1/2$ is optimal and obtain analogous results for values of upper density and when no shift is allowed.

Summary

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