Tables of graphs of binary and ternary sequences differentiation
E.Yu. Lerner

TL;DR
This paper provides graphical representations of the dynamic system of difference operations on cyclic sequences over finite fields, aiding in the analysis of Arnold hypotheses for binary and ternary sequences.
Contribution
It presents detailed graphs of the difference operation dynamics for sequences over finite fields, supporting the analysis and proof of Arnold hypotheses.
Findings
Graphs of the difference operation system for sequences over =2, n300
Graphs of the difference operation system for sequences over =3, n150
Supports proof and analysis of Arnold hypotheses
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cellular Automata and Applications
