On the generalized Fibonacci sequences of polynomials over finite fields
Copyright policy )On the generalized Fibonacci sequences of polynomials over finite fields
In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute them, and we also obtain some properties about the quotient of the period and the rank. We find that the polynomial case is much more complicated than the integer case.
33 pages
- South China Normal University China (People's Republic of)
period, rank, polynomial, Mathematics - Number Theory, FOS: Mathematics, Fibonacci and Lucas numbers and polynomials and generalizations, Number Theory (math.NT), generalized Fibonacci sequence, finite field, Sequences (mod \(m\)), Polynomials over finite fields
period, rank, polynomial, Mathematics - Number Theory, FOS: Mathematics, Fibonacci and Lucas numbers and polynomials and generalizations, Number Theory (math.NT), generalized Fibonacci sequence, finite field, Sequences (mod \(m\)), Polynomials over finite fields
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!