On a series of cosecants related to a problem in ergodic theory
A finite-state stationary process is called (one- or two-sided) super-K if its (one- or two-sided) super-tail field-generated by keeping track of (initial or central) symbol counts as well as of arbitrarily remote names-is trivial. We prove that for every process (α,T) which has a direct Bernoulli factor there is a generating partition β whose one-sided super-tail equals the usual one-sided tail of β. Consequently, every K-process with a direct Bernoulli factor has a one-sided super-K generator....
There is only one fully supported ergodic invariant probability measure for the adic transformation on the space of infinite paths in the graph that underlies the eulerian numbers. This result may partially justify a frequent assumption about the equidistribution of random permutations.
Page 1