Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Tenenbaum 1996 block behrend sequences
corollary_1: For a block sequence with log(T_{j+1}/T_j) of order j^sigma (log 2j)^tau and log H_j of order j^-alpha (log 2j)^gamma, sigma > -1, the sequence is Behrend if alpha < alpha_0(sigma) and not if alpha > alpha_0(sigma), for an explicit piecewise linear alpha_0 with a break at sigma_0 = log 2/(1 - log 2).
corollary_2: A block sequence whose consecutive ratios T_{j+1}/T_j lie between two constants above 1 and whose blocks are (T_j, (1 + j^-alpha) T_j], alpha > 0, is a Behrend sequence if alpha < log 2 and is not if alpha > log 2; the paper reads this as confirming Erdős's conjecture in its two-sided form.
theorem_1: A block sequence of intervals (T_j, H_j T_j] satisfying three regularity conditions, a lower bound on the block lengths and the divergence of a series with exponent beta > 1 - log 2 is a Behrend sequence: its set of multiples has asymptotic density 1.
G. Tenenbaum, On block Behrend sequences, Math. Proc. Cambridge Philos. Soc. 120 (1996), no. 2, 355--367; DOI 10.1017/S0305004100074910 (the journal data were checked against Crossref).
The copy read for this card is the author's TeX typescript, sixteen A4 pages with a usable text layer, headed "Math. Proc. Cambridge Phil. Soc. (1996) 120 355–367" and dated 2003 in its file metadata. Page numbers below are the typescript's (pp. 1--16); the journal version was not compared, so its page numbers and labels may differ. Provenance: the copy was downloaded in September 2026; the download URL was not recorded. 188,344 bytes. The copy read is the author's TeX typescript rather than the journal's edition and prints no copyright or license line on pp. 1--2 or 15--16; its download URL was not recorded, so no host's terms could be checked, and the publisher's page for the journal edition was not consulted; the term is unstated.
Read status: claims checked for Theorem 1 and Corollaries 1 and 2, whose statements were read clause by clause on the page images of pp. 3--5; the proof of Theorem 1 (sections 2 and 3, pp. 6--15) was read for structure only, with no step checked. The citing problem page and its claim page consume Corollary 2. Result pages: Theorem 1, Corollary 1 and Corollary 2.
Contents
Throughout, is a strictly increasing sequence of integers exceeding , is its set of multiples, and is Behrend if has asymptotic density (p. 1). A block sequence is with and for a fixed (pp. 1--2). With respect to a function , the blocks with (1·1) form the sawn part and the remaining blocks the stretched part ; a block sequence is called sawn or stretched when it is its own sawn or stretched part, and is Behrend exactly when or is (p. 2). Here is the iterated logarithm.
- Introduction (p. 1): for pairwise coprime the criterion is , by the Davenport--Erdős theorem; the paper cites Erdős's Astérisque 61 (1979) paper (its [3]) for the problem of general criteria and calls effective general criteria "very difficult, if not hopeless" to obtain with present techniques.
- Theorem A (Hall and Tenenbaum 1992, the paper's [7]; p. 2): with and , a block sequence that is sawn or stretched with respect to is Behrend only if (1·2), where in the sawn case and in the stretched case; a stretched sequence is Behrend if, for some , (1·3) holds along a subsequence of indexes satisfying (1·4).
- Theorem 1 (p. 3; proof pp. 6--15): let be a block sequence satisfying, for some , (i) ; (ii) and (iii) whenever ; (iv) there is with for all ; and (v) . Then is a Behrend sequence. Condition (v) coincides for sawn sequences with the necessary condition (1·2) except for the value of ; the author conjectures that is admissible (p. 4).
- Corollary 1 (p. 4): if and with , put and for , for ; then is Behrend if and is not if .
- Corollary 2 (p. 5): if for all , with positive constants , and with , then is Behrend if and is not if . The paper says this confirms Erdős's conjecture exactly once his one-sided condition is read as two-sided, with the extra information (p. 5).
- Pseudo-criterion (p. 5): under (1·6) and (i)--(iv), Theorems A and 1 merge into with , a Borel--Cantelli type condition with the probabilities raised to a fixed power.
- Sections 2 and 3 (pp. 6--15): five lemmas and the proof of Theorem 1 by the Maier--Tenenbaum method (conditional probabilities for the products of small prime factors). Read for structure only.
Compiled scope
The introduction (pp. 1--5) was read in the text layer and the statements above were checked on the page images. The proof was read for structure only and nothing here is independently reviewed.
Bears on. #691: the paper's subject is the problem's question, criteria for to have density ; it gives a sufficient condition, the divergence of the series (v), for block sequences meeting its conditions (i)--(iv), adjacent to the necessary condition of Theorem A for sawn sequences (Theorem 1, p. 3), decides the Behrend property for blocks with , , and , except at the boundary exponent (Corollary 1, p. 4), and, under a two-sided condition on the ratios , places the threshold of Erdős's block conjecture at , without deciding (Corollary 2, p. 5). It states that effective general criteria seem very difficult, if not hopeless, with present techniques (p. 1), and gives none.
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.