Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Feng 2016 topology polynomials bounded integer coefficients
corollary_1_3: Feng's corollary that the lower limit of the consecutive gaps of the ordered sums of powers of q with digits 0, ..., m is zero exactly when q < m+1 and q is not a Pisot number.
corollary_1_7: Feng's answer to Lau's question: every q in (1, 2) for which only finitely many values at q of polynomials with coefficients ±1 and 0 lie in [-1/(q-1), 1/(q-1)] is a Pisot number.
theorem_1_11: Feng's theorem that a homogeneous iterated function system x -> rho x + b_i on the line, with 0 = b_0 < ... < b_m = 1 - rho and consecutive gaps b_{i+1} - b_i at most rho, satisfies the finite type condition whenever it satisfies the weak separation condition.
theorem_1_2: Feng's main theorem: for q > 1 and a positive integer m, the set Y_m(q) of values at q of polynomials with coefficients in {0, ±1, ..., ±m} is dense in the reals exactly when q < m+1 and q is not a Pisot number.
theorem_1_4: Feng's 2016 theorem that for 1 < q < sqrt(m+1) with q^2 not a Pisot number the upper limit L_m(q) of the consecutive gaps of the finite sums of powers of q with digits 0, ..., m is zero; with m = 1 and the absence of Pisot numbers below q_0 = 1.3247..., this gives x_{k+1} - x_k -> 0 for every q in (1, sqrt(q_0)), the question of Problem 1096.
theorem_1_6: Feng's theorem, conjectured by Akiyama and Komornik, that for 1 < q <= m+1 the set Y_m(q) of values at q of polynomials with coefficients in {0, ±1, ..., ±m} has no finite accumulation point exactly when 0 is not one of its accumulation points.
Feng, De-Jun, On the topology of polynomials with bounded integer coefficients. J. Eur. Math. Soc. (JEMS) 18 (2016), no. 1, 181--193; DOI 10.4171/JEMS/587 (the Crossref record dates the article 16 December 2015). The site's key Fe16.
The copy read for this card is arXiv:1109.1407v3 (1 February 2015; "15 pages, to appear in J. Eur. Math. Soc"), 15 pages with a complete text layer; the abstract page lists three versions (v1 7 September 2011, v2 10 November 2011, v3 1 February 2015) and no journal reference. The journal text was not compared; the locators below are the preprint's. The statements were read on the rendered page images of pp. 1--6. Source: https://arxiv.org/abs/1109.1407. The arXiv record names arXiv's non-exclusive distribution license (arXiv:1109.1407), every other right reserved.
Read status: claims checked for the abstract, Question 1.1, the two non-density cases with their proofs, Theorem 1.2, the definitions of , and , Corollary 1.3, the survey paragraph on partial results, Theorem 1.4 with its footnote, Theorems 1.5 and 1.6, read clause by clause on the page images of pp. 1--3; Corollary 1.7 and the definition of an F-number (p. 4), Definitions 1.8 and 1.9, Remark 1.10, Theorem 1.11 and the derivation of Theorem 1.6 from it (pp. 4--6), read clause by clause on the page images; the proof of Theorem 1.11 (Section 2, pp. 6--11) was read for structure only and not checked.
For q > 1 and a positive integer m let Y_m(q) be the set of values sum_{i=0}^n eps_i q^i with digits eps_i in {0, ±1, ..., ±m}. The paper's main theorem is that Y_m(q) is dense in R exactly when q < m+1 and q is not Pisot, completing a chain of partial results and answering an open question of Erdős, Joó and Komornik. The two known non-density cases are recalled with short proofs: if q is Pisot, multiplying a nonzero polynomial value by its conjugates gives a nonzero integer and hence |P(q)| > m^{-d}(1-rho)^d, so 0 is isolated and (since Y_{2m}(q) = Y_m(q) - Y_m(q)) Y_m(q) is uniformly discrete (Garsia); if q
= m+1 the digit sums cannot bridge the gap below q^n (Erdős-Komornik). The positive direction, that density holds for all non-Pisot q < m+1, is proved by iterated function system techniques, the paper's stated keywords being Pisot numbers and iteration function systems. For problem 1096 the operative statement is not the main theorem but Theorem 1.4 (p. 3): for with not a Pisot number, , and in particular for with not Pisot, where is the upper limit of the gaps of the problem's sequence; since no Pisot number lies in , the smallest Pisot number, the gaps tend to for every , which answers the problem (the deduction is written on the problem page).
Contents
- Section 1 (pp. 1--6). Question 1.1: for which is dense in ? The non-density cases (Garsia for Pisot ; Erdős--Komornik for ) with their proofs (pp. 1--2). Theorem 1.2 (p. 2): " is dense in if and only if and is not a Pisot number." The Erdős--Joó--Komornik project: arranged as , with and ; by Drobot, iff is dense; Corollary 1.3: iff and is not Pisot, answering the question of [8] whether for every non-Pisot . The survey paragraph (p. 3): Bugeaud (some with for non-Pisot ), Erdős--Komornik [9] ( for non-Pisot and ), Akiyama--Komornik, Sidorov--Solomyak; for : Erdős--Komornik proved for Pisot or , Komornik's conjecture for every non-Pisot below the golden ratio, " if ([9, 1]). Here the second part was only proved in [9] for all with the possible exception of the square root of the second Pisot number." Theorem 1.4 (p. 3): whenever and is not Pisot, so for every whose square is not Pisot; derived from Corollary 1.3 and the implication ([1, Lemma 2.5]; footnote 3: "first proved in [8, Theorem 5] in the case "). Theorem 1.5 (Akiyama--Komornik): has a finite accumulation point iff and is not Pisot. Theorem 1.6 (the paper's new result): for , has no finite accumulation point iff is not an accumulation point; Theorem 1.2 follows from Theorems 1.5 and 1.6. Corollary 1.7 (every F-number is Pisot); the set of sums (p. 4); homogeneous iterated function systems (p. 4), with the weak separation and finite type conditions (Definitions 1.8 and 1.9, p. 5) and Theorem 1.11 (p. 5), from which Theorem 1.6 is derived (pp. 5--6); Corollary 1.12 (p. 6): the IFS , for , satisfies the weak separation condition (resp. the finite type condition) if and only if is a Pisot number.
- Section 2 (pp. 6--11): Lemma 2.1 (p. 6) and Lemma 2.2 (p. 8), then the proof of Theorem 1.11 on separation properties of homogeneous IFS on in three steps (pp. 8--11); read for structure only.
- Section 3 (pp. 11--13): final remarks and open questions, among them Proposition 3.1 and Corollary 3.2 (p. 12) and the two closing questions (p. 13), read for structure only; references, pp. 13--15 (not read beyond the headings).
Compiled scope
The introduction (Section 1, pp. 1--6) was read clause by clause on the page images; Section 2 and Section 3 were read for structure only. Result pages:
- Theorem 1.2 (p. 2), the main theorem: is dense in if and only if and is not a Pisot number.
- Corollary 1.3 (p. 3): if and only if and is not a Pisot number.
- Theorem 1.4 (p. 3): if and is not a Pisot number, then ; in particular for with not Pisot.
- Theorem 1.6 (p. 3), the result the paper proves: for , has no finite accumulation points in if and only if is not an accumulation point of .
- Corollary 1.7 (p. 4): every F-number is a Pisot number.
- Theorem 1.11 (p. 5): a homogeneous IFS satisfying (1.1) and (1.2) that satisfies the weak separation condition satisfies the finite type condition.
The non-density cases (pp. 1--2), Theorem 1.5 (Akiyama and Komornik's, recalled), Corollary 1.12 and Section 3 are recorded in the contents above and have no page of their own. No proof was checked and nothing here is independently reviewed.
Bears on. #1096: Theorem 1.4 with gives for every whose square is not a Pisot number, hence for every , since then , an interval that contains no Pisot number. Erdős and Komornik's Theorem IV, whose range Feng's survey paragraph reports as with the possible exception of the square root of the second Pisot number , covers the longer interval , ; Theorem 1.4 itself reaches every whose square is not Pisot and is silent at the square roots of Pisot numbers. Theorem 1.2 and Corollary 1.3 concern density and the lower limit of the gaps, not the problem's limit; Corollary 1.3 at is the input of Theorem 1.4. Theorems 1.6 and 1.11 and Corollary 1.7 bear on no Erdős problem directly.
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.