Related papers: The extended Frobenius problem for Fibonacci seque…
The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…
Given a numerical semigroup $S$ and a positive integer $p$, the quotient $\frac{S}{p}=\{x\in \mathbb{N} \mid px\in S\}$ also forms a numerical semigroup. In this paper, we first characterize the Ap\'ery set for a class of quotients of…
We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…
We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…
Let $S\neq\mathbb N$ be a numerical semigroup with Frobenius number $f$, genus $g$ and embedding dimension $e$. In 1978 Wilf asked the question, whether $\frac{f+1-g}{f+1}\geq\frac1e$. As is well known, this holds in the cases $e=2$ and…
In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates…
In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…
We give an affirmative answer to Wilf's conjecture for numerical semigroups satisfying 2 \nu \geq m, where \nu and m are respectively the embedding dimension and the multiplicity of a semigroup. The conjecture is also proved when m \leq 8…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
We establish relations between Frobenius parts and between flat-dominant dimensions of algebras linked by Frobenius bimodules. This is motivated by the Nakayama conjecture and an approach of Martinez-Villa to the Auslander-Reiten conjecture…
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…
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…
The link between the equation $b(b+a)-a^2=0$ concerning the side $b$ and the diagonal $a$ of a regular pentagon and the {\it Cassini identity} $F_{i}F_{i+2}-F_{i+1}^2=(-1)^{i}$, concerning three consecutive Fibonacci numbers, is very…
We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their…
In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…
In recent work, M. Just and the second author defined a class of "semi-modular forms" on $\mathbb C$, in analogy with classical modular forms, that are "half modular" in a particular sense; and constructed families of such functions as…