Graphs of difference operators for p-ary sequences |
| |
| Authors: | Alexey I Garber |
| |
| Institution: | (1) Steklov Mathematical Institute, 8 Gubkina St., Moscow, 119991, Russia |
| |
| Abstract: | For a given prime p and positive integer n, we consider the graph G
n
of the difference operator acting on p-ary sequences of length n. We suggest new proofs of some results of V.I. Arnold on the graph G
n
and the complexity of sequences and obtain new results for the length of a maximal cycle in the general case of p-ary sequences. We also provide estimates for the number of complicated sequences.
|
| |
| Keywords: | Finite sequence Complexity of sequence Directed graph Difference operator |
| 本文献已被 SpringerLink 等数据库收录！ |
