Elliptic and -Analogs of the Fibonomial Numbers
arXiv:1911.12785 · doi:10.3842/SIGMA.2020.076
Abstract
In 2009, Sagan and Savage introduced a combinatorial model for the Fibonomial numbers, integer numbers that are obtained from the binomial coefficients by replacing each term by its corresponding Fibonacci number. In this paper, we present a combinatorial description for the -analog and elliptic analog of the Fibonomial numbers. This is achieved by introducing some -weights and elliptic weights to a slight modification of the combinatorial model of Sagan and Savage.
References in corpus (9)
- Toric braids and -parking functions
- Lecture notes on Cherednik algebras
- Elliptic enumeration of nonintersecting lattice paths
- A noncommutative weight-dependent generalization of the binomial theorem
- Weight-dependent commutation relations and combinatorial identities
- Combinatorial interpretations of binomial coefficient analogues related to Lucas sequences
- The fractal nature of the Fibonomial triangle
- Rectangular Schroder Parking Functions Combinatorics
- Lucas atoms