Papers
Topics
Authors
Recent
2000 character limit reached

Statistical Distributions and $q$-Analogues of $k$-Fibonacci Numbers (1207.3266v1)

Published 13 Jul 2012 in math.CO

Abstract: We study $q$-analogues of $k$-Fibonacci numbers that arise from weighted tilings of an $n\times1$ board with tiles of length at most $k$. The weights on our tilings arise naturally out of distributions of permutations statistics and set partitions statistics. We use these $q$-analogues to produce $q$-analogues of identities involving $k$-Fibonacci numbers. This is a natural extension of results of the first author and Sagan on set partitions and the first author and Mathisen on permutations. In this paper we give general $q$-analogues of $k$-Fibonacci identities for arbitrary weights that depend only on lengths and locations of tiles. We then determine weights for specific permutation or set partition statistics and use these specific weights and the general identities to produce specific identities.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.