Hostname: page-component-7b7567c8c-p67k6 Total loading time: 0 Render date: 2026-11-19T19:02:40.820Z Has data issue: false hasContentIssue false

On block Behrend sequences

Published online by Cambridge University Press:  24 October 2008

G. Tenenbaum
Affiliation:
Institut Élie Cartan, Université Henri Poincaré-Nancy 1, BP 239, 54506 Vandœuvre Cedex, France
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let A be a strictly increasing sequence of integers exceeding 1 and let

denote its set of multiples. We say that A is a Behrend sequence if M(A) has asymptotic density 1. The theory of sets of multiples was first developed in the late thirties, under the influence of Erdős, Besicovitch, and others. An account of the classical notions is presented in the book of Halberstam and Roth (1966), and recent progress in the area may be found in Hall and Tenenbaum [7], Erdős and Tenenbaum [4], Ruzsa and Tenenbaum [9]. As underlined by Erdős in [3], one of the central problems in the field is that of finding general criteria to decide whether a given sequence A is Behrend.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1996