|
|
Dobrushin Mathematics Laboratory Seminar
September 1, 2015 16:00, room 307, IITP RAS (Bolshoy Karetniy per., 19), Moscow
|
 |
|
 |
|
|
|
Words in linear groups, random walks, automata and P-recursiveness
I. M. Pak
University of California, Los Angeles
|
| Number of views: |
| This page: | 165 |
|
Abstract:
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.
|
|
Contact us: