scientific article; zbMATH DE number 3076700

From MaRDI portal
Publication:5815665

zbMath0049.03101MaRDI QIDQ5815665

C. Gerrit Lekkerkerker

Publication date: 1952


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (42)

Stability for Take-Away GamesBalance in AVL trees and space cost of brother treesSynchronized sequencesFibonacci multiplicationThe extra Fibonacci series and the Empire State BuildingThe Fibonacci Sequence and Schreier-Zeckendorf SetsNatural halting probabilities, partial randomness, and zeta functionsDecision algorithms for Fibonacci-automatic words. II: Related sequences and avoidabilityRobbins and Ardila meet BerstelOn Zeckendorf Related Partitions Using the Lucas SequenceAutomaticity. II: Descriptional complexity in the unary caseAutomatic sequences in negative bases and proofs of some conjectures of shevelevThe number of valid factorizations of Fibonacci prefixesGeneralizing Zeckendorf's theorem to \(f\)-decompositionsPrefixes of the Fibonacci word that end with a cubeUnnamed ItemFrobenius Numbers and Automatic SequencesProving results about OEIS sequences with \texttt{Walnut}Zigzag polynomials, Artin's conjecture and trinomialsNote on a Fibonacci parity sequenceRepresentaciones de los números naturales positivosAn Inequality for the Number of Periods in a WordA Fibonacci analogue of the two’s complement numeration systemTransduction of automatic sequences and applicationsA General Approach to Proving Properties of Fibonacci Representations via Automata TheorySpectral and quantum dynamical properties of the weakly coupled Fibonacci HamiltonianUnnamed ItemFrom Fibonacci numbers to central limit type theoremsAverage number of Zeckendorf integersBin decompositionsThe distribution of gaps between summands in generalized Zeckendorf decompositionsAdditive number theory via automata theorySturmian numeration systems and decompositions to palindromesSubword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjectureOn the complexity of Fibonacci codingOn Fibonacci partitionsGlobal Fibonacci nimA Probabilistic Approach to Generalized Zeckendorf DecompositionsThe Generalized Nagell–Ljunggren Problem: Powers with Repetitive RepresentationsThe structure of Zeckendorf expansionsSummand minimality and asymptotic convergence of generalized Zeckendorf decompositionsSumsets of Wythoff sequences, Fibonacci representation, and beyond




This page was built for publication: