13 citations · 31 across the 7 of their papers we have counts for
8 papers
Reflective Numeration Systems I: a Global Standpoint
Benoît Rittaud
We present a framework to generalize the standard b-ary Gray code to get the k-bonacci ones obtained in [5] as well as many others by using theoretical tools that allow to make cal…
Designing videos for undergraduate mathematics
Arij Bouzelmate, Benoît Rittaud
This article presents some technical and pedagogical considerations about a series of videos made by the authors to teach elementary theory of differential equations. Intended to b…
The Field Q and the Equality 0.999 . . . = 1 from Combinatorics of Circular Words and History of Practical Arithmetics
Benoît Rittaud, Laurent Vivier
We reconsider the classical equality 0.999. .. = 1 with the tool of circular words, that is: finite words whose last letter is assumed to be followed by the first one. Such circula…
Fibonacci-like sequences for variants of the tower of Hanoi, and corresponding graphs and gray codes
Benoît Rittaud
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonacci sequence involved in the optimal algorithm of resolution, and show some nice…
Circular words and applications
Benoît Rittaud, Laurent Vivier
We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular wo…
Growth rate for the expected value of a generalized random Fibonacci sequence
Elise Janvresse, Benoît Rittaud, Thierry De La Rue
A random Fibonacci sequence is defined by the relation g_n = | g_{n-1} +/- g_{n-2} |, where the +/- sign is chosen by tossing a balanced coin for each n. We generalize these sequen…