The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence F in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] (see also [4,5]) admits such an extension so as to encompass the new type combinatorial objects from [2] as leading examples. Recently the present author had introduced also [6] two natural part...

A Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci numbers. For example, 77 = 21 · 55/(3 · 5) is a Fibonacci integer. Using some results about the structure of this multiplicative group, we determine a near-asymptotic formula for the counting function of the Fibonacci integers, showing that up to x the number of them is between exp(c(log x) − (log x)) and e...

It is proved that the asymptotic average eccentricity and the asymptotic average degree of both Fibonacci cubes and Lucas cubes are (5 + √ 5)/10 and (5 − √ 5)/5, respectively. A new labeling of the leaves of Fibonacci trees is introduced and it is proved that the eccentricity of a vertex of a given Fibonacci cube is equal to the depth of the associated leaf in the corresponding Fibonacci tree. ...

The focus of this paper is to study the HOMFLY polynomial of (2, n)-torus link as a generalized Fibonacci polynomial. For this purpose, we first introduce a form of generalized Fibonacci and Lucas polynomials and provide their some fundamental properties. We define the HOMFLY polynomial of (2, n)-torus link with a way similar to our generalized Fibonacci polynomials and provide its fundamental ...

The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively. In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the independent sets of the h power of a path ordered by inclusion. For h = 1 such a diagram is called a Fibonacci cube, and for h > 1 we obtain a generalization of th...

In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the “color-to-spin” property, that is, the property that the total color of the permutation equals the sum of the spins of the domino tableaux. In this paper, we describe the poset of domino Fibonacci shapes, an isomorphic equivalent to Stanley’s Fibonacci lattice...

The Fibonacci cube Γn is a subgraph of n-dimensional hypercube induced by the vertices without two consecutive ones. Klavžar and Žigert [Fibonacci cubes are the resonance graphs of fibonaccenes, Fibonacci Quart. 43 (2005) 269–276] proved that Fibonacci cubes are precisely the Z -transformation graphs (or resonance graphs) of zigzag hexagonal chains. In this paper, we characterize plane bipartit...

Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. The domination number γ of Fibonacci cubes and Lucas cubes is studied. In particular it is proved that γ(Λn) is bounded below by ⌈ Ln−2n n−3 ⌉ , where Ln is the n-th Lucas number. The 2-packing number ρ of these cubes is also studied. It is proved that ρ(Γn) is bounded below by 2 blg nc 2 −1 and the exact values of ...

In this work, we propose a CODEC design for the forbidden transition free crosstalk avoidance CODEC. Our mapping and coding scheme is based on the binary number system. In this paper we investigate and propose a bus forbidden transition free CODECs for reducing bus delay and our experimental results shows that the proposed CODEC complexity is orders of magnitude better compared to the existing ...