Which Rationals are Ratios of Pisot Sequences?
Canadian mathematical bulletin, Tome 28 (1985) no. 3, pp. 343-349

Voir la notice de l'article provenant de la source Cambridge University Press

A Pisot sequence is a sequence of integers defined recursively by the formula - . If 0 < a0 < a1 then an+1/an converges to a limit θ. We ask whether any rational p/q other than an integer can ever occur as such a limit. For p/q > q/2, the answer is no. However, if p/q < q/2 then the question is shown to be equivalent to a stopping time problem related to the notorious 3x + 1 problem and to a question of Mahler concerning the powers of 3/2. Although some interesting statistical properties of these stopping time problems can be established, we are forced to conclude that the question raised in the title of this paper is perhaps more intractable than it might appear.
DOI : 10.4153/CMB-1985-041-6
Mots-clés : 10F40, 10L10, 12A15
Boyd, David. Which Rationals are Ratios of Pisot Sequences?. Canadian mathematical bulletin, Tome 28 (1985) no. 3, pp. 343-349. doi: 10.4153/CMB-1985-041-6
@article{10_4153_CMB_1985_041_6,
     author = {Boyd, David},
     title = {Which {Rationals} are {Ratios} of {Pisot} {Sequences?}},
     journal = {Canadian mathematical bulletin},
     pages = {343--349},
     year = {1985},
     volume = {28},
     number = {3},
     doi = {10.4153/CMB-1985-041-6},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1985-041-6/}
}
TY  - JOUR
AU  - Boyd, David
TI  - Which Rationals are Ratios of Pisot Sequences?
JO  - Canadian mathematical bulletin
PY  - 1985
SP  - 343
EP  - 349
VL  - 28
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1985-041-6/
DO  - 10.4153/CMB-1985-041-6
ID  - 10_4153_CMB_1985_041_6
ER  - 
%0 Journal Article
%A Boyd, David
%T Which Rationals are Ratios of Pisot Sequences?
%J Canadian mathematical bulletin
%D 1985
%P 343-349
%V 28
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1985-041-6/
%R 10.4153/CMB-1985-041-6
%F 10_4153_CMB_1985_041_6

[1] 1. Boyd, D.W., Pisot sequences which satisfy no linear recurrence, Acta Arith. 32 (1977), pp. 89—98 Google Scholar

[2] 2. Boyd, D.W., On linear recurrence relations satisfied by Pisot sequences, to appear. Google Scholar

[3] 3. Conway, J.H., Unpredictable iterations, Proc. 1972 Number Theory Conference, Boulder, Colo., pp. 49–52, MR53 #13717. Google Scholar

[4] 4. Everett, C.J., Iteration of the number theoretic function f(2n) = n,f(2n + 1) = 3n + 2, Advances in Math. 25 (1977), pp. 42–45. Google Scholar

[5] 5. Flor, P., Uber eine Klasse von Folgen naturlicher Zahlen, Math. Annalen 140 (1960), pp. 299—307 Google Scholar

[6] 6. Gantmacher, F.R., The Theory of Matrices, Chelsea Publishing Co., N.Y., 1971. Google Scholar

[7] 7. Katok, A.B., Sinai, Ya.G. and Stepin, A.M., Theory of dynamical systems and general transformation groups with invariant measure, Jour. Soviet Math. 7 (1977), pp. 974—1065 Google Scholar

[8] 8. Kemeny, J.G., Snell, J.L. and Knapp, A.W., Denumerable Markov Chains, Springer-Verlag, 1976. Google Scholar

[9] 9. Lagarias, J.C., The 3x + 1 problem and its generalizations, Amer. Math. Monthly, 92 (1985), pp. 3–23. Google Scholar

[10] 10. Mahler, K., An unsolved problem on the powers of 3/2, Jour. Australian Math. Soc. 8 (1968), pp. 313–321. Google Scholar

[11] 11. Pisot, Ch., La répartition modulo 1 et les nombres algébriques, Ann. Scuola Norm. Sup. Pisa 7 (1938), pp. 205–248. Google Scholar

[12] 12. Terras, R., A stopping time problem on the positive integers, Acta Arith. 30 (1976), pp. 241–252. Google Scholar

Cité par Sources :