By the same authors

From the same journal

New examples of complete sets, with connections to a Diophantine theorem of Furstenberg

Research output: Contribution to journalArticlepeer-review



Publication details

JournalActa Arithmetica
DateAccepted/In press - 16 Sep 2016
DateE-pub ahead of print (current) - 28 Dec 2016
Issue number2
Number of pages31
Pages (from-to)101-131
Early online date28/12/16
Original languageEnglish


A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of Cassels ('60), Zannier ('92), Burr, Erd\H{o}s, Graham, and Li ('96), and Hegyv\'ari ('00). We also introduce the somewhat philosophically related notion of a $dispersing$ set and refine a theorem of Furstenberg ('67).

Bibliographical note

© Instytut Matematyczny PAN, 2017.This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.

    Research areas

  • math.CO


Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations