加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本