ANTI-RECURRENCE SEQUENCES
Robbert Fokkink (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Gandhar Joshi (Open University)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We extend the work of Kimberling and Moses, Zaslavsky, and Bosma et al. on anti-recurrence sequences. Kimberling and Moses formulated several questions about these sequences, which together suggest the meta-conjecture that every anti-recurrence sequence is the sum of a linear progression and an automatic sequence. We solve this conjecture under a restriction on the linear form that generates the anti-recurrence.