English

Multivariate Fibonacci-like Polynomials and their Applications

Combinatorics 2023-09-18 v1

Abstract

The Fibonacci polynomials are defined recursively as fn(x)=xfn1(x)+fn2(x)f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x), where f0(x)=0f_0(x) = 0 and f1(x)=1f_1(x)= 1. We generalize these polynomials to an arbitrary number of variables with the rr-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 rr-Fibonacci polynomials are irreducible over C\mathbb{C} for nr3n \geq r \geq 3. 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

R2 v1 2026-06-28T12:22:14.410Z