Combinatorial interpretations of binomial coefficient analogues related to Lucas sequences

Abstract

Let s and t be variables. Define polynomials n in s, t by 0=0, 1=1, and n=sn-1+tn-2 for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial coefficients by Cn,k=n!/(k!n-k!) where n!=12...n. It is easy to see that Cn,k is a polynomial in s and t. The purpose of this note is to give two combinatorial interpretations for this polynomial in terms of statistics on integer partitions inside a k by n-k rectangle. When s=t=1 we obtain combinatorial interpretations of the fibonomial coefficients which are simpler than any that have previously appeared in the literature.

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…