Related papers: On upper bounds of frieze patterns
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word $x$…
We consider random Fibonacci sequences given by $x_{n+1}=\pm \beta x_{n}+x_{n-1}$. Viswanath (\cite{viswanath}), following Furstenberg (\cite{furst}) showed that when $\beta = 1$, $\lim_{n\to \infty}|x_{n}|^{1/n}=1.13...$, but his proof…
We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…
Let $(F_n)_{n\ge 1}$ be the Fibonacci sequence. Define $P(F_n): = (\sum_{i=1}^n F_i)_{n\ge 1}$; that is, the function $P$ gives the sequence of partial sums of $(F_n)$. In this paper, we first give an identity involving $P^k(F_n)$, which is…
The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…
A fan $F_n$ is a graph consisting of $n$ triangles, all having precisely one common vertex. Currently, the best known bounds for the Ramsey number $R(F_n)$ are $9n/2-5 \leq R(F_n) \leq 11n/2+6$, obtained by Chen, Yu and Zhao. We improve the…
In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…
In this article, we study infinite friezes arising from cluster categories of affine type $D$ and determine the growth coefficients for these friezes. We prove that for each affine type $D$, the friezes given by the tubes all have the same…
In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…
We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…
We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic…
Frieze patterns are defined by objects of a category of Dyck paths, to do that, it is introduced the notion of diamond of Dynkin type An. Such diamonds constitute a tool to build integral frieze patterns.
A Schreier set $S$ is a subset of the natural numbers with $\min S\ge |S|$. It has been known that the sequence $(a_{1,n})$, where $$a_{1,n}\ :=\ |\{S\subseteq \mathbb{N}\,:\,\max S = n\mbox{ and } \min S \ge |S|\}|,$$ is the Fibonacci…
Exploiting an iterative formula already introduced in a previous manuscript to count the number $O_d$ of finite $O$-sequences of multiplicity $d$, we obtain some new information about $O_d$. Letting $A_d$ be the number of the finite…
The following magic trick is at the center of this paper. While the audience writes the first ten terms of a Fibonacci-like sequence (the sequence following the same recursion as the Fibonacci sequence), the magician calculates the sum of…
The famous theorem of Conway and Coxeter on frieze patterns gave a geometric interpretation to integral friezes via triangulations of polygons. In this article, we review this result and show some of the development it has led to. The last…
In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two…
We classify 2-periodic mesh friezes of finite type $A$, $D$ or $E$ with positive real entries. There are families with 0,1, or 2 parameters, depending on type.
In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interested in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general…