Abstract
The goal of this paper is to generalize the concepts and methods used in the study of Hofstadter’s extraction conjecture begun in [2] and [5]. Let α, 0 < α < 1, be irrational, let x = x(α) be the infinite string whose n-th element is “c” or “d” depending on whether [(n + l)α] − [na] equals 0 or 1 respectively, with [z] denoting the greatest integer function. For integer m ≥ 0 define s m , x m by
with L(s) denoting the length of the string s.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chuan, W. “Fibonacci Words”. The Fibonacci Quarterly, Vol. 30 (1992): pp. 68–76.
Chuan, W. “Extraction Property of the Golden Sequence”. Preprint.
Fraenkel, A.S., Levitt, J. & Shimshoni, M. “Characterization of the Set of Values of f(n) = [nθ], n = l,2,…”. Discrete Math., Vol. 2 (1972): pp. 335–45.
Fraenkel, A.S., Mushkin, M. and Tassa, U. “Determination of [nθ] by Its Sequences of Differences”. Can. Math. Bull., Vol. 21 (1978): pp. 441–46.
Hendel, R.J. and Monteferrante, S.A. “Hofstadter’s Extraction Conjecture”. The Fibonacci Quarterly, Vol. 32 (1994): pp. 98–107.
Hofstadter, D.R. Eta-Lore. First presented at the Stanford Math club, Stanford, California, 1963.
Shallit, J.O. “A Generalization of Automatic Sequences”. Theoretical Computer Science, Vol. 61 (1988): pp. 1–16.
Venkoff, B.A. Elementary Number Theory, pp. 65–68. Trans, and ed. H. Alderson. Gronigen: Wolters-Noordhof, 1970.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Hendel, R.J. (1996). Hofstadter’s Conjecture for \(\alpha = \sqrt 2 - 1\) . In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0223-7_16
Download citation
DOI: https://doi.org/10.1007/978-94-009-0223-7_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6583-2
Online ISBN: 978-94-009-0223-7
eBook Packages: Springer Book Archive