Forgot your password?
scientific activity
structureeducational projectsperiodicalsstaffpress centercontacts
­ˇ˝˝ŕŔÚ | english

Dobrushin Mathematical Laboratory Seminar

Dobrushin Mathematical Laboratory Seminar, 01.09.2015, 16:00, room 307

Igor Pak (UCLA):

Words in linear groups, random walks, automata and P-recursiveness



Fix a finite set $S subset GL(k,Z)$ and denote by $an$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence ${an}$ is not always P-recursive. This answers a question of Kontsevich.

26.08.2015 | Leonid Petrov


  © Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), 2021
About  |  Contacts  |  The old version of this site