Some properties of the Fibonacci sequence on an infinite alphabet

MaRDI QIDQ2363115zbMATH OpenFDO

Authors Jiemeng Zhang, Wen Wu, Zhixiong Wen

Publication date 13 July 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p52

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Fibonacci numbersingular wordsdigit suminfinite Fibonacci sequence

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50)

Recommendations

• More properties of the Fibonacci word on an infinite alphabet
• Some properties of the singular words of the Fibonacci word
• Factorizations of the Fibonacci infinite word
• scientific article; zbMATH DE number 4183705
• A formula for an infinite family of Fibonacci-word sequences

Cites work

• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• scientific article; zbMATH DE number 2087217 (Why is no real title available?)
• A combinatorial property of the Fibonacci words
• A generalization of the Fibonacci word fractal and the Fibonacci snowflake
• An Infinite Automaton Characterization of Double Exponential Time
• Automatic Sequences
• Balances of m-bonacci Words
• Conjugation of standard morphisms and a generalization of singular words
• Hankel determinants for the Fibonacci word and Padé approximation
• Locating factors of the infinite Fibonacci word
• Lyndon factorization of Sturmian words
• Lyndon words and Fibonacci numbers
• Lyndon words and singular factors of sturmian words
• Morphisms on infinite alphabets, countable states automata and regular sequences
• Nombres algébriques et substitutions
• Occurrences of palindromes in characteristic Sturmian words
• On the \(k\)-Fibonacci words
• Padé approximation for words generated by certain substitutions, and Hankel determinants
• Smooth words over arbitrary alphabets
• Some properties of the Tribonacci sequence
• Some properties of the factors of Sturmian sequences.
• Some properties of the singular words of the Fibonacci word
• Substitution dynamical systems on infinite alphabets
• Substitutions in dynamics, arithmetics and combinatorics
• The sequence of return words of the Fibonacci sequence

Cited in

(10)

• scientific article; zbMATH DE number 4183705 (Why is no real title available?)
• A skeleton model to enumerate standard puzzle sequences
• scientific article; zbMATH DE number 778468 (Why is no real title available?)
• On square factors and critical factors of \(k\)-bonacci words on infinite alphabet
• Morphic words, Beatty sequences and integer images of the Fibonacci language
• Fibonacci words, hyperbolic tilings and grossone
• Fibonacci-type \(1D\) and \(2D\) words
• A formula for an infinite family of Fibonacci-word sequences
• Infinite word factorization and signal flow graph
• More properties of the Fibonacci word on an infinite alphabet

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Some properties of the Fibonacci sequence on an infinite alphabet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363115)