Results 111 to 120 of about 30,407 (243)
Lyndon words and Fibonacci numbers
It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon word of length n must have, but this bound is not optimal.
openaire +3 more sources
A Curious Property of the Eleventh Fibonacci Number [PDF]
B.M.M. de Weger
openalex +1 more source
Fibonacci Decimal Number Patterns Via the Generating Function
Russell Euler
openalex +1 more source
Some Weighted Generalized Fibonacci Number Summation Identities, Part 2
M. J. Kronenburg
openalex +2 more sources
Fibonacci anyons ε provide the simplest possible model of non-Abelian fusion rules: [1] × [1] = [0] ⊕ [1]. We propose a conformal field theory construction of topological quantum registers based on Fibonacci anyons realized as quasiparticle excitations ...
Ludmil Hadjiivanov, Lachezar S. Georgiev
doaj +1 more source
Initial number of Lucas’ type series for the generalized Fibonacci sequence
Siniša Crvenković +3 more
openalex +2 more sources
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
Aline Castro +3 more
openalex +2 more sources
s-th power of Fibonacci number of the form 2^a + 3^b + 5^c [PDF]
Nurettin Irmak, Bo He
openalex +1 more source

