Search

Your search keyword '"A. Ya. Kanel-Belov"' showing total 13 results
Start Over Author "A. Ya. Kanel-Belov"
13 results on '"A. Ya. Kanel-Belov"'

3. Victor Timofeevich Markov (21.06.1948–15.07.2019)

Author

N. M. Adrianov, V. A. Artamonov, I. N. Balaba, Yu. A. Bahturin, L. A. Bokut, V. V. Borisenko, E. I. Bunina, I. A. Chubarov, S. A. Gaifullin, S. T. Glavatskii, I. Z. Golubchik, S. González, A. V. Grishin, A. E. Guterman, N. I. Dubrovin, N. K. Ilyina, A. Ya. Kanel-Belov, A. L. Kanunnikov, E. S. Kislitsyn, V. K. Kharchenko, A. A. Klyachko, I. B. Kozhukhov, E. M. Kreines, O. V. Kulikova, T. P. Lukashenko, O. V. Markova, C. Martínez, A. A. Mikhalev, A. V. Mikhalev, A. Yu. Olshanskii, S. V. Pchelintsev, A. E. Pentus, A. V. Petrov, Yu. G. Prokhorov, A. A. Shafarevich, A. I. Shafarevich, I. P. Shestakov, E. E. Shirshova, V. E. Shpilrain, V. V. Tenzina, D. A. Timashev, A. A. Tuganbaev, I. N. Tumaykin, M. V. Zaicev, and E. I. Zelmanov

Subjects
Statistics and Probability, Applied Mathematics, General Mathematics
Published
2022
Full Text
View/download PDF

4. Yuri Valentinovich Nesterenko(to the 75th anniversary)

Author

A.I. Shafarevich, A.T. Fomenko, V.N. Chubarikov, A.O. Ivanov, V.G. Chirsky, V.I. Bernik, V.A. Bykovskii, A.I. Galochkin, S.S. Demidov, S.B. Gashkov, A.I. Nizhnikov, A.A. Fomin, E.I. Deza, A. Ya. Kanel-Belov, N.M. Dobrovolsky, N.N. Dobrovolsky, I. Yu. Rebrova, and V. Kh. Salikhov

Subjects
General Mathematics
Published
2022
Full Text
View/download PDF

6. Collectives of Automata in Finitely Generated Groups

Author

Il'ya Anatol'evich Ivanov-Pogodaev, D. V. Gusev, and A. Ya. Kanel-Belov

Subjects
Discrete mathematics, Computational complexity theory, Cayley graph, Group (mathematics), General Mathematics, Automata theory, Context (language use), Finitely generated group, Algebraic number, Element (category theory), Mathematics
Abstract

The present paper is devoted to traversing a maze by a collective of automata. This part of automata theory gave rise to a fairly wide range of diverse problems ([1], [2]), including those related to problems of the theory of computational complexity and probability theory. It turns out that the consideration of complicated algebraic objects, such as Burnside groups, can be interesting in this context. In the paper, we show that the Cayley graph a finitely generated group cannot be traversed by a collective of automata if and only if the group is infinite and its every element is periodic.

Published
2020
Full Text
View/download PDF

7. Criterion for Substitutivity of Sturmian Palindromes and One-Dimensional Factor Dynamics

Author

I. A. Reshetnikov and A. Ya. Kanel’-Belov

Subjects
Factor (chord), Pure mathematics, General Mathematics, Dynamics (mechanics), Palindrome, Computer Science::Formal Languages and Automata Theory, Mathematics
Abstract

The paper provides a criterion for substitutivity of symmetric Sturmian words infinite on both sides and its proof, and a theorem on the substitutivity of factor dynamics of circle rotations.

Published
2020
Full Text
View/download PDF

13. AlgebraDayJun2104

Author

Makar-Limanov, Leonid, A. Ya. Kanel-Belov, Lam, Chi-Ming, Racine, Michel, Zelmanov, Efim, Man-Keung Siu, and Lance Small

Published
2004
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results