Results 111 to 120 of about 916 (205)
Combined Pseudo-Random Sequence Generator for Cybersecurity. [PDF]
Maksymovych V +5 more
europepmc +1 more source
Simulating accurate and effective solutions of some nonlinear nonlocal two-point BVPs: Clique and QLM-clique matrix methods. [PDF]
Izadi M, Singh J, Noeiaghdam S.
europepmc +1 more source
Optimization of Additive Fibonacci Generators Based on Primitive Polynomials Over GF(p)
This paper presents an approach to the modification of the additive Fibonacci generator by implementing it based on primitive polynomials over the field GF(p).
Pawel Sawicki +7 more
doaj +1 more source
GENERALIZATION OF FIBONACCI POLYNOMIALS
Fibonacci polynomials are special cases of Chebyshev polynomials and have been studied on a more advanced level by many mathematicians. Fibonacci polynomials are defined by fn+1=xfn(x)+fn-1(x), n>=1 with f0(x)=0, f1(x)=1. The Fibonacci polynomials are of great importance in the study of many subjects, such as algebra, geometry, and number theory ...
OMPRAKASH SIKHWAL, DEVANSHI SIKHWAL
openaire +1 more source
A note on h(x)-Fibonacci Octonion Polynomials [PDF]
WOS: 000438888700013In this paper, we consider h(x)-Fibonacci octonion polynomials which is defined by h(x)-Fibonacci octonion polynomials. We derive algebraic identities involving h(x)-Fibonacci octonion polynomials.
Özkoç, Arzu
core
The bi-periodic Horadam sequence and some perturbed tridiagonal 2-Toeplitz matrices: A unified approach. [PDF]
Anđelić M, da Fonseca CM, Yılmaz F.
europepmc +1 more source
Random Fibonacci Words via Clone Schur Functions
We investigate positivity and probabilistic properties arising from the Young–Fibonacci lattice $\mathbb {YF}$ , a 1-differential poset on words composed of 1’s and 2’s (Fibonacci words) and graded by the sum of the digits.
Leonid Petrov, Jeanne Scott
doaj +1 more source
Extended Wang sum and associated products. [PDF]
Reynolds R, Stauffer A.
europepmc +1 more source
DOI:10.2298/FIL0903291D GENERALIZATIONS OF THE FIBONACCI AND LUCAS POLYNOMIALS [PDF]
In this note we consider two sequences of polynomials, which are denoted by {U (k) n,m} and {V (k) n,m}, where k, m, n are nonnegative integers, and m ≥ 2. These sequences represent generalizations of the well-known Fibonacci and Lucas polynomials.
Gospava B. Djordjević
core
Generalized Pauli Fibonacci Polynomial Quaternions
Since Hamilton proposed quaternions as a system of numbers that does not satisfy the ordinary commutative rule of multiplication, quaternion algebras have played an important role in many mathematical and physical studies. This paper introduces the generalized notion of Pauli Fibonacci polynomial quaternions, a definition that incorporates the ...
Bahadir Yilmaz +2 more
openaire +2 more sources

