Abstract

Lucas polynomials are polynomials in s1s_1 and s2s_2 defined recursively by {0}=0\{0\}=0, {1}=1\{1\}=1, and {m}=s1{m−1}+s2{m−2}\{m\}=s_1\{m-1\}+s_2\{m-2\} for m≥2m \geq 2. We generalize Lucas polynomials from 2-variable polynomials to multivariable polynomials. This is done by first defining rr-Lucas polynomials {m}r\{m\}_r in the variables s1s_1, srs_r, and s2rs_{2r}. We show that the binomial analogues of the rr-Lucas polynomials are polynomial and give a combinatorial interpretation for them. We then extend the generalization of Lucas polynomials to an arbitrarily large set of variables. Recursively defined generating functions are given for these multivariable Lucas polynomials. We conclude by giving additional applications and insights.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.