Explores Fibonacci and Lucas polynomials via context-free grammars, suggesting new mathematical insights.
We introduce the context-free grammars \[\{a→ xa+b \ ; \ b → a\},\ \{a→ -xa+b \ ; \ b → a\} and \{a→ xa+by\ ; \ b→ a\}\] to generate Fibonacci and Lucas polynomials, Fibonacci and Lucas polynomials with negative indices, and bivariate Fibonacci and Lucas polynomials through the formal derivative operator defined with respect to these context-free grammars, respectively. In addition, we prove the m-term Honsberger-type identities for Fibonacci and Lucas polynomials by grammatical methods.
No takes yet. Share an insight, caveat, or question.
Juan Triana (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: