A short proof of Bernoulli disjointness via the local lemma

DOI10.1090/proc/15151zbMath1456.37041arXiv1907.08507OpenAlexW3021519371WikidataQ124985497 ScholiaQ124985497MaRDI QIDQ5130866

Anton Bernshteyn

Publication date: 29 October 2020

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.08507

zbMATH Keywords

Lovász local lemmadisjointnessminimal flowsBernoulli flow

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Symbolic dynamics (37B10) Dynamical systems involving transformations and group actions with special properties (minimality, distality, proximality, expansivity, etc.) (37B05) Combinatorial dynamics (types of periodic orbits) (37E15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Dynamics in general topological spaces (37B02)

Related Items (1)

Bernoulli disjointness

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic lower bounds for Ramsey functions
• Realization of aperiodic subshifts and uniform densities in groups
• Building large free subshifts using the Local Lemma
• Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem
• Measurable versions of the Lovász local lemma and measurable graph colorings
• Strong amenability and the infinite conjugacy class property
• Moser and tardos meet Lovász
• Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
• Graph colouring and the probabilistic method

This page was built for publication: A short proof of Bernoulli disjointness via the local lemma