Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
116 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
24 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
35 tokens/sec
2000 character limit reached

Robbins and Ardila meet Berstel (2007.14930v2)

Published 29 Jul 2020 in math.CO, cs.DM, cs.FL, and math.NT

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)