Tables of graphs of binary and ternary sequences differentiation
Number Theory
2007-10-10 v2 Dynamical Systems
Abstract
Let be a cyclic sequence of elements of the finite field (the first element immediately follows the -th one). Let us define the operation as the transition from to the sequence of differences of the neighbouring elements from . The aim of this work is to give graphs of the dynamic system for , and , . These results enable us to define more precisely the Arnold hypotheses and to prove them.
Keywords
Cite
@article{arxiv.0704.2947,
title = {Tables of graphs of binary and ternary sequences differentiation},
author = {E. Yu. Lerner},
journal= {arXiv preprint arXiv:0704.2947},
year = {2007}
}
Comments
16 pages, 2 large tables, program on Mathematica