Multivariate Fibonacci-like Polynomials and their Applications
Combinatorics
2023-09-18 v1
Abstract
The Fibonacci polynomials are defined recursively as , where and . We generalize these polynomials to an arbitrary number of variables with the -Fibonacci polynomial. We extend several well-known results such as the explicit Binet formula and a Cassini-like identity, and use these to prove that the -Fibonacci polynomials are irreducible over for . Additionally, we derive an explicit sum formula and a generalized generating function. Using these results, we establish connections to ordinary Bell polynomials, exponential Bell polynomials, Fubini numbers, and integer and set partitions.
Keywords
Cite
@article{arxiv.2309.08123,
title = {Multivariate Fibonacci-like Polynomials and their Applications},
author = {Sejin Park and Etienne Phillips and Peikai Qi and Ilir Ziba and Zhan Zhan},
journal= {arXiv preprint arXiv:2309.08123},
year = {2023}
}
Comments
15 pages. Written and edited by Sejin Park, Etienne Phillips, Ilir Ziba, and Zhan Zhan