نتایج جستجو برای: fibonacci hypercube
تعداد نتایج: 6802 فیلتر نتایج به سال:
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...
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 ...
Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from elementary properties of the Fibonacci numbers. 1 Preliminaries The well-known sequence of Fibonacci numbers (sequence A000045 in the On-Line Encyclopedia of Int...
Various generalizations of the Fibonacci numbers have been proposed, studied and applied over the years (see [5] for a brief list). Probably the best known are the k-generalized Fibonacci numbers F (k) n (also known as the k-fold Fibonacci, k-th order Fibonacci, k-Fibonacci or polynacci numbers), satisfying F (k) n = F (k) n−1 + F (k) n−2 + . . .+ F (k) n−k , n ≥ k , F (k) n = 0 , 0 ≤ n ≤ k − 2...
The Fibonacci operator approach inspired by Andrews (2004) is explored to investigate q-analogs of the generalized Fibonacci and Lucas polynomials introduced by Chu and Vicenti (2003). Their generating functions are compactly expressed in terms of Fibonacci operator fractions. A determinant evaluation on q-binomial coefficients is also established which extends a recent result of Sun (2005).
one of the most important number sequences in mathematics is fibonacci sequence. fibonacci sequence except for mathematics is applied to other branches of science such as physics and arts. in fact, between anesthetics and this sequence there exists a wonderful relation. fibonacci sequence has an importance characteristic which is the golden number. in this thesis, the golden number is observed ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید