Open Access. Powered by Scholars. Published by Universities.®

Discrete Mathematics and Combinatorics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Discrete Mathematics and Combinatorics

An Exploration Of Combinatorial Interpretations For Fibonomial Coefficients, Richard Shapley Jan 2020

An Exploration Of Combinatorial Interpretations For Fibonomial Coefficients, Richard Shapley

HMC Senior Theses

We can define Fibonomial coefficients as an analogue to binomial coefficients as F(n,k) = FnFn-1 … F­n-k+1 / F­kFk-­1…F1, where Fn represents the nth Fibonacci number. Like binomial coefficients, there are many identities for Fibonomial coefficients that have been proven algebraically. However, most of these identities have eluded combinatorial proofs.

Sagan and Savage (2010) first presented a combinatorial interpretation for these Fibonomial coefficients. More recently, Bennett et al. (2018) provided yet another interpretation, that is perhaps more tractable. However, there still has been little progress towards using these interpretations …


Tiling Proofs Of Recent Sum Identities Involving Pell Numbers, Arthur T. Benjamin, Sean S. Plott '08, James A. Sellers Oct 2008

Tiling Proofs Of Recent Sum Identities Involving Pell Numbers, Arthur T. Benjamin, Sean S. Plott '08, James A. Sellers

All HMC Faculty Publications and Research

In a recent note, Santana and Diaz-Barrero proved a number of sum identities involving the well-known Pell numbers. Their proofs relied heavily on the Binet formula for the Pell numbers. Our goal in this note is to reconsider these identities from a purely combinatorial viewpoint. We provide bijective proofs for each of the results by interpreting the Pell numbers as enumerators of certain types of tilings. In turn, our proofs provide helpful insight for straightforward generalizations of a number of the identities.


A Combinatorial Proof Of Vandermonde's Determinant, Arthur T. Benjamin, Gregory P. Dresden Apr 2007

A Combinatorial Proof Of Vandermonde's Determinant, Arthur T. Benjamin, Gregory P. Dresden

All HMC Faculty Publications and Research

No abstract provided in this article.


Combinatorial Proofs Of Fermat's, Lucas's, And Wilson's Theorems, Peter G. Anderson, Arthur T. Benjamin, Jeremy A. Rouse Mar 2005

Combinatorial Proofs Of Fermat's, Lucas's, And Wilson's Theorems, Peter G. Anderson, Arthur T. Benjamin, Jeremy A. Rouse

All HMC Faculty Publications and Research

No abstract provided in this article.


The Fibonacci Numbers -- Exposed More Discretely, Arthur T. Benjamin, Jennifer J. Quinn Jun 2003

The Fibonacci Numbers -- Exposed More Discretely, Arthur T. Benjamin, Jennifer J. Quinn

All HMC Faculty Publications and Research

No abstract provided in this article.


Random Approaches To Fibonacci Identities, Arthur T. Benjamin, Gregory M. Levin, Karl Mahlburg '01, Jennifer J. Quinn Jun 2000

Random Approaches To Fibonacci Identities, Arthur T. Benjamin, Gregory M. Levin, Karl Mahlburg '01, Jennifer J. Quinn

All HMC Faculty Publications and Research

No abstract provided in this article.


Recounting Fibonacci And Lucas Identities, Arthur T. Benjamin, Jennifer J. Quinn Nov 1999

Recounting Fibonacci And Lucas Identities, Arthur T. Benjamin, Jennifer J. Quinn

All HMC Faculty Publications and Research

No abstract provided in this article.