scientific article; zbMATH DE number 3397597
From MaRDI portal
zbMath0252.10011MaRDI QIDQ5665234
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Other number representations (11A67)
Related Items
Stability for Take-Away Games, The Fibonacci Sequence and Schreier-Zeckendorf Sets, On Zeckendorf Related Partitions Using the Lucas Sequence, Automatic sequences in negative bases and proofs of some conjectures of shevelev, Addition machines, automatic functions and open problems of Floyd and Knuth, Unnamed Item, Proving results about OEIS sequences with \texttt{Walnut}, Proving properties of some greedily-defined Integer recurrences via automata theory, Zigzag polynomials, Artin's conjecture and trinomials, Note on a Fibonacci parity sequence, The extended Frobenius problem for Fibonacci sequences incremented by a Fibonacci number, Representaciones de los números naturales positivos, An Inequality for the Number of Periods in a Word, Some arithmetical properties of convergents to algebraic numbers, A Fibonacci analogue of the two’s complement numeration system, Enhanced ternary Fibonacci codes, Transduction of automatic sequences and applications, A General Approach to Proving Properties of Fibonacci Representations via Automata Theory, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On one sum associated with Fibonacci numeration system, Fractal Fourier spectra of Cherry flows, The Arnoux semi-conjugacy is Hölder continuous, A note on Fibonacci number of even index, The structure of Zeckendorf expansions, Unnamed Item, Unnamed Item, On the Zeckendorf representation of smooth numbers, On The diophantine equationFn+Fm=2a, A positive lower bound for liminf_{𝑁→∞}∏ᵣ₌₁^{𝑁}|2sin𝜋𝑟𝜑|, Some application of difference equations in Cryptography and Coding Theory, Connecting slow solutions to nested recurrences with linear recurrent sequences, Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences, On the number of partitions of an integer in the \(m\)-bonacci base, Synchronized sequences, A numeration system for Fibonacci-like Wang shifts, Fibonacci multiplication, The extra Fibonacci series and the Empire State Building, A class of adding machines and Julia sets, Grundy values of Fibonacci Nim, Decision algorithms for Fibonacci-automatic Words, I: Basic results, Representations of numbers and finite automata, Numbers with fixed sum of digits in linear recurrent number systems, Linear numeration systems of order two, On two relations characterizing the golden ratio, The structure of subword graphs and suffix trees of Fibonacci words, Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability, THE NUMBER OF SUBSETS OF THE SET CONTAINING NO TWO CONSECUTIVE EVEN INTEGERS, A full characterization of Bertrand numeration systems, Modular invariant of quantum tori, Robbins and Ardila meet Berstel, Piatetski-Shapiro sequences via Beatty sequences, Diameters of Cayley graphs of Chevalley groups, The use and usefulness of numeration systems, Robust universal complete codes for transmission and compression, Decycling bipartite graphs, Fibonacci-run graphs. I: Basic properties, Möbius orthogonality for the Zeckendorf sum-of-digits function, Transcendental numbers having explicit $g$-adic and Jacobi-Perron expansions, Cookie Monster Plays Games, Combinatorial constructions for the Zeckendorf sum of digits of polynomial values, Discrepancy of \(LS\)-sequences of partitions and points, Embeddings of circular orbits and the distribution of fractional parts, Automaticity. II: Descriptional complexity in the unary case, The number of valid factorizations of Fibonacci prefixes, Generalizing Zeckendorf's theorem to \(f\)-decompositions, Prefixes of the Fibonacci word that end with a cube, Canonical Diophantine representations of natural numbers with respect to quadratic ``bases, Unnamed Item, Frobenius Numbers and Automatic Sequences, Unnamed Item, Circular words and three applications: factors of the Fibonacci word, \(\mathcal F\)-adic numbers, and the sequence \(1, 5, 16, 45, 121, 320,\dots\), On the discrepancy of the sequence formed by the multiples of an irrational number, A morphic approach to combinatorial games: the Tribonacci case, Completeness of positive linear recurrence sequences, From Fibonacci numbers to central limit type theorems, Central sets and substitutive dynamical systems, Zeckendorf representation of multiplicative inverses modulo a Fibonacci number, The additive structure of integers with the lower Wythoff sequence, First-Order Logic and Numeration Systems, Average number of Zeckendorf integers, Bin decompositions, ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a, The distribution of gaps between summands in generalized Zeckendorf decompositions, Substitutions and \(\beta\) systems of numeration, Linear numeration systems and \(\theta\)-representations, Patterns in the generalized Fibonacci word, applied to games, Additive number theory via automata theory, Well dispersed sequences in \([0,1^{d}\)], Counting the number of non-zero coefficients in rows of generalized Pascal triangles, Sturmian numeration systems and decompositions to palindromes, Ostrowski numeration systems, addition, and finite automata, Unnamed Item, Behavior of digital sequences through exotic numeration systems, Substitutions, coding prescriptions and integer representation, Confluent linear numeration systems, The third order variations on the Fibonacci universal code, Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions, On representations of positive integers in the Fibonacci base, Robustness of Pisot-regular sequences, Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes, Long range variations on the Fibonacci universal code, Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture, A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems, Unnamed Item, Parallel addition in non-standard numeration systems, Some combinatorics from Zeckendorf representations, On Fibonacci partitions, Global Fibonacci nim, Sumsets associated with Wythoff sequences and Fibonacci numbers, On the subset sums of exponential type sequences, The weak converse of Zeckendorf's theorem, Optimal computation of census functions in the postal model, A Probabilistic Approach to Generalized Zeckendorf Decompositions, Powers of two as sums of three Fibonacci numbers, The Generalized Nagell–Ljunggren Problem: Powers with Repetitive Representations, Zeckendorf representations with at most two terms to \(x\)-coordinates of Pell equations, Arithmetic and dynamical properties of the Rauzy fractal, When is scalar multiplication decidable?, Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions, Sumsets of Wythoff sequences, Fibonacci representation, and beyond, Fibonacci, van der Corput and Riesz-Nágy, Heap games, numeration systems and sequences, Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms, The level of distribution of the sum-of-digits function of linear recurrence number systems, Recent results and questions in combinatorial game complexities, A new heap game, Tribonacci multiplication, Arrays, numeration systems and Frankenstein games, Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution, An Exercise on Fibonacci Representations, Generalized Zeckendorf expansions
