Identically vanishing k-generalized Fibonacci polynomials
math.CO
Submitted: 2025-07-15
Updated: 2026-10-26
Comments: 35 pages, 6 tables, 3 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: The recurrence for the k-Fibonacci polynomials is usually iterated upwards to positive values of n only.
Terminology
Abstract
The recurrence for the k-Fibonacci polynomials is usually iterated upwards to positive values of n only. When the recurrence is iterated downwards to n<0, there are indices where the polynomials vanish identically. This fact does not seem to have been noted in the literature. We derive the set of such indices. We establish the connection of our results to the solution of the Skolem problem for the k-Fibonacci numbers. For k at least3 and n<0, we show that the degree of the polynomial does not increase monotonically with n. The so-called `left-justified k-nomial triangle' is extended to treat negative indices. We derive expressions for the individual polynomial coefficients (the elementary symmetric polynomials of the roots). We present results for the properties of the polynomials, for both n>0 and n<0, including factorization of the polynomials and properties of the roots. Results are also derived for real roots. We present new, tighter, bounds on the amplitudes of the nonzero roots. We derive new combinatorial sums for the polynomial coefficients, which are more concise and computationally efficient than previously published expressions.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality