

Dobrushin Mathematics Laboratory Seminar
September 1, 2015 16:00, Moscow, room 307, IITP RAS (Bolshoy Karetniy per., 19)






Words in linear groups, random walks, automata and Precursiveness
I. M. Pak^{} ^{} University of California, Los Angeles

Number of views: 
This page:  80 

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 Precursive. This answers a
question of Kontsevich.

