Results 151 to 160 of about 3,045 (188)
Some of the next articles are maybe not open access.
Random Structures and Algorithms, 2001
AbstractFibonacci Solitaire is a combinatorial algorithm which associates with a permutation of [n]={1,…,n} a partition of [n] into couples and singletons. We study the output configuration when the algorithm is applied to a random permutation, with emphasis on the large n‐asymptotics.
Alexander V. Gnedin, Sergei V. Kerov
openaire +2 more sources
AbstractFibonacci Solitaire is a combinatorial algorithm which associates with a permutation of [n]={1,…,n} a partition of [n] into couples and singletons. We study the output configuration when the algorithm is applied to a random permutation, with emphasis on the large n‐asymptotics.
Alexander V. Gnedin, Sergei V. Kerov
openaire +2 more sources
The Mathematical Gazette, 2003
An elementary algebraic problem attributed to Leonardo of Pisa is analyzed and some illogical elements in its formulation and solution are exposed. The natural context in which the problem was formulated is then proposed, and some consequences are discussed.
openaire +2 more sources
An elementary algebraic problem attributed to Leonardo of Pisa is analyzed and some illogical elements in its formulation and solution are exposed. The natural context in which the problem was formulated is then proposed, and some consequences are discussed.
openaire +2 more sources
On the (s, t)-Fibonacci and Fibonacci Matrix Sequences.
Ars Comb., 2008It is always fascinating to see what results when seemingly different areas mathematics overlap. This article reveals one such result; number theory and linear algebra are intertwined to yield complex factorizations of the classic Fibonacci, Pell, Jacobsthal, and Mersenne numbers.
Civciv, Hacı, Türkmen, Ramazan
openaire +2 more sources
A Study on Fibonacci Functions and Gaussian Fibonacci Functions
Sarajevo Journal of MathematicsIn this paper, we define Gaussian Fibonacci functions and investigate themon the set of real numbers $\mathbb{R},$ i.e., functions $f_{G}$ $:$$\mathbb{R}\rightarrow \mathbb{C}$ such that for all $x\in \mathbb{R},$ $%n\in \mathbb{Z},$ $f_{G}(x+n)=f(x+n)+if(x+n-1)$ where $f$ $:$ $\mathbb{R}%\rightarrow \mathbb{R}$ is a Fibonacci function which is given ...
Soykan, Yüksel +3 more
openaire +2 more sources
Fibonacci sayılar ve fibonacci grupları
2020SUMMARY Calculations of Fibonacci numbers with two steps have been investigated in the previous studies[l]. In addition to the studies, the additive calculations of odd, even and succesive indices of Fibonacci numbers with three steps are studied. Basic properties of the Fibonacci groups are given and a relation matrix for A(r, n) which is the factor ...
openaire +1 more source
Coding theory on generalized Fibonaccin-step polynomials
Journal of Information and Optimization Sciences, 2017Manjusri Basu
exaly