solidot新版网站常见问题,请点击这里查看。

Mallows Permutations and Finite Dependence. (arXiv:1706.09526v1 [math.PR])

来源于:arXiv
We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as finitary factors of i.i.d. processes with finite mean coding radii. They are the first colorings known to have these properties. Moreover, we prove that the coding radii have exponential tails, and that the colorings can also be expressed as functions of countable-state Markov chains. We deduce analogous existence statements concerning shifts of finite type and higher-dimensional colorings. 查看全文>>