Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

On Tribonacci Functions and Gaussian Tribonacci Functions

View through CrossRef
In this work, Gaussian Tribonacci functions are defined and investigated on the set of real numbers $\mathbb{R},$ \textit{i.e}., functions $f_{G}$ $:$ $\mathbb{R}\rightarrow \mathbb{C}$ such that for all $% x\in \mathbb{R},$ $n\in \mathbb{Z},$ $f_{G}(x+n)=f(x+n)+if(x+n-1)$ where $f$ $:$ $\mathbb{R}\rightarrow \mathbb{R}$ is a Tribonacci function which is given as $f(x+3)=f(x+2)+f(x+1)+f(x)$ for all $x\in \mathbb{R}$. Then the concept of Gaussian Tribonacci functions by using the concept of $f$-even and $f$-odd functions is developed. Also, we present linear sum formulas of Gaussian Tribonacci functions. Moreover, it is showed that if $f_{G}$ is a Gaussian Tribonacci function with Tribonacci function $f$, then $% \lim\limits_{x\rightarrow \infty }\frac{f_{G}(x+1)}{f_{G}(x)}=\alpha \ $and\ $\lim\limits_{x\rightarrow \infty }\frac{f_{G}(x)}{f(x)}=\alpha +i,$ where $% \alpha $ is the positive real root of equation $x^{3}-x^{2}-x-1=0$ for which $\alpha >1$. Finally, matrix formulations of Tribonacci functions and Gaussian Tribonacci functions are given. In the literature, there are several studies on the functions of linear recurrent sequences such as Fibonacci functions and Tribonacci functions. However, there are no study on Gaussian functions of linear recurrent sequences such as Gaussian Tribonacci and Gaussian Tetranacci functions and they are waiting for the investigating. We also present linear sum formulas and matrix formulations of Tribonacci functions which have not been studied in the literature.
Title: On Tribonacci Functions and Gaussian Tribonacci Functions
Description:
In this work, Gaussian Tribonacci functions are defined and investigated on the set of real numbers $\mathbb{R},$ \textit{i.
e}.
, functions $f_{G}$ $:$ $\mathbb{R}\rightarrow \mathbb{C}$ such that for all $% x\in \mathbb{R},$ $n\in \mathbb{Z},$ $f_{G}(x+n)=f(x+n)+if(x+n-1)$ where $f$ $:$ $\mathbb{R}\rightarrow \mathbb{R}$ is a Tribonacci function which is given as $f(x+3)=f(x+2)+f(x+1)+f(x)$ for all $x\in \mathbb{R}$.
Then the concept of Gaussian Tribonacci functions by using the concept of $f$-even and $f$-odd functions is developed.
Also, we present linear sum formulas of Gaussian Tribonacci functions.
Moreover, it is showed that if $f_{G}$ is a Gaussian Tribonacci function with Tribonacci function $f$, then $% \lim\limits_{x\rightarrow \infty }\frac{f_{G}(x+1)}{f_{G}(x)}=\alpha \ $and\ $\lim\limits_{x\rightarrow \infty }\frac{f_{G}(x)}{f(x)}=\alpha +i,$ where $% \alpha $ is the positive real root of equation $x^{3}-x^{2}-x-1=0$ for which $\alpha >1$.
Finally, matrix formulations of Tribonacci functions and Gaussian Tribonacci functions are given.
In the literature, there are several studies on the functions of linear recurrent sequences such as Fibonacci functions and Tribonacci functions.
However, there are no study on Gaussian functions of linear recurrent sequences such as Gaussian Tribonacci and Gaussian Tetranacci functions and they are waiting for the investigating.
We also present linear sum formulas and matrix formulations of Tribonacci functions which have not been studied in the literature.

Related Results

Generalized Tribonacci Polynomials
Generalized Tribonacci Polynomials
In this paper, we investigate the generalized Tribonacci polynomials and we deal with, in detail, two special cases which we call them (r,s,t)-Tribonacci and (r,s,t)-Tribonacci-Luc...
Odd version Mathieu-Gaussian beam based on Green function
Odd version Mathieu-Gaussian beam based on Green function
Like the theoretical pattern of non-diffracting Bessel beams, ideal non-diffracting Mathieu beams also carry infinite energy, but cannot be generated as a physically realizable ent...
Tribonacci numbers as sum or difference of powers of 2
Tribonacci numbers as sum or difference of powers of 2
This paper investigates Tribonacci numbers can be expressed as either the sum or difference of two distinct powers of 2. Namely, we address the problem of expressing Tribonacci num...
Data-driven Warping of Gaussian Processes for Spatial Interpolation of Skewed Data
Data-driven Warping of Gaussian Processes for Spatial Interpolation of Skewed Data
<p>Gaussian processes are a flexible machine learning framework that can be used for spatial interpolation and space-time prediction as well. Gaussian process regress...
Adaptive and augmented nonlinear filters : theory and applications
Adaptive and augmented nonlinear filters : theory and applications
[ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] Nonlinear estimation and filtering have been intensively studied for decades since it has been widely used in...
Optimizing LED spectrum fitting using double Gaussian functions
Optimizing LED spectrum fitting using double Gaussian functions
In order to minimize errors during the LED spectrum fitting process and achieve a closer match between the fitted spectrum and the target spectrum, a method employing double Gaussi...
MGNPE‐LICA algorithm for fault diagnosis of batch process
MGNPE‐LICA algorithm for fault diagnosis of batch process
AbstractBatch production process data usually contains mixture ingredients of the Gaussian and non‐Gaussian distribution. Traditional monitoring methods require data to meet the re...
On square Tribonacci Lucas numbers
On square Tribonacci Lucas numbers
The Tribonacci-Lucas sequence {Sn}{Sn} is defined by the recurrence relation Sn+3=Sn+2+Sn+1+SnSn+3=Sn+2+Sn+1+Sn with S0=3, S1=1, S2=3.S0=3, S1=1, S2=3. In this note, we show that 1...

Back to Top