English
Related papers

Related papers: Incomplete Generalized Fibonacci and Lucas Polynom…

200 papers

In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…

Number Theory · Mathematics 2021-07-14 M. J. Kronenburg

We give one parameter generalizations of the Fibonacci and Lucas numbers denoted by $\{F_n(\th)\}$ and $\{L_n(\th)\}$, respectively. We evaluate the Hankel determinants with entries $\{1/F_{j+k+1}(\th): 0\le i,j \le n\}$ and…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mourad E H Ismail

We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…

Number Theory · Mathematics 2014-12-11 David Goss

The moments of the Lucas polynomials and of the Chebyshev polynomials of the first kind are (multiples of) central binomial coefficients and the moments of the Fibonacci polynomials and of the Chebyshev polynomials of the second kind are…

Combinatorics · Mathematics 2013-12-11 Johann Cigler

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

Number Theory · Mathematics 2022-06-22 Sergiy Koshkin

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

Number Theory · Mathematics 2023-04-07 Martin Bunder , Joseph Tonien

We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is…

Number Theory · Mathematics 2021-12-22 Jeroen van de Graaf

Using elementary methods, we establish old and new relations between binomial coefficients, Fibonacci numbers, Lucas numbers, and more.

Number Theory · Mathematics 2023-10-17 Greg Dresden , Yike Li

In this paper, we give some determinantal and permanental representations of Generalized Fibonacci Polynomials by using various Hessenberg matrices. These results are general form of determinantal and permanental representations of k…

Number Theory · Mathematics 2011-11-18 Adem Sahin , Kenan Kaygisiz

The idea of orthogonal polynomials has been generalized in two ways to achieve new types of polynomials: noncommutative orthogonal polynomials and biorthogonal polynomials. This paper brings these two different generalizations together to…

Quantum Algebra · Mathematics 2011-05-03 Emily Sergel

We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…

Classical Analysis and ODEs · Mathematics 2023-08-17 Jing Gao , Arieh Iserles

A new recurrence relation for exceptional orthogonal polynomials is proposed, which holds for type 1, 2 and 3. As concrete examples, the recurrence relations are given for Xj-Hermite, Laguerre and Jacobi polynomials in j = 1,2 case.

Classical Analysis and ODEs · Mathematics 2015-06-23 Hiroshi Miki , Satoshi Tsujimoto

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

General Mathematics · Mathematics 2024-07-25 Alaa Altassan , Murat Alan

Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.

Discrete Mathematics · Computer Science 2007-05-23 Alex Vinokur

We establish new connection formulae between Fibonacci polynomials and Chebyshev polynomials of the first and second kinds. These formulae are expressed in terms of certain values of hypergeometric functions of the type 2F1. Consequently,…

Number Theory · Mathematics 2017-01-19 W. M. Abd-Elhameed , Y. H. Youssri , N. El-Sissi , M. Sadek

By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…

Combinatorics · Mathematics 2020-10-29 Oktay K. Pashaev , Merve Ozvatan

In this paper, we define Tribonacci and Tribonacci-Lucas matrix sequences with negative indices and investigate their properties.

Number Theory · Mathematics 2018-09-26 Yüksel Soykan

We introduce certain polynomials, so-called H.Weyl and H.Minkowski polynomials, which have a geometric origin. The location of roots of these polynomials is studied.

Complex Variables · Mathematics 2007-05-23 Victor Katsnelson

The generalized Lucas numbers are polynomials in two variables with nonnegative integer coefficients. Lucas versions of some combinatorial numbers with known formulas in terms of quotient and products of nonnegative integers have been…

Combinatorics · Mathematics 2023-01-13 José Agapito Ruiz

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri