On Special Spacelike Hybrid Numbers

Abstract

Hybrid numbers are generalizations of complex, hyperbolic and dual numbers. A hyperbolic complex structure is frequently used in both pure mathematics and numerous areas of physics. In this paper we introduce a special kind of spacelike hybrid number, namely the $F(p,n)$-Fibonacci hybrid numbers and we give some of their properties.

1. Definitions and Preliminary Results

In [1] Özdemir introduced hybrid numbers as a new type of numbers which generalize complex, hyperbolic and dual numbers. We recall this definition.

Let $\mathbb{K}$ be the set of hybrid numbers $\mathbf{Z}$ of the form

$$\mathbf{Z}=a+b\mathbf{i}+c\epsilon +d\mathbf{h},$$

where $a,b,c,d\in \mathbb{R}$ and $\mathbf{i},$ $\epsilon ,$ $\mathbf{h}$ are operators for which

$${\mathbf{i}}^2=-1,{\epsilon }^2=0,{\mathbf{h}}^2=1$$

(1)

and

$$\mathbf{i}\mathbf{h}=-\mathbf{h}\mathbf{i}=\epsilon +\mathbf{i}.$$

(2)

Let ${\mathbf{Z}}_1=a_1+b_1\mathbf{i}+c_1\epsilon +d_1\mathbf{h}$ and ${\mathbf{Z}}_2=a_2+b_2\mathbf{i}+c_2\epsilon +d_2\mathbf{h}$ be arbitrary hybrid numbers. Then we define equality, addition, subtraction and multiplication by scalar $s\in \mathbb{R}$ in the following way:

• ${\mathbf{Z}}_1={\mathbf{Z}}_2$ if and only if $a_1=a_2,$ $b_1=b_2,$ $c_1=c_2,$ $d_1=d_2,$
• ${\mathbf{Z}}_1\pm {\mathbf{Z}}_2=(a_1\pm a_2)+(b_1\pm b_2)\mathbf{i}+(c_1\pm c_2)\epsilon +(d_1\pm d_2)\mathbf{h},$
• $s{\mathbf{Z}}_1=s{a}_1+s{b}_1\mathbf{i}+s{c}_1\epsilon +s{d}_1\mathbf{h}.$

Using equalities (1) and (2) we define the hybrid numbers multiplication. Moreover, by (1) and (2) we can find the product of any two hybrid units as presented in Table 1.

Table 1. The hybrid number multiplication.

·	i	$\mathit{\epsilon }$	h
$\mathbf{i}$	$-1$	$1-\mathbf{h}$	$\epsilon +\mathbf{i}$
$\epsilon$	$\mathbf{h}+1$	0	$-\epsilon$
$\mathbf{h}$	$-\epsilon -\mathbf{i}$	$\epsilon$	1

Rules given in Table 1. are helpful for the multiplication of hybrid numbers and it can be made analogously as multiplications of algebraic expressions.

The conjugate of a hybrid number $\mathbf{Z}$ is the hybrid number

$$\overline{\mathbf{Z}}=\overline{a+b\mathbf{i}+c\epsilon +d\mathbf{h}}=a-b\mathbf{i}-c\epsilon -d\mathbf{h}.$$

The real number

$$C\left(\mathbf{Z}\right)=\mathbf{Z}\overline{\mathbf{Z}}=\overline{\mathbf{Z}}\mathbf{Z}=a^2+{(b-c)}^2-c^2-d^2=a^2+b^2-2bc-d^2$$

is named as the character of the hybrid number $\mathbf{Z}.$

Hybrid numbers are classified as spacelike, timelike and lightlike according to its character. We say that a hybrid number $\mathbf{Z}$ is spacelike, timelike or lightlike if $C\left(\mathbf{Z}\right)<0$, $C\left(\mathbf{Z}\right)>0$ or $C\left(\mathbf{Z}\right)=0$, respectively.

For the basics on hybrid number theory and also algebraic and geometric properties of hybrid numbers, see [1].

Hybrid numbers generalize complex, hyperbolic and dual numbers. Hyperbolic complex structure have many applications also in physics, see for example [2,3]. Hybrid numbers can be connected with the well-known numbers belonging to the family of Fibonacci type numbers.

We recall that the nth Fibonacci number $F_n$ is defined recursively by $F_n=F_{n-1}+F_{n-2}$ for $n\ge 2$ with $F_0=F_1=1.$ Note that Fibonacci sequence $\left\{F_n\right\}$ starts also from $F_0=0,$ $F_1=1$ but in this paper we put $F_0=F_1=1.$ The nth Lucas number $L_n$ is defined recursively by $L_n=L_{n-1}+L_{n-2}$ for $n\ge 2$ with $L_0=2,$ $L_1=1.$

Besides the usual Fibonacci and Lucas numbers many kinds of generalizations of these numbers have been presented in the literature. These generalizations are given by the pth order linear recurrence relations, see for their list [4]. Among many generalizations Kwaśnik and Włoch [5] generalized Fibonacci and Lucas numbers in the context of their interpretations in graph theory.

Let $p\ge 2,$ $n\ge 0$ be integers. Generalized Fibonacci numbers $F(p,n)$ were defined as follows

$$\begin{array}{cc}\hfill & F(p,n)=n+1,\mathrm{for}n=0,1,\dots ,p-1\hfill \\ \hfill & F(p,n)=F(p,n-1)+F(p,n-p),\mathrm{for}n\ge p.\hfill \end{array}$$

For their graphs applications the sequence $\left\{F\right(p,n\left)\right\}$ starts from $F(p,0)=1.$

Based on the definition of $F(p,n)$ generalized Lucas numbers $L(p,n)$ were defined as follows

$$\begin{array}{cc}\hfill & L(p,n)=n+1,\mathrm{for}n=0,1,\dots ,2p-1\hfill \\ \hfill & L(p,n)=L(p,n-1)+L(p,n-p),\mathrm{for}n\ge 2p.\hfill \end{array}$$

The same recurrence relations were introduced by Stakhov as “Fibonacci and Lucas p-numbers”, see [6].

Note that for $n\ge 0$ we have that $F(2,n)=F_{n+1}$ and for $n\ge 2$ holds $L(2,n)=L_n.$ Moreover, $F(3,n)=u_{n+2},$ where $u_n$ is the well-known nth Fibonacci–Narayana number defined as follows $u_0=u_1=u_2=1$ and $u_n=u_{n-1}+u_{n-3}$ for $n\ge 3,$ see for details in [7].

Numbers $F(p,n)$ and $L(p,n)$ were investigated in many papers with respect to their combinatorial and algebraic properties, see for example [8,9,10,11,12,13,14,15]. Fibonacci polynomials can be used as special generalization of Fibonacci numbers, and they are studied in the context of their roots, power series, matrix generators and also connections with Chebyshev polynomials, more details can be found in [16,17,18,19].

Fibonacci numbers have applications in studying topological indices (Hosoya index and Marrifield-Simmons index) related to variety of physicochemical properties of alkanes, for example their boiling points. These structure descriptors are used in the theory of conjugated $\pi$-electron systems of molecular-graphs, see [20].

For these reasons Fibonacci numbers and their generalizations are intensively studied both from the pure mathematical point of view and their applications. A new generalization of Fibonacci and Lucas hybrid numbers were presented quite recently in [21]. Another generalization of Fibonacci and Lucas hybrid numbers are the Fibonacci and Lucas hybrinomials, see [22].

Table 2 presents initial terms of generalized Fibonacci numbers and generalized Lucas numbers for special cases of n and p.

Table 2. The values of $F(p,n),$ $L(p,n),$ $F_n,$ $u_n$ and $L_n.$

n	0	1	2	3	4	5	6	7	8	9	10
$F_n$	1	1	2	3	5	8	13	21	34	55	89
$F(2,n)$	1	2	3	5	8	13	21	34	55	89	144
$u_n$	1	1	1	2	3	4	6	9	13	19	28
$F(3,n)$	1	2	3	4	6	9	13	19	28	41	60
$F(4,n)$	1	2	3	4	5	7	10	14	19	26	36
$F(5,n)$	1	2	3	4	5	6	8	11	15	20	26
$L_n$	2	1	3	4	7	11	18	29	47	76	123
$L(2,n)$	1	2	3	4	7	11	18	29	47	76	123
$L(3,n)$	1	2	3	4	5	6	10	15	21	31	46
$L(4,n)$	1	2	3	4	5	6	7	8	13	19	26

For $F(p,n)$ and $L(p,n)$ some identities were given for example in [11,13]. We recall some of them.

Theorem 1

([13]). Let $p\ge 2$ be integer. Then for $n\ge p+1$

$$\sum _{l=0}^{n-p}F(p,l)=F(p,n)-p.$$

(3)

Theorem 2

([13]). Let $p\ge 2,$ $n\ge p$ be integers. Then

$$\sum _{l=1}^{n}F(p,lp-1)+1=F(p,np).$$

(4)

Theorem 3

([11]). Let $p\ge 2,$ $n\ge p$ be integers. Then

$$\sum _{l=1}^{n}F(p,lp)=F(p,np+1)-F(p,1),$$

(5)

$$\sum _{l=1}^{n}F(p,lp+1)=F(p,np+2)-F(p,2),$$

(6)

$$\sum _{l=1}^{n}F(p,lp+2)=F(p,np+3)-F(p,3).$$

(7)

Theorem 4

([13]). Let $p\ge 2,$ $n\ge 2p-2$ be integers. Then

$$F(p,n)=\sum _{l=0}^{p-1}F(p,n-(p-1)-l).$$

(8)

Theorem 5

([13]). Let $p\ge 2,$ $n\ge 2p$ be integers. Then

$$\sum _{l=2}^{n}L(p,pl)=L(p,np+1)-(p+2).$$

(9)

Theorem 6

([11]). Let $p\ge 2,$ $n\ge 2p$ be integers. Then

$$\sum _{l=2}^{n}L(p,pl+1)=L(p,np+2)-L(p,p+2).$$

(10)

$$\sum _{l=2}^{n}L(p,pl+2)=L(p,np+3)-L(p,p+3).$$

(11)

$$\sum _{l=2}^{n}L(p,pl+3)=L(p,np+4)-L(p,p+4).$$

(12)

Theorem 7

([13]). Let $p\ge 2,$ $n\ge 2p$ be integers. Then

$$L(p,n)=pF(p,n-(2p-1\left)\right)+F(p,n-p).$$

(13)

In spite of generalized Fibonacci numbers $F(p,n)$ and generalized Lucas numbers $L(p,n)$ have been studied, mainly with respect to their graph and combinatorial properties, they found applications also in the theory of quaternions [11] and bicomplex numbers [8]. In this paper we introduce and study $F(p,n)$-Fibonacci hybrid numbers and we describe their distinct properties.

2. $\mathit{F}(\mathit{p},\mathit{n})$-Fibonacci Hybrid Numbers

Let $n\ge 0,$ $p\ge 2$ be integers. The nth $F(p,n)$-Fibonacci hybrid number $F{H}_n^p$ and the nth $L(p,n)$-Lucas hybrid number $L{H}_n^p$ are defined as

$$\begin{array}{cc}\hfill F{H}_n^p& =F(p,n)+F(p,n+1)\mathbf{i}+F(p,n+2)\epsilon +F(p,n+3)\mathbf{h},\hfill \end{array}$$

(14)

$$\begin{array}{cc}\hfill L{H}_n^p& =L(p,n)+L(p,n+1)\mathbf{i}+L(p,n+2)\epsilon +L(p,n+3)\mathbf{h},\hfill \end{array}$$

(15)

respectively.

For $p=2$ we obtain $F{H}_n^2=F{H}_{n+2}$ and $L{H}_n^2=L{H}_n,$ where $F{H}_n$ and $L{H}_n$ denote the nth Fibonacci hybrid number and the nth Lucas hybrid number, respectively (see [23]).

Defining the nth Fibonacci–Narayana hybrid number $u{H}_n$ as

$$u{H}_n=u_n+u_{n+1}\mathbf{i}+u_{n+2}\epsilon +u_{n+3}\mathbf{h}$$

we have that $F{H}_n^3=u{H}_{n+2}.$

Theorem 8.

Let $p\ge 2$ be integer. Then for $n\ge p+1$

$$\begin{array}{cc}\hfill \sum _{l=0}^{n-p}F{H}_l^p& =F{H}_n^p-p-\left(p+F(p,0)\right)\mathbf{i}-\left(p+F(p,0)+F(p,1)\right)\epsilon +\hfill \\ \hfill & -\left(p+F(p,0)+F(p,1)+F(p,2)\right)\mathbf{h}.\hfill \end{array}$$

Proof. 

Using (3) and (14) we have

$$\begin{array}{cc}\hfill & \sum _{l=0}^{n-p}F{H}_l^p=F{H}_0^p+F{H}_1^p+\cdots +F{H}_{n-p}^p\hfill \\ \hfill & =F(p,0)+F(p,1)\mathbf{i}+F(p,2)\epsilon +F(p,3)\mathbf{h}\hfill \\ \hfill & +F(p,1)+F(p,2)\mathbf{i}+F(p,3)\epsilon +F(p,4)\mathbf{h}+\cdots \hfill \\ \hfill & +F(p,n-p)+F(p,n-p+1)\mathbf{i}+F(p,n-p+2)\epsilon +F(p,n-p+3)\mathbf{h}\hfill \\ \hfill & =F(p,0)+F(p,1)+\cdots +F(p,n-p)\hfill \\ \hfill & +\left(F(p,1)+\cdots +F(p,n-p+1)+F(p,0)-F(p,0)\right)\mathbf{i}\hfill \\ \hfill & +\left(F(p,2)+\cdots +F(p,n-p+2)+F(p,0)+F(p,1)-F(p,0)-F(p,1)\right)\epsilon \hfill \\ \hfill & +\left(F(p,3)+\cdots +F(p,n-p+3)+F(p,0)+F(p,1)+F(p,2)\right.\hfill \\ \hfill & \left.-F(p,0)-F(p,1)-F(p,2)\right)\mathbf{h}\hfill \\ \hfill & =F(p,n)-p+\left(F(p,n+1)-p-F(p,0)\right)\mathbf{i}\hfill \\ \hfill & +\left(F(p,n+2)-p-F(p,0)-F(p,1)\right)\epsilon \hfill \\ \hfill & +(\left(F(p,n+3)-p-F(p,0)-F(p,1)-F(p,2)\right)\mathbf{h}\hfill \\ \hfill & =F{H}_n^p-p-\left(p+F(p,0)\right)\mathbf{i}-\left(p+F(p,0)+F(p,1)\right)\epsilon \hfill \\ \hfill & -\left(p+F(p,0)+F(p,1)+F(p,2)\right)\mathbf{h},\hfill \end{array}$$

which ends the proof. □

Remark 1.

If $p=2$ then we have

$$\begin{array}{cc}\hfill \sum _{l=0}^{n-2}F{H}_l^2& =F{H}_n^2-2-\left(2+F(2,0)\right)\mathbf{i}-\left(2+F(2,0)+F(2,1)\right)\epsilon \hfill \\ \hfill & -\left(2+F(2,0)+F(2,1)+F(2,2)\right)\mathbf{h}\hfill \\ \hfill & =F{H}_n^2-\left(2+3\mathbf{i}+5\epsilon +8\mathbf{h}\right)\hfill \\ \hfill & =F{H}_n^2-F{H}_1^2.\hfill \end{array}$$

On the other hand $F{H}_n^2=F{H}_{n+2}$, so

$$\begin{array}{cc}\hfill \sum _{l=0}^{n}F{H}_l& =F{H}_0+F{H}_1+\cdots +F{H}_n\hfill \\ \hfill & =F{H}_0+F{H}_1+F{H}_0^2+F{H}_1^2+\cdots +F{H}_{n-2}^2\hfill \\ \hfill & =F{H}_0+F{H}_1+F{H}_n^2-F{H}_1^2\hfill \\ \hfill & =F{H}_0+F{H}_1+F{H}_{n+2}-F{H}_3\hfill \\ \hfill & =F{H}_0+F{H}_1+F{H}_{n+2}-(F{H}_2+F{H}_1)\hfill \\ \hfill & =F{H}_0+F{H}_{n+2}-F{H}_2\hfill \\ \hfill & =F{H}_0+F{H}_{n+2}-(F{H}_1+F{H}_0)\hfill \\ \hfill & =F{H}_{n+2}-F{H}_1\hfill \end{array}$$

and we obtain the known equality for the Fibonacci hybrid numbers $F{H}_n$ (see [23])

$$\begin{array}{c}\hfill \sum _{l=0}^{n}F{H}_l=F{H}_{n+2}-F{H}_1.\end{array}$$

Remark 2.

If $p=3$ then we have

$$\begin{array}{cc}\hfill \sum _{l=0}^{n-3}F{H}_l^3& =F{H}_n^3-3-\left(3+F(3,0)\right)\mathbf{i}-\left(3+F(3,0)+F(3,1)\right)\epsilon \hfill \\ \hfill & -\left(3+F(3,0)+F(3,1)+F(3,2)\right)\mathbf{h}\hfill \\ \hfill & =F{H}_n^3-\left(3+4\mathbf{i}+6\epsilon +9\mathbf{h}\right)\hfill \\ \hfill & =F{H}_n^3-F{H}_2^3.\hfill \end{array}$$

On the other hand $F{H}_n^3=u{H}_{n+2}$, so

$$\begin{array}{cc}\hfill \sum _{l=0}^{n-1}u{H}_l& =u{H}_0+u{H}_1+\cdots +u{H}_{n-1}\hfill \\ \hfill & =u{H}_0+u{H}_1+F{H}_0^3+F{H}_1^3+\cdots +F{H}_{n-3}^3\hfill \\ \hfill & =u{H}_0+u{H}_1+F{H}_n^3-F{H}_2^3\hfill \\ \hfill & =u{H}_0+u{H}_1+u{H}_{n+2}-u{H}_4\hfill \\ \hfill & =u{H}_0+u{H}_1+u{H}_{n+2}-(u{H}_3+u{H}_1)\hfill \\ \hfill & =u{H}_0+u{H}_{n+2}-u{H}_3\hfill \\ \hfill & =u{H}_0+u{H}_{n+2}-(u{H}_2+u{H}_0)\hfill \\ \hfill & =u{H}_{n+2}-u{H}_2\hfill \end{array}$$

and we obtain the equality for the Fibonacci–Narayana hybrid numbers $u{H}_n$

$$\begin{array}{c}\hfill \sum _{l=0}^{n}u{H}_l=u{H}_{n+3}-u{H}_2.\end{array}$$

Theorem 9.

Let $p\ge 2,$ $n\ge p$ be integers. Then

$$\begin{array}{c}\hfill \sum _{l=1}^{n}F{H}_{lp-1}^p=F{H}_{np}^p-\left(F(p,0)+F(p,1)\mathbf{i}+F(p,2)\epsilon +F(p,3)\mathbf{h}\right).\end{array}$$

(16)

Proof. 

Using (14) we have

$$\begin{array}{cc}\hfill & \sum _{l=1}^{n}F{H}_{lp-1}^p=F{H}_{p-1}^p+F{H}_{2p-1}^p+\cdots +F{H}_{np-1}^p\hfill \\ \hfill & =F(p,p-1)+F(p,p)\mathbf{i}+F(p,p+1)\epsilon +F(p,p+2)\mathbf{h}\hfill \\ \hfill & +F(p,2p-1)+F(p,2p)\mathbf{i}+F(p,2p+1)\epsilon +F(p,2p+2)\mathbf{h}+\cdots \hfill \\ \hfill & +F(p,np-1)+F(p,np)\mathbf{i}+F(p,np+1)\epsilon +F(p,np+2)\mathbf{h}\hfill \\ \hfill & =F(p,p-1)+F(p,2p-1)+\cdots +F(p,np-1)\hfill \\ \hfill & +\left(F(p,p)+F(p,2p)+\cdots +F(p,np)\right)\mathbf{i}\hfill \\ \hfill & +\left(F(p,p+1)+F(p,2p+1)+\cdots +F(p,np+1)\right)\epsilon \hfill \\ \hfill & +\left(F(p,p+2)+F(p,2p+2)+\cdots +F(p,np+2)\right)\mathbf{h}.\hfill \end{array}$$

Writing (4) as ${\displaystyle \sum _{l=1}^n}F(p,lp-1)=F(p,np)-1=F(p,np)-F(p,0)$ and using (5)–(7) we obtain (16). □

Theorem 10.

Let $p\ge 2,$ $n\ge 2p-2$ be integers. Then

$$\begin{array}{c}\hfill F{H}_n^p=\sum _{l=0}^{p-1}F{H}_{n-(p-1)-l}^p.\end{array}$$

Proof. 

Using (8) and (14) we have

$$\begin{array}{cc}\hfill & \sum _{l=0}^{p-1}F{H}_{n-(p-1)-l}^p=F{H}_{n-(p-1)}^p+F{H}_{n-(p-1)-1}^p+\cdots +F{H}_{n-(p-1)-(p-1)}^p\hfill \\ \hfill & =F(p,n-(p-1\left)\right)+F(p,n-(p-1)+1)\mathbf{i}\hfill \\ \hfill & +F(p,n-(p-1)+2)\epsilon +F(p,n-(p-1)+3)\mathbf{h}\hfill \\ \hfill & +F(p,n-(p-1)-1)+F(p,n-(p-1\left)\right)\mathbf{i}\hfill \\ \hfill & +F(p,n-(p-1)+1)\epsilon +F(p,n-(p-1)+2)\mathbf{h}+\cdots \hfill \\ \hfill & +F(p,n-(p-1)-(p-1\left)\right)+F(p,n-(p-1)-(p-1)+1)\mathbf{i}\hfill \\ \hfill & +F(p,n-(p-1)-(p-1)+2)\epsilon \hfill \\ \hfill & +F(p,n-(p-1)-(p-1)+3)\mathbf{h}\hfill \\ \hfill & =F(p,n)+F(p,n+1)\mathbf{i}+F(p,n+2)\epsilon +F(p,n+3)\mathbf{h}=F{H}_n^p,\hfill \end{array}$$

which ends the proof. □

Remark 3.

If $p=2$ and $n\ge 2$ then we obtain the basic equality for the Fibonacci hybrid numbers $F{H}_n$

$$\begin{array}{c}\hfill F{H}_n=F{H}_{n-1}+F{H}_{n-2}.\end{array}$$

Remark 4.

If $p=3$ and $n\ge 4$ then we obtain the basic equality for the Fibonacci–Narayana hybrid numbers $u{H}_n$

$$\begin{array}{cc}\hfill u{H}_n& =u{H}_{n-2}+u{H}_{n-3}+u{H}_{n-4}\hfill \\ \hfill & =u{H}_{n-3}+(u{H}_{n-2}+u{H}_{n-4})=u{H}_{n-3}+u{H}_{n-1}.\hfill \end{array}$$

Theorem 11.

Let $p\ge 2,$ $n\ge 2p$ be integers. Then

$$\begin{array}{c}\hfill \sum _{l=2}^{n}L{H}_{pl}^p=L{H}_{np+1}^p-L{H}_{p+1}^p.\end{array}$$

(17)

Proof. 

Using (15) we have

$$\begin{array}{cc}\hfill & \sum _{l=2}^{n}L{H}_{pl}^p=L{H}_{2p}^p+L{H}_{3p}^p+\cdots +L{H}_{np}^p\hfill \\ \hfill & =L(p,2p)+L(p,2p+1)\mathbf{i}+L(p,2p+2)\epsilon +L(p,2p+3)\mathbf{h}\hfill \\ \hfill & +L(p,3p)+L(p,3p+1)\mathbf{i}+L(p,3p+2)\epsilon +L(p,3p+3)\mathbf{h}+\cdots \hfill \\ \hfill & +L(p,np)+L(p,np+1)\mathbf{i}+L(p,np+2)\epsilon +L(p,np+3)\mathbf{h}\hfill \\ \hfill & =L(p,2p)+L(p,3p)+\cdots +L(p,np)\hfill \\ \hfill & +\left(L(p,2p+1)+L(p,3p+1)+\cdots +L(p,np+1)\right)\mathbf{i}\hfill \\ \hfill & +\left(L(p,2p+2)+L(p,3p+2)+\cdots +L(p,np+2)\right)\epsilon \hfill \\ \hfill & +\left(L(p,2p+3)+L(p,3p+3)+\cdots +L(p,np+3)\right)\mathbf{h}.\hfill \end{array}$$

Writing (9) as ${\displaystyle \sum _{l=2}^n}L(p,pl)=L(p,np+1)-L(p,p+1)$ and using (10)–(12) we obtain (17). □

Remark 5.

If $p=2$ then we have

$$\begin{array}{c}\hfill \sum _{l=2}^{n}L{H}_{2l}=L{H}_{2n+1}-L{H}_3,\end{array}$$

and

$$\begin{array}{cc}\hfill \sum _{l=0}^{n}L{H}_{2l}& =\sum _{l=2}^{n}L{H}_{2l}+L{H}_0+L{H}_2\hfill \\ \hfill & =L{H}_{2n+1}-L{H}_3+L{H}_0+L{H}_2\hfill \\ \hfill & =L{H}_{2n+1}-(L{H}_2+L{H}_1)+L{H}_0+L{H}_2\hfill \end{array}$$

hence we obtain the known equality for the Lucas hybrid numbers $L{H}_n$ (see [23])

$$\sum _{l=0}^{n}L{H}_{2l}=L{H}_{2n+1}+L{H}_0-L{H}_1.$$

Theorem 12.

Let $p\ge 2,$ $n\ge 2p$ be integers. Then

$$\begin{array}{c}\hfill L{H}_n^p=p·F{H}_{n-(2p-1)}^p+F{H}_{n-p}^p.\end{array}$$

Proof. 

Using (14) we have

$$\begin{array}{cc}\hfill F{H}_{n-(2p-1)}^p& =F(p,n-(2p-1\left)\right)+F(p,n-(2p-1)+1)\mathbf{i}\hfill \\ \hfill & +F(p,n-(2p-1)+2)\epsilon +F(p,n-(2p-1)+3)\mathbf{h}\hfill \end{array}$$

and

$$\begin{array}{cc}\hfill F{H}_{n-p}^p& =F(p,n-p)+F(p,n-p+1)\mathbf{i}\hfill \\ \hfill & +F(p,n-p+2)\epsilon +F(p,n-p+3)\mathbf{h},\hfill \end{array}$$

consequently

$$\begin{array}{cc}\hfill & p·F{H}_{n-(2p-1)}^p+F{H}_{n-p}^p\hfill \\ \hfill & =p·F(p,n-(2p-1\left)\right)+F(p,n-p)\hfill \\ \hfill & +\left(p·F(p,(n+1)-(2p-1\left)\right)+F(p,(n+1)-p)\right)\mathbf{i}\hfill \\ \hfill & +\left(p·F(p,(n+2)-(2p-1\left)\right)+F(p,(n+2)-p)\right)\epsilon \hfill \\ \hfill & +\left(p·F(p,(n+3)-(2p-1\left)\right)+F(p,(n+3)-p)\right)\mathbf{h}.\hfill \end{array}$$

Using (13) we have

$$\begin{array}{cc}\hfill & p·F{H}_{n-(2p-1)}^p+F{H}_{n-p}^p\hfill \\ \hfill & =L(p,n)+L(p,n+1)\mathbf{i}+L(p,n+2)\epsilon +L(p,n+3)\mathbf{h},\hfill \end{array}$$

which ends the proof. □

3. Concluding Remarks

Let $\left\{a_n\right\}$ be an increasing sequence of integer numbers. Then nth $a_n$-hybrid number $a{H}_n$ is defined as $a{H}_n=a_n+a_{n+1}\mathbf{i}+a_{n+2}\epsilon +a_{n+3}\mathbf{h}.$ We shall show that $a_n$-hybrid numbers are spacelike. Since $\left\{a_n\right\}$ is increasing, so

$$\begin{array}{cc}\hfill C\left(a{H}_n\right)& ={\left(a_n\right)}^2+{\left(a_{n+1}\right)}^2-2a_{n+1}{a}_{n+2}-{\left(a_{n+3}\right)}^2\hfill \\ \hfill & <{\left(a_n\right)}^2+{\left(a_{n+1}\right)}^2-2{\left(a_{n+1}\right)}^2-{\left(a_{n+3}\right)}^2\hfill \\ \hfill & ={\left(a_n\right)}^2-{\left(a_{n+1}\right)}^2-{\left(a_{n+3}\right)}^2<0.\hfill \end{array}$$

From the above immediately follows that $F(p,n)$-Fibonacci hybrid numbers and $L(p,n)$-Lucas hybrid numbers are spacelike.

Among generalizations of Fibonacci type numbers the well-known is generalization given by Horadam, see [24].

Let $\mathbf{p},\mathbf{q},n$ be integers. For $n\ge 0$ the nth Horadam number $W_n=W_n(W_0,W_1;\mathbf{p},\mathbf{q})$ is defined by

$$W_n=\mathbf{p}·W_{n-1}-\mathbf{q}·W_{n-2},$$

for $n\ge 2$ with fixed real numbers $W_0,$ $W_1.$

The Horadam hybrid numbers were introduced in [25] as follows. The nth Horadam hybrid number $H_n$ is defined as

$$H_n=W_n+W_{n+1}\mathbf{i}+W_{n+2}\epsilon +W_{n+3}\mathbf{h}.$$

The character $C\left(H_n\right)$ of the Horadam hybrid number $H_n$ is equal to

$$\begin{array}{c}\hfill C\left(H_n\right)=W_n^2(1-{\mathbf{p}}^2{\mathbf{q}}^2)+W_n{W}_{n+1}(2\mathbf{q}+2{\mathbf{p}}^3\mathbf{q}-2\mathbf{p}{\mathbf{q}}^2)\\ \hfill +W_{n+1}^2(1-2\mathbf{p}-{\mathbf{p}}^4+2{\mathbf{p}}^2\mathbf{q}-{\mathbf{q}}^2).\end{array}$$

The well known special case of Horadam numbers are Pell numbers, Pell-Lucas numbers, Jacobsthal numbers, Jacobsthal-Lucas numbers, Mersenne numbers and many others. Since the corresponding sequences are increases, so the hybrid numbers based on these sequences are spacelike. However it seems to be interesting to describe which Horadam hybrid numbers are spacelike.