Building large free subshifts using the Local Lemma
From MaRDI portal
Publication:2286357
DOI10.4171/GGD/528WikidataQ125026159 ScholiaQ125026159MaRDI QIDQ2286357
Publication date: 22 January 2020
Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.07123
Descriptive set theory (03E15) Topological entropy (37B40) Symbolic dynamics (37B10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Multidimensional shifts of finite type (37B51)
Related Items (4)
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms ⋮ A short proof of Bernoulli disjointness via the local lemma ⋮ Free minimal actions of countable groups with invariant probability measures ⋮ Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem
Cites Work
- Unnamed Item
- Realization of aperiodic subshifts and uniform densities in groups
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Sofic entropy and amenable groups
- Measure conjugacy invariants for actions of countable sofic groups
- Nonrepetitive colorings of graphs
- A BRIEF INTRODUCTION TO SOFIC ENTROPY THEORY
This page was built for publication: Building large free subshifts using the Local Lemma
