An improved upper bound on the Ruzsa number

Abstract

Let Rm be the least positive integer r such that there exists a set A⊂eq Zm with A+A=Zm for which the number of ordered solutions of n=x+y with x,y∈ A is at most r for every n∈ Zm. In this note we prove that Rm≤slant 128 for every positive integer m, improving the previous bound Rm≤slant 192.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…