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

Digital Commons Network

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

Mathematics

PDF

Claremont Colleges

Theses/Dissertations

2016

Combinatorics

Articles 1 - 1 of 1

Full-Text Articles in Entire DC Network

Fibonomial Tilings And Other Up-Down Tilings, Robert Bennett Jan 2016

Fibonomial Tilings And Other Up-Down Tilings, Robert Bennett

HMC Senior Theses

The Fibonomial coefficients are a generalization of the binomial coefficients with a rather nice combinatorial interpretation. While the ordinary binomial coefficients count lattice paths in a grid, the Fibonomial coefficients count the number of ways to draw a lattice path in a grid and then Fibonacci-tile the regions above and below the path in a particular way. We may forgo a literal tiling interpretation and, instead of the Fibonacci numbers, use an arbitrary function to count the number of ways to "tile" the regions of the grid delineated by the lattice path. When the function is a combinatorial sequence such …