SearcharxivSearch

arXiv · 1902.05944

Survey of Cubic Fibonacci Identities - When Cuboids Carry Weight

Abstract

The aim of this paper is to present a comprehensive survey of cubic Fibonacci identities, trying to uncover as many as possible. From the outset, our rationale for a very careful search on an apparently obscure problem was not only a matter of mathematical curiosity, but also motivated by a quest for 3D Fibonacci spirals. As we were not able to find any survey on the particular topic of cubic Fibonacci identities we decided to try to fill this void. We started by surveying many Fibonacci identities and recording cubic ones. Obviously, tracing all Fibonacci identities (for identifying a handful) is a daunting task. Checking several hundred we have realized that it is not always clear who the author is. The reason is that in many cases an identity was stated in one article (sometimes without a proof, e.g., as an open problem, or a conjecture) while later being proven in another article, or effectively rediscovered independently by other authors. However, we have done our best to present the identities chronologically. We have supplied our own proof for one identity, having tried, but failed, to find a published proof. For all the other identities, we either proved them on a computer, or else verified by hand their original published proofs. Somehow unexpectedly, our investigations have revealed only a rather small number of cubic Fibonacci identities, representing a tiny fraction of all published Fibonacci identities (most of which are linear or quadratic). Finally, out of these, only a handful of cubic Fibonacci identities are homogeneous.

Explore related subjects

Keep this discovery

BibTeXRIS

Mariana Nagy, Simon R. Cowell, Valeriu Beiu. 2019-02-15. Survey of Cubic Fibonacci Identities - When Cuboids Carry Weight. https://arxiv.org/abs/1902.05944

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO