Combinatorial Identities for Incomplete Tribonacci Polynomials

Abstract

The incomplete tribonacci polynomials, denoted by Tn(s)(x), generalize the usual tribonacci polynomials Tn(x) and were introduced in [10], where several algebraic identities were shown. In this paper, we provide a combinatorial interpretation for Tn(s)(x) in terms of weighted linear tilings involving three types of tiles. This allows one not only to supply combinatorial proofs of the identities for Tn(s)(x) appearing in [10] but also to derive additional identities. In the final section, we provide a formula for the ordinary generating function of the sequence Tn(s)(x) for a fixed s, which was requested in [10]. Our derivation is combinatorial in nature and makes use of an identity relating Tn(s)(x) to Tn(x).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…