Period Multiplying Operators on Integer Sequences Modulo A Prime
نویسنده
چکیده
We study properties of operators defined on the space E+(p) of right half-infinite sequences with entries chosen from Zp where p is prime. The operators in question allow solution of the problem of finding predecessor states for certain cellular automata evolutions and they can be thought of as discrete integration with respect to sequence index. These operators are self-accumulating, not solipsistic, and have no dense orbits. In addition, they exhibit a period-multiplying property. Many of these results are derived from properties of Pascal's triangle modulo p which are presented in an appendix.
منابع مشابه
On Periods modulo a Prime of Some Classes of Sequences of Integers
Theorem 1: Let un, n > 0, be the general term of a given sequence of integers and define the transformation T^yk)(un) as T^xyJc){un) = xun+lc +yun for every n > 0, A: being a positive integer. Then, if x mdy are nonzero integers and there exists a positive prime number/? which divides T(x,y,k)(n) f° every n>0 and is relatively prime to x, the distribution of the residues of (un) modulo p is eit...
متن کاملGeneralized Fibonacci Sequences modulo Powers of a Prime
Let us begin by defining a generalized Fibonacci sequence (gn) with all gn in some abelian group as a sequence that satisfies the recurrence gn = gn−1 + gn−2 as n ranges over Z. The Fibonacci sequence (Fn) is the generalized Fibonacci sequence with integer values defined by F0 = 0 and F1 = 1. Recall also the Binet formula: for any integer n, Fn = (α − β)/ √ 5, where α = (1 + √ 5)/2 and β = (1− ...
متن کاملOn the distinctness of modular reductions of maximal length sequences modulo odd prime powers
We discuss the distinctness problem of the reductions modulo M of maximal length sequences modulo powers of an odd prime p, where the integer M has a prime factor different from p. For any two different maximal length sequences generated by the same polynomial, we prove that their reductions modulo M are distinct. In other words, the reduction modulo M of a maximal length sequence is proved to ...
متن کاملRecursive sequences and polynomial congruences
We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω = x + f as a unit in the quotient ring ޚ m [ω] = ޚ m [x]/ f. When m = p is prime, this order can be ...
متن کاملThe period of the Bell numbers modulo a prime
We discuss the numbers in the title, and in particular whether the minimum period of the Bell numbers modulo a prime p can be a proper divisor of Np = (pp − 1)/(p− 1). It is known that the period always divides Np. The period is shown to equal Np for most primes p below 180. The investigation leads to interesting new results about the possible prime factors of Np. For example, we show that if p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 3 شماره
صفحات -
تاریخ انتشار 1989