Year: 2026
Type: preprint
Abstract: 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 calculations on lists. We introduce the notion of Z-Gray product, from which we deduce sequences of lists of finite words avoiding a predefinite list Z of factors and which satisfy a power-associativity property as well a generalizations of the classical flipping digit property.
Source: arXiv (Cornell University)
Author: Rittaud, Benoît
Institution: Laboratoire Analyse, Géométrie et Applications
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7163350586
Cites:
Cited by:
Related to:
