相关论文: The Fibonacci Sequence Mod m

We consider a sequence of sums of powers of the the roots of the cubic equation characterizing the Tribonacci sequences and derive its relationship with a particular Tribonacci sequence. Then we make a conjecture on the possible…

Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many…

The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their…

We use probability urn models to discover some known and unknown series identities involving Fibonacci numbers.

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…

It's well known that the quadratic residue code over finite fields is an interesting class of cyclic codes for its higher minimum distance. Let $g$ be a positive integer and $p,p_{1},\ldots, p_{g}$ be distinct odd primes, the present paper…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

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…

This paper provides a comprehensive analysis of almost maximum distance separable (AMDS) constacyclic codes of length $4p^{\varsigma}$ over the finite field $\mathbb{F}_{p^m}$, where $p$ is an odd prime number. Furthermore, it introduces…

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

For a real sequence of length of m = nl, we may deduce its congruence derivative sequence with length of l. The discrete Fourier transform of original sequence can be calculated by the discrete Fourier transform of the congruence derivative…

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…

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…

An artificial neural network can be used to generate a series of numbers. A boolean perceptron generates bit sequences with a periodic structure. The corresponding spectrum of cycle lengths is investigated analytically and numerically; it…

We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic points and tails in the case of modulo a prime to…

The Fibonacci word is the fixed point beginning with the letter $a$ of morphism $\sigma(a)=ab$, $\sigma(b)=a$ defined over the alphabet $\{a,b\}$. In this paper, we get explicit expression of the number of distinct fractional powers in each…

LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of short length in the associated Tanner graph, i.e. obtaining…