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

preprint2016arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.