Related papers: On upper bounds of frieze patterns
Frieze patterns (in the sense of Conway and Coxeter) are related to cluster algebras of type A and to signed continuant polynomials. In view of studying certain classes of cluster algebras with coefficients, we extend the concept of signed…
In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…
A frieze is an array of numbers obeying the unimodular rule. Coxeter showed that a frieze with integer entries corresponds to a triangulation. Recently, Holm and J{\o}rgenson introduced friezes of type $\Lambda_p$ which correspond to…
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…
We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In…
For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. The it is well known that only finitely many positive integers…
We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…
Frieze patterns have an interesting combinatorial structure, which has proven very useful in the study of cluster algebras. We introduce $(k,n)$-frieze patterns, a natural generalisation of the classical notion. A generalisation of the…
Conway and Coxeter have shown that frieze patterns over positive rational integers are in bijection with triangulations of polygons. An investigation of frieze patterns over other subsets of the complex numbers has recently been initiated…
Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…
Frieze patterns are combinatorial objects that are deeply related to cluster theory. Determinants of frieze patterns arise from triangular regions of the frieze, and they have been considered in previous works by Broline-Crowe-Isaacs, and…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. Then it is well known that only finitely many positive integers…
A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map \[ D : (a_1, a_2, \ldots, a_n) \mapsto \big(|a_1-a_2|,|a_2-a_3|,\ldots,|a_n-a_1|\big). \] Such a sequence is eventually periodic and we denote by $P(n)$ the…
The focus of this paper is the random sequences in the form $\{X_{0},X_{1},$ $X_{n}=X_{n-2}+X_{n-1},n=2,3,..\dot{\}},$ referred to as Fibonacci Random Sequence (FRS). The initial random variables $X_{0}$ and $X_{1}$ are assumed to be…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
The order of the set of equivalent resistances, A(n) of n equal resistors combined in series and in parallel has been traditionally addressed computationally, for n up to 22. For larger n there have been constraints of computer memory.…
Let $B$ be a finite set of natural numbers or complex numbers. Product set corresponding to $B$ is defined by $B.B:=\{ab:a,b\in B\}$. In this paper we give an upper bound for longest length of consecutive terms of a polynomial sequence…
We examine clusters in the cluster tube of rank $n+1$ using exceptional sequences in the abelian tube of rank $n+1$. Although the abelian tube has more exceptional sequences than the module categories of type $B_{n}/C_{n}$, we obtain a…
Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…