Results 11 to 20 of about 228 (148)
In this paper, we define and study the bivariate complex Fibonacci and Lucas polynomials. We introduce a operator in order to derive some new symmetric properties of bivariate complex Fibonacci and bivariate complex Lucas polynomials, and give the ...
Boughaba Souhila +2 more
doaj +1 more source
Cube Polynomial of Fibonacci and Lucas Cubes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klavžar, Sandi, Mollard, Michel
openaire +2 more sources
On New Polynomial Sequences Constructed to Each Vertex in an n-Gon
In this work, we bring to light the properties of newly formed polynomial sequences at each vertex of Pell polynomial sequences placed clockwise at each vertex in the n-gon. We compute the relation among the polynomials with such vertices.
Abdul Hamid Ganie +3 more
doaj +1 more source
Symmetric and generating functions of generalized (p,q)-numbers
In this paper, we first define new generalization for (p,q)-numbers. Considering these sequence, we give Binet's formulas and generating functions of (p,q)-Fibonacci numbers, (p,q)-Lucas numbers, (p,q)-Pell numbers, (p,q)-Pell Lucas numbers, (p,q ...
Nabiha Saba +2 more
doaj +1 more source
Melham's sums for some Lucas polynomial sequences [PDF]
A Lucas polynomial sequence is a pair of generalized polynomial sequences that satisfy the Lucas recurrence relation. Special cases include Fibonacci polynomials, Lucas polynomials, and Balancing polynomials.
Chan-Liang Chung, Chunmei Zhong
doaj +1 more source
A generalization of Lucas polynomial sequence
The authors consider the problem of a generalization of Lucas polynomial sequence. They obtain a generalized Lucas polynomial sequence from the lattice paths for the Delannoy numbers by allowing weights on the steps \((1,0),(0,1)\) and \((1,1)\).
Gi-Sang Cheon +2 more
openaire +2 more sources
On generalized Lucas polynomials and Euler numbers [PDF]
In this paper we study the relationship between the generalized Lucas polynomials and the Euler numbers and give several interesting identities involving them.
Nalli, Ayse, Zhang, Tianping
openaire +2 more sources
Polynomial representations of the Lucas logarithm
The authors provide results that are of interest for cryptosystems depending on the discrete logarithm problem. They look at the intractability of the so-called Lucas problem, which turns out to be computationally equivalent to the discrete logarithm problem over finite fields \(\mathbb F_{p^2}\). Moreover, they provide precise formulas for polynomials
Hassan Aly, Arne Winterhof
openaire +2 more sources
Some remarks regarding the $(p,q)-$Fibonacci and Lucas octonion polynomials
We investigate the $(p,q)-$Fibonacci and Lucas octonion polynomials. The main purpose of this paper is using of some properties of the $(p,q)-$ Fibonacci and Lucas polynomials. Also for present some results involving these octonion polynomials, we obtain
Arzu Özkoç Öztürk, Ayhan Porsuk
doaj +1 more source
BıGaussian Pell and Pell-Lucas polynomials
In this paper, we define biGaussian Pell and Pell-Lucas Polynomials. We give Binet‘s formulas, generating functions, Catalan’s identities, Cassini’s identities for these polynomials. Matrix presentations of biGaussian Pell and Pell-Lucas polynomials are found. Also, NegabiGaussian Pell and Pell-Lucas Polynomials are defined.
Özkan, E., Alp, T.
openaire +2 more sources

