Related papers: Polynomial values with integer coefficients of the…

This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let $F_{n}$ be the Fibonacci numbers defined by the recurrence relation $F_{1}=1$, $F_{2}=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for all $n\geq 3$. We will find…

Let $K$ be a field of characteristic 0, $f:\mathbb{N}\to K$ be a multiplicative function, and $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ be algebraic over $K(z)$. Then either there is a natural number $k$ and a periodic multiplicative function…

In this paper, we answer the question: "what is the qth Fibonacci number, where q is a positive rational?". The answer is the codenominator function, which is an integral-valued map. It is defined via a pair of functional equations. Many…

Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…

A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials,…

This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of…

For a polynomial $f(t) = 1+f_0t+\cdots +f_{d-1}t^d$ with positive integer coefficients Bell and Skandera ask if real rootedness of f(t) implies that there is a simplicial complex with f-vector $(1,f_0 \ldots,f_{d-1})$. In this paper we…

In this paper we study the coefficients of the powers of an ordinary generating function and their properties. A new class of functions based on compositions of an integer $n$ is introduced and is termed composita. We present theorems about…

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…

The main object of this paper is to construct a new generating function of the (q-) Bernstein type polynomials. We establish elementary properties of this function. By using this generating function, we derive recurrence relation and…

We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be…

In this paper, we show that for any integer $a \geq 2$, each of the intervals $[a^k , a^{k + 1})$ ($k \in \mathbb{N}$) contains either $\left\lfloor \frac{\log a}{\log\Phi}\right\rfloor$ or $\left\lceil \frac{\log a}{\log\Phi}\right\rceil$…

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

We define a new class of generating function transformations related to polylogarithm functions, Dirichlet series, and Euler sums. These transformations are given by an infinite sum over the $j^{th}$ derivatives of a sequence generating…

The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…

In this paper, the authors propose the utilization of Fibonacci Neural Networks (FNN) for solving arbitrary order differential equations. The FNN architecture comprises input, middle, and output layers, with various degrees of Fibonacci…

Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.