Tables of graphs of binary and ternary sequences differentiation
| dc.creator | Lerner, E. Yu. | |
| dc.date | 2007-04-23 | |
| dc.date | 2007-10-10 | |
| dc.date.accessioned | 2026-07-07T08:34:53Z | |
| dc.date.available | 2026-07-07T08:34:53Z | |
| dc.description | Let $x$ be a cyclic sequence of $n$ elements of the finite field $\mathbb{F}_q$ (the first element immediately follows the $n$-th one). Let us define the operation $Δ$ as the transition from $x$ to the sequence of differences of the neighbouring elements from $x$. The aim of this work is to give graphs of the dynamic system $Δ$ for $q=2$, $n\le 300$ and $q=3$, $n\le 150$. These results enable us to define more precisely the Arnold hypotheses and to prove them. | |
| dc.description | 16 pages, 2 large tables, program on Mathematica | |
| dc.identifier | https://arxiv.org/abs/0704.2947 | |
| dc.identifier | http://arxiv.org/abs/0704.2947 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/139590 | |
| dc.subject | Number Theory | |
| dc.subject | Dynamical Systems | |
| dc.subject | 11T06; 11T24; 37E15 | |
| dc.title | Tables of graphs of binary and ternary sequences differentiation | |
| dc.type | text |