Informatics and Automation, Geometry, topology, and mathematical physics. I, Tome 263 (2008), pp. 64-71
Citer cet article
A. I. Garber. Graphs of Linear Operators. Informatics and Automation, Geometry, topology, and mathematical physics. I, Tome 263 (2008), pp. 64-71. http://geodesic.mathdoc.fr/item/TRSPY_2008_263_a4/
@article{TRSPY_2008_263_a4,
author = {A. I. Garber},
title = {Graphs of {Linear} {Operators}},
journal = {Informatics and Automation},
pages = {64--71},
year = {2008},
volume = {263},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TRSPY_2008_263_a4/}
}
TY - JOUR
AU - A. I. Garber
TI - Graphs of Linear Operators
JO - Informatics and Automation
PY - 2008
SP - 64
EP - 71
VL - 263
UR - http://geodesic.mathdoc.fr/item/TRSPY_2008_263_a4/
LA - ru
ID - TRSPY_2008_263_a4
ER -
%0 Journal Article
%A A. I. Garber
%T Graphs of Linear Operators
%J Informatics and Automation
%D 2008
%P 64-71
%V 263
%U http://geodesic.mathdoc.fr/item/TRSPY_2008_263_a4/
%G ru
%F TRSPY_2008_263_a4
In 2006 the author proposed an algorithm for constructing graphs of difference operators. In this paper, the following question is studied: to which linear operators $\mathcal A$ does this algorithm apply? Graphs of difference operators are used to determine the complexity of a sequence in the sense of Arnold, so the algorithm makes it possible to determine the complexity of any sequence.
[3] Arnold V. I., “Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions”, Funct. Anal. and Other Math., 1:1 (2006), 1–15 | DOI | MR
[4] Arnold V. I., Slozhnost konechnykh posledovatelnostei nulei i edinits i geometriya konechnykh funktsionalnykh prostranstv, Lektsiya 13.05.2006 g. BKZ Akad. RAN http:// elementy.ru/lib/430178/430281
[5] Garber A. I., “Graphs of difference operators for $p$-ary sequences”, Funct. Anal. and Other Math., 1:2 (2006), 159–173 | DOI | MR | Zbl
[6] Karpenkov O. N., “On examples of difference operators for $\{0,1\}$-valued functions over finite sets”, Funct. Anal. and Other Math., 1:2 (2006), 175–180 | DOI | MR | Zbl