A short proof of Bernoulli disjointness via the local lemma
A short proof of Bernoulli disjointness via the local lemma
复制标题
通过局部引理对伯努利不相交性的简短证明
DOI:
10.1090/proc/15151
复制
发表时间:
2020
影响因子:
1
通讯作者:
Bernshteyn, Anton
中科院分区:
文献类型:
--
作者:
Bernshteyn, Anton
Recently, Glasner, Tsankov, Weiss, and Zucker showed that ifis an infinite discrete group, then every minimal-flow is disjoint from the Bernoulli shift. Their proof is somewhat involved; in particular, it invokes separate arguments for different classes of groups. In this note, we give a short and self-contained proof of their result using purely combinatorial methods applicable to all groups at once. Our proof relies on the Lovász Local Lemma, an important tool in probabilistic combinatorics that has recently found several applications in the study of dynamical systems. References
登录
查看更多内容
DOI:
10.1145/1993636.1993669
发表时间:
2011-06
期刊:
Proceedings of the forty-third annual ACM symposium on Theory of computing
影响因子:
--
作者:
K. Kolipaka;M. Szegedy
通讯作者:
K. Kolipaka;M. Szegedy
DOI:
--
发表时间:
2015
期刊:
Groups, Geometry, and Dynamics
影响因子:
--
作者:
Nathalie Aubrun;S. Barbieri;St'ephan Thomass'e
通讯作者:
St'ephan Thomass'e
影响因子:
3.1
作者:
Joshua Frisch;O. Tamuz;Pooya Vahidi Ferdowsi
通讯作者:
Pooya Vahidi Ferdowsi
影响因子:
1
作者:
Anton Bernshteyn
通讯作者:
Anton Bernshteyn