Related papers: Generalized Compositions and Weighted Fibonacci Nu…
We discuss the relationship between the recurrence coefficients of orthogonal polynomials with respect to a generalized Freud weight \[w(x;t)=|x|^{2\lambda+1}\exp\left(-x^4+tx^2\right),\qquad x\in\mathbb{R},\] with parameters $\lambda>-1$…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain first and second order differential equations for the orthogonal polynomials and associated functions with a weight on the unit circle. We…
We generalise the finite biquandle colouring invariant to a polynomial invariant based on labelling a knot diagram with a finite birack that reduces to the biquandle colouring invariant in that case. The polynomial is an invariant of a…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
A non-trivial element of a group is a generalized torsion element if some products of its conjugates is the identity. The minimum number of such conjugates is called a generalized torsion order. We provide several restrictions for…
We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…
Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
The regularized product of the Fibonacci numbers is evaluated.
We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…
We find various series that involves the central binomial coefficients $\binom{2n}{n}$, harmonic numbers and Fibonacci Numbers.\\ Contrary to the traditional hypergeometric function $_pF_q$ approach, our method utilizes a straightforward…
In this paper we find a Clifford algebra associated to generalized Fibonacci quaternions. In this way, we provide a nice algorithm to obtain a division quaternion algebra starting from a quaternion non-division algebra and vice-versa.
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.
We prove some separation results for the roots of the generalized Fibonacci polynomials and their absolute values
The natural forms of the Leibniz rule for the $k$th derivative of a product and of Fa\`a di Bruno's formula for the $k$th derivative of a composition involve the differential operator $\partial^k/\partial x_1 ... \partial x_k$ rather than…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
In \cite{Oz}, M. \"Ozdemir defined a new non-commutative number system called hybrid numbers. In this paper, we define the hybrid Fibonacci and Lucas numbers. This number system can be accepted as a generalization of the complex…
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…
For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…