Binomial-coefficient multiples of irrationals (Q1386700)

The Pascal graph is a directed infinite planar graph with vertex set \(\{(n,k): n=0,1,\dots; k= 0,1,\dots, n\}\). There are two edges coming out of each vertex \((n,k)\), one to \((n+ 1,k)\), labeled 0, and the other to \((n+ 1,k+1)\), labeled 1. In this way, one obtains a natural correspondence between infinite sequences \(x\) in \(\{0,1\}^{\mathbb{N}}\), and infinite paths in the Pascal graph. Denote by \(d_n(x)\) the binomial coefficient at the \(n\)th vertex of \(x\) (here the Pascal graph is superimposed on the Pascal triangle). Consider the Pascal-adic transformation \(T\) on \(\{0,1\}^{\mathbb{N}}\) given by \(T(1^p 0^q01\cdots)= (0^q 1^p10\cdots)\), \(p,q\geq 0\). The Pascal-adic transformation was studied by \textit{A. M. Vershik} [Dokl. Akad. Nauk SSSR 218, 749-752 (1974; Zbl 0324.28014)], who showed that the only invariant ergodic measures for this map are the Bernoulli measures \(\mu_\alpha= {\mathcal B}(\alpha, 1-\alpha)\) and conjectured that \(T\) is weakly mixing. \textit{K. Petersen} and \textit{K. Schmidt} [Trans. Am. Math. Soc. 349, No. 7, 2775-2811 (1997; Zbl 0873.28008)] have shown that if \(\lambda\) is an eigenvalue of \(T\), then \(\lambda^{d_n(x)}\to 1\) for a.e. \(x\). In the paper under review, the authors construct a dense \(G_\delta\) set of \(\lambda\)'s on the unit circle such that, for a.e. path \(x\) (with respect to the Bernoulli measure \(\mu_\alpha\)) \(\lambda^{d_n(x)}\) is almost surely dense but not uniformly distributed modulo 1.