Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

A combinatorial proof of a result on generalized Lucas polynomials

Laugier, Alexandre and Saikia, Manjil P. 2016. A combinatorial proof of a result on generalized Lucas polynomials. Demonstratio Mathematica 49 (3) , pp. 266-270. 10.1515/dema-2016-0022

[img] PDF - Published Version
Available under License Creative Commons Attribution.

Download (400kB)


We give a combinatorial proof of an elementary property of generalized Lucas polynomials, inspired by [1]. These polynomials in s and t are defined by the recurrence relation 〈n〉 = s〈n-1〉+t〈n-2〉 for n ≥ 2. The initial values are 〈0〉 = 2; 〈1〉= s, respectively.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
ISSN: 2391-4661
Date of First Compliant Deposit: 9 March 2020
Last Modified: 09 Mar 2020 10:45

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics