Related papers: Period patterns, entry points, and orders in the L…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
We study logical limit laws for uniform attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $n+1$, the vertex $n+1$ is introduced together with $m$ edges joining the new vertex with…
Let n points be taken at random on a circle of unit circumference and clockwise ordered. Uniform spacings are defined as the clockwise arc-lengths between the successive points from this sample. We are interested in the asymptotic behavior…
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
A Fibonacci-Lucas based statistical model and several other related models are studied. The canonical and grand canonical partition functions for these models are developed.Partition structure such as the distribution of sizes as in a…
In these notes we address the study of the log-concave operator acting on Lucas Sequences of first kind. We will find for which initial values a generic Lucas sequence is log-concave, and using this we show when the same sequence is…
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 1955, Fermi, Pasta, Ulam, and Tsingou reported recurrence over time of energy between modes in a one-dimensional array of nonlinear oscillators. Subsequently, there have been myriad numerical experiments using homogenous FPUT arrays,…
In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…
Inversion sequences are finite sequences of non-negative integers, where the value of each entry is bounded from above by its position. Patterns in inversion sequences have been studied by Corteel-Martinez-Savage-Weselcouch and…
We study the distribution of the statistics 'number of fixed points' and 'number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving…
The only recurrence sequence satisfying the Fibonacci recurrence and realizable as the number of periodic points of a map is (a multiple of) the Lucas sequence.
Recurrence is a fundamental property of dynamical systems, which can be exploited to characterise the system's behaviour in phase space. A powerful tool for their visualisation and analysis called recurrence plot was introduced in the late…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with constant coefficients. This generalizes a result of…
The symmetric numerical semigroups S(F_a,F_b,F_c) and S(L_k,L_m,L_n) generated by three Fibonacci (F_a,F_b,F_c) and Lucas (L_k,L_m,L_n) numbers are considered. Based on divisibility properties of the Fibonacci and Lucas numbers we establish…
We study the Fibonacci and Lucas numbers and demonstrate how identities can be constructed by investigating trivalent graphs and splitting fields.
Harmonic numbers $H_k=\sum_{0<j\le k}1/j (k=0,1,2,...)$ arise naturally in many fields of mathematics. In this paper we initiate the study of congruences involving both harmonic numbers and Lucas sequences. One of our three theorems is as…
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by…