Related papers: On upper bounds of frieze patterns
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenth- or seventeenth powers in the Fibonacci sequence. For eleventh, thirteenth- and seventeenth powers an alternative (to the usual exhaustive check of products…
Inspired by the surprising relationship (due to A. Bird) between Schreier sets and the Fibonacci sequence, we introduce Schreier multisets and connect these multisets with the $s$-step Fibonacci sequences, defined, for each $s\geqslant 2$,…
Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…
The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.
We study pattern densities in binary sequences, finding optimal limit sequences with fixed pattern densities.
In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…
Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.
Frieze patterns of numbers, introduced in the early 70's by Coxeter, are currently attracting much interest due to connections with the recent theory of cluster algebras. The present paper aims to review the original work of Coxeter and the…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
A random Fibonacci sequence is defined by the relation g_n = | g_{n-1} +/- g_{n-2} |, where the +/- sign is chosen by tossing a balanced coin for each n. We generalize these sequences to the case when the coin is unbalanced (denoting by p…
Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…
By viewing $\tilde{A}$ and $\tilde{D}$ type cluster algebras as triangulated surfaces, we find all cluster variables in terms of either (i) the frieze pattern (or bipartite belt) or (ii) the periodic quantities previously found for the…
It is proved that for $n \geq 6$, the number of perfect matchings in a simple connected cubic graph on $2n$ vertices is at most $4 f_{n-1}$, with $f_n$ being the $n$-th Fibonacci number. The unique extremal graph is characterized as well.…
In this paper, we discuss about some results on average of Fibonacci and Lucas sequences that may be found in the OEIS code A111035.
This note proves an upper bound for the fluctuations of a second-class particle in the totally asymmetric simple exclusion process. The proof needs a lower tail estimate for the last-passage growth model associated with the exclusion…
A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…
We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…