Next Article in Journal
Euclidean Jordan Algebras, Symmetric Association Schemes, Strongly Regular Graphs, and Modified Krein Parameters of a Strongly Regular Graph
Previous Article in Journal
Learning by Autonomous Manifold Deformation with an Intrinsic Deforming Field
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Some Combinatorial Properties of Oresme Hybrationals

The Faculty of Mathematics and Applied Physics, Rzeszów University of Technology, al. Powstańców Warszawy 12, 35-959 Rzeszów, Poland
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(11), 1996; https://doi.org/10.3390/sym15111996
Submission received: 1 October 2023 / Revised: 22 October 2023 / Accepted: 25 October 2023 / Published: 29 October 2023
(This article belongs to the Section Mathematics)

Abstract

:
In this paper, we study the Oresme hybrationals that generalize Oresme hybrid numbers and Oresme rational functions. We give a reccurence relation and a generating function for Oresme hybrationals. Moreover, we give some of their properties, among others, Binet formulas and general bilinear index-reduction formulas, through which we can obtain Catalan-, Cassini-, Vajda-, and d’Ocagne-type identities.

1. Introduction

The Fibonacci sequence, { F n } defined by F 0 = 0 ,   F 1 = 1 , and F n = F n 1 + F n 2 for n 2 , is perhaps the most famous sequence in view of its connections with distinct areas of science, for example, Pascal’s triangle [1,2,3], computer algorithm [4,5], graph theory [6], some problems of algebra [7], theoretical physics [8,9,10], and many other areas. This sequence has many interesting interpretations, applications, and generalizations, and based on them, a number of Fibonacci-like sequences were discovered. These generalizations have been given in many ways, some by preserving initial conditions or others by preserving the recurrence relations. In [11], Horadam introduced a generalized Fibonacci sequence, named later as the Horadam sequence, as follows.
For the integer n 0 Horadam sequence, W n = W n ( W 0 , W 1 ; p , q ) is defined by the recurrence relation
W n + 2 = p · W n + 1 q · W n ,
where W 0 ,   W 1 are real, and p ,   q are integers.
For special values of W 0 ,   W 1 ,   p ,   q , Equation (1) gives well-known sequences also named as Fibonacci-type sequences; see Table 1.
In the next decade, Horadam extended Equation (1) considering rational numbers W 0 ,   W 1 ,   p ,   q , see [13]. In particular, W n ( 0 ,   1 2 ; 1 ,   1 4 ) gives the well-known Oresme sequence { O n } . The sequence { O n } was introduced by Nicole Oresme in the 14th century, who found the sum of rational numbers formed by 0 ,   1 2 ,   2 4 ,   3 8 ,   4 16 ,   5 32 ,   6 64 ,   ,   n 2 n . These numbers form a sequence that can be defined by the recurrence relation O n = O n 1 1 4 O n 2 , for n 2 with O 0 = 0 ,   O 1 = 1 2 .
Oresme numbers were generalized next by Cook in [14] in the following way. Let k 2 and n 0 be integers. Then, the k-Oresme numbers O n ( k ) are defined by O n ( k ) = O n 1 ( k ) 1 k 2 O n 2 ( k ) , for n 2 with O 0 ( k ) = 0 ,   O 1 ( k ) = 1 k . Clearly, W n ( 0 , 1 k ; 1 , 1 k 2 ) = O n ( k ) , and O n ( 2 ) = O n .
In [15], the sequence of k-Oresme numbers was extended to the sequence of rational functions O n ( x ) adding to the definition of O n ( k ) a real variable x instead of an integer k . These rational functions were named in [15] Oresme polynomials, but by their rational form, we call them Oresme rational functions.
Let x R { 0 } . The sequence O n ( x ) of Oresme rational functions is recursively defined as follows:
O n ( x ) = 0 if n = 0 , 1 x if n = 1 , O n 1 ( x ) 1 x 2 O n 2 ( x ) if n 2 .
The first six terms of the Oresme rational function sequence are
O 0 ( x ) = 0 O 1 ( x ) = 1 x O 2 ( x ) = 1 x O 3 ( x ) = x 2 1 x 3 O 4 ( x ) = x 2 2 x 3 O 5 ( x ) = x 4 3 x 2 + 1 x 5 .
Solving the characteristic Equation r 2 r + 1 x 2 = 0 of the Oresme rational functions recurrence relation, we obtain the Binet formula
O n ( x ) = 1 x 2 4 x + x 2 4 2 x n x x 2 4 2 x n
for x 2 4 > 0 (see [15]), and
O n ( x ) = i 4 x 2 x 4 x 2 i 2 x n x + 4 x 2 i 2 x n
for x 2 4 < 0 ,   x 0 , (see for details [16]).
The sequence O n ( x ) is a generalization of the Oresme sequence because of O n ( 2 ) = O n and O n ( 2 ) = O n .
Sequences and polynomials of the Fibonacci-type also have applications in the theory of hypercomplex numbers. Many authors have studied these sequences in the context of quaternions, hybrid numbers, and others. For example in the survey [7], the bibliography contains over 100 papers, and most of them have been published quite recently. Motivated by these results, in this paper we use Oresme numbers and Oresme rational functions in the theory of hybrid numbers. We start with the necessary definitions.
In [17], Özdemir introduced a new noncommutative number system called hybrid numbers. The set of hybrid numbers, denoted by K , is defined by
K = { z = a + b i + c ε + d h : a , b , c , d R } ,
where
i 2 = 1 , ε 2 = 0 , h 2 = 1 , i h = h i = ε + i .
Two hybrid numbers z 1 = a 1 + b 1 i + c 1 ε + d 1 h , z 2 = a 2 + b 2 i + c 2 ε + d 2 h are equal if a 1 = a 2 , b 1 = b 2 , c 1 = c 2 , d 1 = d 2 . The sum of two hybrid numbers is defined by z 1 + z 2 = a 1 + a 2 + ( b 1 + b 2 ) i + ( c 1 + c 2 ) ε + ( d 1 + d 2 ) h . Using (4), we obtain the following multiplication table.
Using the rules given in Table 2, the multiplication of hybrid numbers can be made analogously to the multiplications of algebraic expressions. The set of hybrid numbers is a noncommutative ring with respect to the addition and multiplication operations.
The Horadam hybrid sequence { H n } , where H n = W n + W n + 1 i + W n + 2 ε + W n + 3 h , was defined and examined in [18]. The Oresme hybrid sequence { O H n } , where O H n = O n + O n + 1 i + O n + 2 ε + O n + 3 h , was introduced independently in [16,19] (see also [19]), while the k-Oresme hybrid numbers O H n ( k ) , where O H n ( k ) = O n ( k ) + O n + 1 ( k ) i + O n + 2 ( k ) ε + O n + 3 ( k ) h , were introduced and studied in [16]. The results for Fibonacci-type hybrid numbers were next generalized on Fibonacci-type hybrinomials; see the list [7]. In [16], the authors defined a generalization of k-Oresme hybrid numbers and Oresme rational functions, named Oresme hybrationals. Properties and applications of k-Oresme hybrid numbers were studied in [20], published this year.
The results for Fibonacci-type hybrid numbers were next generalized on Fibonacci-type hybrinomials.
For n 0 and x R { 0 } , Oresme hybrationals are defined by
O H n ( x ) = O n ( x ) + O n + 1 ( x ) i + O n + 2 ( x ) ε + O n + 3 ( x ) h ,
where O n ( x ) is the nth Oresme rational function and i ,   ε , and h are hybrid units. For x = k , we obtain the k-Oresme hybrid numbers.
This paper concerns Oresme hybrationals. We give a recurrence relation and a generating function for Oresme hybrationals. Moreover, we determine some identities for them, among others, Binet formulas and general bilinear index-reduction formulas. Using these formulas, we also obtain Catalan-, Cassini-, Vajda-, and d’Ocagne-type identities. It is worth mentioning that the domain for Oresme polynomials is symmetric with respect to 0. Moreover, due to the form of Binet’s formulas for Oresme polynomials, the two symmetric points 2 and 2 are also considered separately. Therefore, when determining identities for Oresme hybrationals, we consider three different cases.

2. Results

In this section, we give some combinatorial properties of Oresme hybrationals.
Let x R { 0 } . For future considerations we need initial conditions, which immediately follow from (5) and (2), of the form
O H 0 ( x ) = 1 x i + 1 x ε + x 2 1 x 3 h , O H 1 ( x ) = 1 x + 1 x i + x 2 1 x 3 ε + x 2 2 x 3 h .
Theorem 1. 
Let x R { 0 } . Then,
O H n ( x ) = O H n 1 ( x ) 1 x 2 O H n 2 ( x ) for n 2 ,
with O H 0 ( x ) ,   O H 1 ( x ) given by (6).
Proof. 
If n = 2 , then from (2) and (5), we have
O H 2 ( x ) = O 2 ( x ) + O 3 ( x ) i + O 4 ( x ) ε + O 5 h = 1 x + x 2 1 x 3 i + x 2 2 x 3 ε + x 4 3 x 2 + 1 x 5 h = 1 x + 1 x i + x 2 1 x 3 ε + x 2 2 x 3 h 1 x 3 i 1 x 3 ε x 2 1 x 5 h = 1 x + 1 x i + x 2 1 x 3 ε + x 2 2 x 3 h 1 x 2 1 x i + 1 x ε + x 2 1 x 3 h = O H 1 ( x ) 1 x 2 O H 0 ( x ) .
So for n = 2 , Equation (7) is true.
If n 3 , then using the definition of the Oresme rational functions, we have
O H n ( x ) = O n ( x ) + O n + 1 ( x ) i + O n + 2 ( x ) ε + O n + 3 ( x ) h = O n 1 ( x ) 1 x 2 O n 2 ( x ) + O n ( x ) 1 x 2 O n 1 ( x ) i + O n + 1 ( x ) 1 x 2 O n ( x ) ε + O n + 2 ( x ) 1 x 2 O n + 1 ( x ) h = O n 1 ( x ) + O n ( x ) i + O n + 1 ( x ) ε + O n + 2 ( x ) h 1 x 2 O n 2 ( x ) + O n 1 ( x ) i + O n ( x ) ε + O n + 1 ( x ) h = O H n 1 ( x ) 1 x 2 O H n 2 ( x ) ,
which ends the proof. □
An important technique for solving linear homogeneous recurrence equations is generating functions. They are typically used with linear recurrence relations with constant coefficients, but they can be applied also for nonconstant coefficients. The next theorem gives the generating function for Oresme hybrationals.
Theorem 2. 
Let x R { 0 } . Then, the generating function for the Oresme hybrational sequence { O H n ( x ) } is
G ( t , x ) = 1 x i + 1 x ε + x 2 1 x 3 h + ( 1 x 1 x 3 ε 1 x 3 h ) t 1 t + 1 x 2 t 2 .
Proof. 
Assume that the generating function of the Oresme hybrational sequence { O H n ( x ) } has the form G ( t , x ) = n = 0 O H n ( x ) t n . Then,
G ( t , x ) = O H 0 ( x ) + O H 1 ( x ) t + O H 2 ( x ) t 2 + .
Multipling the above equality on both sides by t and then by 1 x 2 t 2 , we obtain the following
G ( t , x ) t = O H 0 ( x ) t O H 1 ( x ) t 2 O H 2 ( x ) t 3 +
1 x 2 G ( t , x ) t 2 = 1 x 2 O H 0 ( x ) t 2 + 1 x 2 O H 1 ( x ) t 3 + 1 x 2 O H 2 ( x ) t 4 + .
By adding the three equalities above, we obtain
G ( t , x ) 1 t + 1 x 2 t 2 = O H 0 ( x ) + ( O H 1 ( x ) O H 0 ( x ) ) t ,
since O H n + 2 ( x ) = O H n + 1 ( x ) 1 x 2 O H n ( x ) (see (7)), and the coefficients of t n for n 2 are equal to zero. Moreover, O H 0 ( x ) = 1 x i + 1 x ε + x 2 1 x 3 h ,   O H 1 ( x ) O H 0 ( x ) = 1 x 1 x 3 ε 1 x 3 h .

Properties of Oresme Hybrationals

In this subsection, we give a number of identities for Oresme hybrationals. As the Binet formula for Oresme rational functions depends on the value of x , some of them cannot be given for all x R { 0 } . First, we give equalities for all nonzero real variable x, and next, we consider cases x 2 4 > 0 ,   x 2 4 < 0 ,   x = 2 , and x = 2 .
Note that the cases mentioned above contain sets that are symmetric with respect to 0. Due to the form of Binet’s formulas for Oresme polynomials, the two symmetric points 2 and 2 are also considered separately.
Now, we describe the terms of the sequence { O H n ( x ) } explicitly using a Binet-type formula. Because the Binet formula for Oresme rational functions depends on x, we have to consider cases with respect to the sign of the expression x 2 4 .
Theorem 3. 
(Binet-type formula) Let n 0 be an integer. Then, for x 2 4 > 0 , we have
O H n ( x ) = C α 1 n α 1 ^ C α 2 n α 2 ^ ,
where
C = 1 x 2 4 , α 1 = x + x 2 4 2 x , α 2 = x x 2 4 2 x , α 1 ^ = 1 + α 1 i + α 1 2 ε + α 1 3 h , α 2 ^ = 1 + α 2 i + α 2 2 ε + α 2 3 h .
Proof. 
By (3) and (5) we obtain
O H n ( x ) = O n ( x ) + O n + 1 ( x ) i + O n + 2 ( x ) ε + O n + 3 ( x ) h = C α 1 n C α 2 n + ( C α 1 n + 1 C α 2 n + 1 ) i + ( C α 1 n + 2 C α 2 n + 2 ) ε + ( C α 1 n + 3 C α 2 n + 3 ) h = C α 1 n 1 + α 1 i + α 1 2 ε + α 1 3 h C α 2 n 1 + α 2 i + α 2 2 ε + α 2 3 h = C α 1 n α 1 ^ C α 2 n α 2 ^ .
Theorem 4. 
(General bilinear index-reduction formula) Let a 0 , b 0 ,   c 0 , and d 0 be integers such that a + b = c + d . Then, for x 2 4 > 0 , we have
O H a ( x ) · O H b ( x ) O H c ( x ) · O H d ( x ) = C 2 α 1 c α 2 d C 2 α 1 a α 2 b α 1 ^ · α 2 ^ + C 2 α 2 c α 1 d C 2 α 2 a α 1 b α 2 ^ · α 1 ^ ,
where C ,   α 1 ,   α 2 ,   α 1 ^ , and α 2 ^ are given by (9).
Proof. 
Using (8), we have
O H a ( x ) · O H b ( x ) O H c ( x ) · O H d ( x ) = C α 1 a α 1 ^ C α 2 a α 2 ^ · C α 1 b α 1 ^ C α 2 b α 2 ^ C α 1 c α 1 ^ C α 2 c α 2 ^ · C α 1 d α 1 ^ C α 2 d α 2 ^ = C α 1 a α 1 ^ C α 2 b α 2 ^ C α 2 a α 2 ^ C α 1 b α 1 ^ + C α 1 c α 1 ^ C α 2 d α 2 ^ + C α 2 c α 2 ^ C α 1 d α 1 ^ = C 2 α 1 c α 2 d C 2 α 1 a α 2 b α 1 ^ · α 2 ^ + C 2 α 2 c α 1 d C 2 α 2 a α 1 b α 2 ^ · α 1 ^ ,
which ends the proof. □
From (10), we can derive Catalan-, Cassini-, Vajda-, and d’Ocagne-type identities. Before it, we need to prove the following lemma.
Lemma 1. 
Let α 1 ^ = 1 + α 1 i + α 1 2 ε + α 1 3 h ,   α 2 ^ = 1 + α 2 i + α 2 2 ε + α 2 3 h , where α 1 = x + x 2 4 2 x ,   α 2 = x x 2 4 2 x . Then, for x 2 4 > 0 , we have
α 1 ^ · α 2 ^ = x 6 + 1 x 6 + x 3 x 2 4 x 3 i + x 5 2 x 3 x 2 x 2 4 + x 2 4 x 5 ε + x 3 3 x + x 2 4 x 3 h ,
α 2 ^ · α 1 ^ = x 6 + 1 x 6 + x 3 + x 2 4 x 3 i + x 5 2 x 3 + x 2 x 2 4 x 2 4 x 5 ε + x 3 3 x x 2 4 x 3 h .
Proof. 
By multiplication rules, we obtain
α 1 ^ · α 2 ^ = 1 + α 1 i + α 1 2 ε + α 1 3 h · 1 + α 2 i + α 2 2 ε + α 2 3 h = 1 + α 2 i + α 2 2 ε + α 2 3 h + α 1 i α 1 α 2 + α 1 α 2 2 ( 1 h ) + α 1 α 2 3 ( ε + i ) + α 1 2 ε + α 1 2 α 2 ( 1 + h ) α 1 2 α 2 3 ε + α 1 3 h α 1 3 α 2 ( ε + i ) + α 1 3 α 2 2 ε + α 1 3 α 2 3 = 1 α 1 α 2 + α 1 α 2 ( α 1 + α 2 ) + ( α 1 α 2 ) 3 + α 1 + α 2 + α 1 α 2 ( α 2 α 1 ) ( α 2 + α 1 ) i + α 1 2 + α 2 2 + α 1 α 2 ( α 2 α 1 ) ( α 2 + α 1 ) + ( α 1 α 2 ) 2 ( α 1 α 2 ) ε + α 1 3 + α 2 3 + α 1 α 2 ( α 1 α 2 ) h .
Using the equalities
α 1 · α 2 = 1 x 2 , α 1 + α 2 = 1 , α 1 α 2 = x 2 4 x , α 1 2 + α 2 2 = ( α 1 + α 2 ) 2 2 α 1 α 2 = x 2 2 x 2 , α 1 3 + α 2 3 = ( α 1 + α 2 ) 3 3 α 1 α 2 ( α 1 + α 2 ) = x 2 3 x 2 ,
we obtain
α 1 ^ · α 2 ^ = x 6 + 1 x 6 + x 3 x 2 4 x 3 i + x 2 2 x 2 x 2 4 x 3 + x 2 4 x 5 ε + x 2 3 x 2 + x 2 4 x 3 h = x 6 + 1 x 6 + x 3 x 2 4 x 3 i + x 5 2 x 3 x 2 x 2 4 + x 2 4 x 5 ε + x 3 3 x + x 2 4 x 3 h
and we obtain the equality (11). The proof of (12) is analogous, so we omit it. □
Theorem 5. 
(Catalan-type identity) Let n 0 , r 0 be integers such that n r . Then, for x 2 4 > 0 , we have
O H n + r ( x ) · O H n r ( x ) O H n ( x ) 2 = 4 r x + x 2 4 2 r 4 r x 2 n x 2 4 α 1 ^ · α 2 ^ + 4 r x x 2 4 2 r 4 r x 2 n x 2 4 α 2 ^ · α 1 ^
where α 1 ^ · α 2 ^ , α 2 ^ · α 1 ^ are given by (11) and (12), respectively.
Proof. 
Setting a = n + r ,   b = n r , and c = d = n in (10), we have
O H n + r ( x ) · O H n r ( x ) O H n ( x ) 2 = C 2 α 1 n α 2 n 1 α 1 α 2 r α 1 ^ · α 2 ^ + C 2 α 1 n α 2 n 1 α 2 α 1 r α 2 ^ · α 1 ^ .
Moreover, putting
C 2 = 1 x 2 4 , α 1 · α 2 n = x 2 n , α 1 α 2 = 1 4 x + x 2 4 2 , α 2 α 1 = 1 4 x x 2 4 2 ,
the result follows. □
If r = 1 , then we obtain the Cassini-type identity.
Corollary 1. 
(Cassini-type identity) Let n 1 be an integer. Then, for x 2 4 > 0 , we have
O H n + 1 ( x ) · O H n 1 ( x ) O H n ( x ) 2 = C 2 α 1 n α 2 n 1 α 1 α 2 α 1 ^ · α 2 ^ + C 2 α 1 n α 2 n 1 α 2 α 1 α 2 ^ · α 1 ^ = C 2 α 1 n 1 α 2 n 1 α 2 α 1 α 1 · α 1 ^ · α 2 ^ α 2 · α 2 ^ · α 1 ^ ,
where C ,   α 1 ,   α 2 ,   α 1 ^ ,   α 2 ^ are given by (9), and α 1 ^ · α 2 ^ , α 2 ^ · α 1 ^ are given by (11) and (12), respectively.
For special values of a ,   b ,   c ,  d, we obtain the Vajda- and d’Ocagne-type identities, respectively.
Corollary 2. 
(Vajda-type identity) Let n 0 , m 0 , and p 0 be integers such that n p . Then, for x 2 4 > 0 , we have
O H m + p ( x ) · O H n p ( x ) O H m ( x ) · O H n ( x ) = C 2 α 1 m α 2 n 1 α 1 α 2 p α 1 ^ · α 2 ^ + C 2 α 2 m α 1 n 1 α 2 α 1 p α 2 ^ · α 1 ^ ,
where C ,   α 1 ,   α 2 ,   α 1 ^ ,   α 2 ^ are given by (9), and α 1 ^ · α 2 ^ , α 2 ^ · α 1 ^ are given by (11), (12), respectively.
Corollary 3. 
(d’Ocagne-type identity) Let n 0 , m 0 be integers such that n m . Then, for x 2 4 > 0 , we have
O H n ( x ) · O H m + 1 ( x ) O H n + 1 ( x ) · O H m ( x ) = C 2 α 1 n α 2 m α 1 α 2 α 1 ^ · α 2 ^ + C 2 α 2 n α 1 m α 2 α 1 α 2 ^ · α 1 ^ ,
where C ,   α 1 ,   α 2 ,   α 1 ^ ,   α 2 ^ are given by (9), and α 1 ^ · α 2 ^ , α 2 ^ · α 1 ^ are given by (11) and (12), respectively.
Now, let x 2 4 < 0 and x 0 . Using the same methods, we can obtain analogous identities; so, we omit the proofs.
Theorem 6. 
(Binet-type formula) Let n 0 be an integer. Then for x 2 4 < 0 and x 0 we have
O H n ( x ) = D β 1 n β 1 ^ D β 2 n β 2 ^ ,
where
D = i 4 x 2 , β 1 = x 4 x 2 i 2 x , β 2 = x + 4 x 2 i 2 x , β 1 ^ = 1 + β 1 i + β 1 2 ε + β 1 3 h , β 2 ^ = 1 + β 2 i + β 2 2 ε + β 2 3 h .
Theorem 7. 
(General bilinear index-reduction formula) Let a 0 , b 0 ,   c 0 ,   d 0 be integers such that a + b = c + d . Then, for x 2 4 < 0 and x 0 , we have
O H a ( x ) · O H b ( x ) O H c ( x ) · O H d ( x ) = D 2 β 1 c β 2 d D 2 β 1 a β 2 b β 1 ^ · β 2 ^ + D 2 β 2 c β 1 d D 2 β 2 a β 1 b β 2 ^ · β 1 ^
where D ,   β 1 ,   β 2 ,   β 1 ^ ,   β 2 ^ are given by (13).
Lemma 2. 
Let β 1 ^ = 1 + β 1 i + β 1 2 ε + β 1 3 h ,   β 2 ^ = 1 + β 2 i + β 2 2 ε + β 2 3 h , where β 1 = x 4 x 2 i 2 x ,   β 2 = x + 4 x 2 i 2 x . Then, for x 2 4 < 0 and x 0 , we have
β 1 ^ · β 2 ^ = x 6 + 1 x 4 x 2 x 6 + x 3 4 x 2 x 3 i + x 3 2 x 4 x 2 x 3 ε + x 5 3 x 3 x 2 4 x 2 + 4 x 2 x 5 h ,
β 2 ^ · β 1 ^ = x 6 + 1 + x 4 x 2 x 6 + x 3 + 4 x 2 x 3 i + x 3 2 x + 4 x 2 x 3 ε + x 5 3 x 3 + x 2 4 x 2 4 x 2 x 5 h .
Proof. 
Using the equalities
β 1 · β 2 = 1 x 2 , β 1 + β 2 = 1 , β 2 β 1 = 4 x 2 i x , β 1 2 + β 2 2 = ( β 1 + β 2 ) 2 2 β 1 β 2 = x 2 2 x 2 , β 1 3 + β 2 3 = ( β 1 + β 2 ) 3 3 β 1 β 2 ( β 1 + β 2 ) = x 2 3 x 2 ,
we obtain
β 1 ^ · β 2 ^ = x 6 + 1 x 6 + x 3 + 4 x 2 i x 3 i + x 5 2 x 3 + x 2 4 x 2 i 4 x 2 i x 5 ε + x 3 3 x 4 x 2 i x 3 h = x 6 + 1 x 4 x 2 x 6 + x 3 4 x 2 x 3 i + x 5 2 x 3 x 2 4 x 2 x 5 ε + x 5 3 x 3 x 2 4 x 2 + 4 x 2 x 5 h ,
and we obtain the equality (14). We omit the proof of (15). □
Corollary 4. 
(Catalan-type identity) Let n 0 , r 0 be integers such that n r . Then, for x 2 4 < 0 and x 0 , we have
O H n + r ( x ) · O H n r ( x ) O H n ( x ) 2 = D 2 β 1 n β 2 n 1 β 1 β 2 r β 1 ^ · β 2 ^ + D 2 β 1 n β 2 n 1 β 2 β 1 r β 2 ^ · β 1 ^ ,
where D ,   β 1 ,   β 2 ,   β 1 ^ ,   β 2 ^ are given by (13), and β 1 ^ · β 2 ^ , β 2 ^ · β 1 ^ are given by (14) and (15), respectively.
Corollary 5. 
(Cassini-type identity) Let n 1 be an integer. Then, for x 2 4 < 0 and x 0 , we have
O H n + 1 ( x ) · O H n 1 ( x ) O H n ( x ) 2 = D 2 β 1 n 1 β 2 n 1 β 2 β 1 β 1 · β 1 ^ · β 2 ^ β 2 · β 2 ^ · β 1 ^ ,
where D ,   β 1 ,   β 2 ,   β 1 ^ ,   β 2 ^ are given by (13), and β 1 ^ · β 2 ^ , β 2 ^ · β 1 ^ are given by (14) and (15), respectively.
Corollary 6. 
(Vajda-type identity) Let n 0 , m 0 , and p 0 be integers such that n p . Then, for x 2 4 < 0 and x 0 , we have
O H m + p ( x ) · O H n p ( x ) O H m ( x ) · O H n ( x ) = D 2 β 1 m β 2 n 1 β 1 β 2 p β 1 ^ · β 2 ^ + D 2 β 2 m β 1 n 1 β 2 β 1 p β 2 ^ · β 1 ^ ,
where D ,   β 1 ,   β 2 ,   β 1 ^ ,   β 2 ^ are given by (13), and β 1 ^ · β 2 ^ , β 2 ^ · β 1 ^ are given by (14), (15), respectively.
Corollary 7. 
(d’Ocagne-type identity) Let n 0 , m 0 be integers such that n m . Then, for x 2 4 < 0 and x 0 , we have
O H n ( x ) · O H m + 1 ( x ) O H n + 1 ( x ) · O H m ( x ) = D 2 β 1 n β 2 m β 1 β 2 β 1 ^ · β 2 ^ + D 2 β 2 n β 1 m β 2 β 1 β 2 ^ · β 1 ^ ,
where D ,   β 1 ,   β 2 ,   β 1 ^ ,   β 2 ^ are given by (13), and β 1 ^ · β 2 ^ , β 2 ^ · β 1 ^ are given by (14) and (15), respectively.
The next results concern special cases k = 2 or k = 2 , respectively. Because of the fact that they follow by simple calculations, we omit the proofs.
Lemma 3 
([16,19]). (Binet-type formula) Let n 0 be an integer. Then,
O H n = n 2 n + n + 1 2 n + 1 i + n + 2 2 n + 2 ε + n + 3 2 n + 3 h .
Theorem 8. 
(General bilinear index-reduction formula) Let a 0 , b 0 ,   c 0 , and d 0 be integers such that a + b = c + d . Then, we have
O H a · O H b O H c · O H d = 65 ( a b c d ) 2 a + b + 6 + a b c d 2 a + b + d b 2 a + b + 2 i + a b c d 2 a + b + 1 + 3 ( d b ) 2 a + b + 4 ε + a b c d 2 a + b + 2 + b d 2 a + b + 2 h .
Corollary 8 
([16]). (Catalan-type identity) Let n 0 ,   r 0 be integers such that n r . Then,
O H n + r · O H n r O H n 2 = 65 r 2 64 · 4 n + 4 r 2 + r 4 · 4 n i + 8 r 2 + 3 r 16 · 4 n ε + r 2 r 4 · 4 n h .
Corollary 9 
([16]). (Cassini-type identity) Let n 1 be an integer. Then,
O H n + 1 · O H n 1 O H n 2 = 65 64 · 4 n + 3 4 · 4 n i + 5 16 · 4 n ε + 2 4 · 4 n h .
Corollary 10. 
(Vajda-type identity) Let n 0 , m 0 , and p 0 be integers such that n p . Then,
O H m + p · O H n p O H m · O H n = 65 p ( n m p ) 64 · 2 m + n + p ( 4 n 4 m 4 p + 1 ) 4 · 2 m + n i + p ( 8 n 8 m 8 p + 3 ) 16 · 2 m + n ε + p ( n m p 1 ) 4 · 2 m + n h .
Corollary 11. 
(d’Ocagne-type identity) Let n 0 , m 0 be integers such that n m . Then,
O H n · O H m + 1 O H n + 1 · O H m = 65 ( n m ) 128 · 2 m + n + 4 n 4 m 1 8 · 2 m + n i + 8 n 8 m 3 32 · 2 m + n ε + n m + 1 8 · 2 m + n h .
Theorem 9. 
(Binet-type formula) Let n 0 be an integer. Then,
O H n ( 2 ) = O n ( 2 ) + O n + 1 ( 2 ) i + O n + 2 ( 2 ) ε + O n + 3 ( 2 ) h = O n O n + 1 i O n + 2 ε O n + 3 h = n 2 n n + 1 2 n + 1 i n + 2 2 n + 2 ε n + 3 2 n + 3 h = O H n .
Theorem 10. 
(General bilinear index-reduction formula) Let a 0 , b 0 ,   c 0 , and d 0 be integers such that a + b = c + d . Then, we have
O H a ( 2 ) · O H b ( 2 ) O H c ( 2 ) · O H d ( 2 ) = O H a · O H b O H c · O H d = O H a · O H b O H c · O H d = 65 ( a b c d ) 2 a + b + 6 + a b c d 2 a + b + d b 2 a + b + 2 i + a b c d 2 a + b + 1 + 3 ( d b ) 2 a + b + 4 ε + a b c d 2 a + b + 2 + b d 2 a + b + 2 h .

3. Conclusions

In this paper, we considered Oresme hybrationals that generalize Oresme hybrid numbers and Oresme rational functions. We gave a recurrence relation and a generating function for Oresme hybrationals. We also obtained identities for them, in particular, Binet formulas and general bilinear index-reduction formulas. Using these formulas we determined Catalan-, Cassini-, Vajda-, and d’Ocagne-type identities.
Sequences and polynomials of the Fibonacci-type have applications in the theory of hypercomplex numbers. It could also be interesting to use Oresme numbers and Oresme rational functions in the theory of hypercomplex numbers and polynomials, for example, bihyperbolic numbers and bihypernomials.

Author Contributions

All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ault, S.V.; Kicey, C. Counting paths in corridors using circular Pascal arrays. Discrete Math. 2014, 332, 45–54. [Google Scholar] [CrossRef]
  2. Barry, P. On Integer-Sequence-Based Constructions of Generalized Pascal Triangles. J. Integer Seq. 2006, 9, 06.2.4. [Google Scholar]
  3. Kicey, C.; Klimko, K. Some geometry of Pascal’s triangle. Pi Mu Epsilon J. 2011, 13, 229–245. [Google Scholar]
  4. Dekking, F.M. Morphic words, Beatty sequences and integer images of the Fibonacci language. Theoret. Comput. Sci. 2020, 809, 407–417. [Google Scholar] [CrossRef]
  5. Dekking, F.M. The sum of digits functions of the Zeckendorf and the base phi expansions. Theor. Comput. Sci. 2021, 859, 70–79. [Google Scholar] [CrossRef]
  6. Prodinger, H.; Tichy, R.F. Fibonacci numbers in graphs. Fibonacci Quart. 1982, 20, 16–21. [Google Scholar]
  7. Szynal-Liana, A.; Włoch, I. Hypercomplex Numbers of the Fibonacci Type; Oficyna Wydawnicza Politechniki Rzeszowskiej: Rzeszów, Poland, 2019. [Google Scholar]
  8. Cruz, N.; Olivares, M.; Villanueva, J.R. The golden ratio in Schwarzschild–Kottler black holes. Eur. Phys. J. 2017, 77, 123. [Google Scholar] [CrossRef]
  9. Livio, M. The Golden Ratio: The Story of phi, the World’s Most Astonishing Number; Broadway Books: New York, NY, USA, 2003. [Google Scholar]
  10. Yu, D.; Xue, D.; Ratajczak, H. Golden ratio and bond-valence parameters of hydrogen bonds of hydrated borates. J. Mol. Struct. 2006, 783, 210–214. [Google Scholar] [CrossRef]
  11. Horadam, A.F. Basic properties of a certain generalized sequence of numbers. Fibonacci Quart. 1965, 3, 161–176. [Google Scholar]
  12. The On-Line Encyclopedia of Integer Sequences. Available online: http://oeis.org/ (accessed on 1 October 2023).
  13. Horadam, A.F. Oresme numbers. Fibonacci Quart. 1974, 12, 267–270. [Google Scholar]
  14. Cook, C.K. Some sums related to sums of Oresme numbers. In Applications of Fibonacci Numbers; Howard, F.T., Ed.; Springer: Dordrecht, The Netherlands, 2004. [Google Scholar]
  15. Cerda-Morales, G. Oresme polynomials and their derivatives. arXiv 2019, arXiv:1904.01165. [Google Scholar]
  16. Szynal-Liana, A.; Włoch, I. Oresme hybrid numbers and hybrationals. Kragujev. J. Math. 2024, 48, 747–753. [Google Scholar]
  17. Özdemir, M. Introduction to Hybrid Numbers. Adv. Appl. Clifford Algebr. 2018, 28, 11. [Google Scholar] [CrossRef]
  18. Szynal-Liana, A. The Horadam hybrid numbers. Discuss. Math. Gen. Algebra Appl. 2018, 38, 91–98. [Google Scholar] [CrossRef]
  19. Mangueira, M.C.d.S.; Vieira, R.P.M.; Alves, F.R.V.; Catarino, P.M.M. The Oresme sequence: The generalization of its matrix form and its hybridization process. Notes Number Theory Discret. Math. 2021, 27, 101–111, Erratum in Notes Number Theory Discret. Math. 2021, 27, 276–279. [Google Scholar] [CrossRef]
  20. Halici, S.; Sayin, E. On some k-Oresme hybrid numbers. Util. Math. 2023, 120, 1–11. [Google Scholar]
Table 1. Special cases of Horadam sequences.
Table 1. Special cases of Horadam sequences.
Sequence W n ( W 0 , W 1 ; p , q ) OEIS [12]
Fibonacci W n ( 0 , 1 ; 1 , 1 ) = F n https://oeis.org/A000045 (accessed on 1 October 2023)
Lucas W n ( 2 , 1 ; 1 , 1 ) = L n https://oeis.org/A000032 (accessed on 1 October 2023)
Pell W n ( 0 , 1 ; 2 , 1 ) = P n https://oeis.org/A000129 (accessed on 1 October 2023)
Pell–Lucas W n ( 2 , 2 ; 2 , 1 ) = Q n https://oeis.org/A002203 (accessed on 1 October 2023)
Jacobsthal W n ( 0 , 1 ; 1 , 2 ) = J n https://oeis.org/A001045 (accessed on 1 October 2023)
Jacobsthal–Lucas W n ( 2 , 1 ; 1 , 2 ) = j n https://oeis.org/A014551 (accessed on 1 October 2023)
Table 2. Multiplication rules for i , ε , and h .
Table 2. Multiplication rules for i , ε , and h .
i ε h
i 1 1 − h ε + i
ε 1 + h0 ε
h ( ε + i ) ε 1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Włoch, I.; Paja, N.; Szynal-Liana, A. On Some Combinatorial Properties of Oresme Hybrationals. Symmetry 2023, 15, 1996. https://doi.org/10.3390/sym15111996

AMA Style

Włoch I, Paja N, Szynal-Liana A. On Some Combinatorial Properties of Oresme Hybrationals. Symmetry. 2023; 15(11):1996. https://doi.org/10.3390/sym15111996

Chicago/Turabian Style

Włoch, Iwona, Natalia Paja, and Anetta Szynal-Liana. 2023. "On Some Combinatorial Properties of Oresme Hybrationals" Symmetry 15, no. 11: 1996. https://doi.org/10.3390/sym15111996

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop