Fibonacci numbers and words
β Scribed by Giuseppe Pirillo
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 521 KB
- Volume
- 173
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let 4> be the golden ratio (xf5 + 1)/2, f, the nth Fibonacci finite word and f the Fibonacci infinite word. Let r be a rational number greater than (2 + q~)/2 and u a non-empty word. If u" is a factor of f, then there exists n ~> 1 such that u is a conjugate of f. and, moreover, each occurrence of u' is contained in a maximal one of (f.)~ for some s e [2, 2 + ~b). Several known results on the Fibonacci infinite word follow from this.
π SIMILAR VOLUMES
In this paper, we introduce a subclass of the Dyck paths (Delest and Viennot, 1984) called nondecreasing Dyck paths which are enumerated by the Fibonacci numbers having odd indexes. We then use two different methods to enumerate these paths according to various parameters. By the first one, used in
The Pascal matrix and the Stirling matrices of the ΓΏrst kind and the second kind obtained from the Fibonacci matrix are studied, respectively. Also, we obtain combinatorial identities from the matrix representation of the Pascal matrix, the Stirling matrices of the ΓΏrst kind and the second kind and