Abstract
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.
Similar content being viewed by others
References
V. Uspenskii, N. Vereshchagin, and A. Shen’, “Kolmogorov Complexity,” http://lj.streamclub.ru/books/complex/uspen.ps
V. I. Arnold, “Complexity of Finite Sequences of Zeros and Ones and Geometry of Finite Spaces of Functions,” http://mms.math-net.ru/meetings/2005/arnold.pdf
V. I. Arnold, “Complexity of Finite Sequences of Zeros and Ones and Geometry of Finite Spaces of Functions,” Funct. Anal. Other Math. 1(1), 1–15 (2006).
V. I. Arnold, “Complexity of Finite Sequences of Zeros and Ones and Geometry of Finite Spaces of Functions (Lecture at the Great Concert Hall “Academic,” Russian Academy of Sciences, May 13, 2006),” http://elementy.ru/lib/430178/430281
A. I. Garber, “Graphs of Difference Operators for p-ary Sequences,” Funct. Anal. Other Math. 1(2), 159–173 (2006).
O. N. Karpenkov, “On Examples of Difference Operators for {0, 1}-Valued Functions over Finite Sets,” Funct. Anal. Other Math. 1(2), 175–180 (2006).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.I. Garber, 2008, published in Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2008, Vol. 263, pp. 64–71.
Rights and permissions
About this article
Cite this article
Garber, A.I. Graphs of linear operators. Proc. Steklov Inst. Math. 263, 57–64 (2008). https://doi.org/10.1134/S0081543808040056
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543808040056