Papers
Topics
Authors
Recent
Search
2000 character limit reached

Robbins and Ardila meet Berstel

Published 29 Jul 2020 in math.CO, cs.DM, cs.FL, and math.NT | (2007.14930v2)

Abstract: In 1996, Neville Robbins proved the amazing fact that the coefficient of $Xn$ in the Fibonacci infinite product $$ \prod_{n \geq 2} (1-X{F_n}) = (1-X)(1-X2)(1-X3)(1-X5)(1-X8) \cdots = 1-X-X2+X4 + \cdots$$ is always either $-1$, $0$, or $1$. The same result was proved later by Federico Ardila using a different method. Meanwhile, in 2001, Jean Berstel gave a simple 4-state transducer that converts an "illegal" Fibonacci representation into a "legal" one. We show how to obtain the Robbins-Ardila result from Berstel's with almost no work at all, using purely computational techniques that can be performed by existing software.

Citations (5)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.