Related papers: Fibonacci Identities and Graph Colorings
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
Many works have been done in recent years as to explorations for degenerate versions of some special polynomials and numbers, which began with the introduction of the degenerate Bernoulli and degenerate Euler polynomials by Carlitz. The aim…
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…
In this paper, we give a short proof of a relation generalizing many identities for Bernoulli numbers.
We introduce a natural generalization of Maya diagrams -- the space of infinite Fibonacci configurations, which are specified functions on $\mathbb{Z}$ with values $1$ and $0$. Infinite Fibonacci configurations are particularly interesting…
Using a straightforward elementary approach, we derive numerous infinite arctangent summation formulas involving Fibonacci and Lucas numbers. While most of the results obtained are new, a couple of celebrated results appear as particular…
In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…
Let $F_1=1,F_2=1,\ldots$ be the Fibonacci sequence. Motivated by the identity $\displaystyle\sum_{k=0}^{\infty}\frac{1}{F_{2^k}}=\frac{7-\sqrt{5}}{2}$, Erd\"os and Graham asked whether $\displaystyle\sum_{k=1}^{\infty}\frac{1}{F_{n_k}}$ is…
The purpose of this paper is to give some new identities for the Bernoulli, the Euler and the Genocchi numbers and polynomials.
We prove that the difference between the $n$-th hyperfibonacci number of $r$-th generation and its two consecutive predecessors is the $n$-th regular $(r-1)$-topic number. Using this fact we provide an equivalent recursive definition of…
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…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
We derive various weighted summation identities, including binomial and double binomial identities, for Tribonacci numbers. Our results contain some previously known results as special cases.
Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988. The version of this…
In \cite{Ka}, the authors obtained a method for deriving special matrices, whose powers are related to Fibonacci and Lucas numbers. In the study, it has been developed a method for deriving special matrices of $3\times 3$ dimensions, whose…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair…
We show that certain weighted Fibonacci and Lucas series can always be expressed as linear combinations of polylogarithms. In some special cases we evaluate the series in terms of Bernoulli polynomials, making use of the connection between…