Denote by {Fn} and {Ln} the Fibonacci numbers and Lucas numbers, respectively. Let Fn = Fn × Ln and Ln = Fn + Ln. Denote by {Pn} and {Qn} the Pell numbers and Pell-Lucas numbers, respectively. Let Pn = Pn × Qn and Qn = Pn + Qn. In this paper, we give some determinants and permanent representations of Pn, Qn, Fn and Ln. Also, complex factorization formulas for those numbers are presented. Key–Wo...

The Fibonacci (p, r)-cube is an interconnection topology, which includes a wide range of connection topologies as its special cases, such as the Fibonacci cube, the postal network, etc. Klavžar and Žigert [S. Klavžar, P. Žigert, Fibonacci cubes are the resonance graphs of fibonaccenes, Fibonacci Quart. 43 (2005) 269–276] proved that Fibonacci cubes are just the Z-transformation graphs (also cal...

A permutation π ∈ Sn is said to avoid a permutation σ ∈ Sk whenever π contains no subsequence with all of the same pairwise comparisons as σ. In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 123, 132, and 213 is the Fibonacci number Fn+1. In this paper we generalize this result in two ways. We first show that the number of permutations which avoid 132, 213, an...

The problem of computing the number of sequences of various lengths that can be obtained by decimating a given binary sequence X of length n is considered. It is proven that this number is maximized iff X is an alternating sequence and that the maximum can be expressed in terms of the Fibonacci numbers. Some other upper bounds on this number are also determined, including another bound in terms...

Abstract. We study the statistics of column-convex lattice animals resulting from the stacking of squares on a single or double staircase. We obtain exact expressions for the number of animals with a given length and area, their mean length and their mean height. These objects are closely related to Fibonacci numbers. On a single staircase, the total number of animals with area k is given by th...

The Fibonacci cube Γn is the subgraph of the n-dimensional cube Qn induced by the vertices that contain no two consecutive 1s. Using integer linear programming, exact values are obtained for γt(Γn), n ≤ 12. Consequently, γt(Γn) ≤ 2Fn−10 + 21Fn−8 holds for n ≥ 11, where Fn are the Fibonacci numbers. It is proved that if n ≥ 9, then γt(Γn) ≥ d(Fn+2 − 11)/(n− 3)e−1. Using integer linear programmin...

Let F n be the nth Fibonacci number. The order of appearance zn of a natural number n is defined as the smallest natural number k such that n divides F k. For instance, for all n F m ≥ 5, we have zn − 1 > zn < zn 1. In this paper, we will construct infinitely many natural numbers satisfying the previous inequalities and which do not belong to the Fibonacci sequence.

We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the hth power of a path ordered by inclusion. For h = 1 such a value is the number of edges of a Fibonacci cube. We show that, in general, the number of edges of the diagram is obtained by convolution of a Fibonacci-like sequence with itself.

Image scrambling is used to make images visually unrecognizable such that unauthorized users have difficulty decoding the scrambled image to access the original image. This article presents two new image scrambling algorithms based on Fibonacci p-code, a parametric sequence. The first algorithm works in spatial domain and the second in frequency domain (including JPEG domain). A parameter, p, i...

Complex biological patterns are often governed by simple mathematical rules. A favourite botanical example is the apparent relationship between phyllotaxis (i.e. the arrangements of leaf homologues such as foliage leaves and floral organs on shoot axes) and the intriguing Fibonacci number sequence (1, 2, 3, 5, 8, 13 . . .). It is frequently alleged that leaf primordia adopt Fibonacci-related pa...