Uniform mixing and completely positive sofic entropy
Abstract
Let G be a countable discrete sofic group. We define a concept of uniform mixing for measure-preserving G-actions and show that it implies completely positive sofic entropy. When G contains an element of infinite order, we use this to produce an uncountable family of pairwise nonisomorphic G-actions with completely positive sofic entropy. None of our examples is a factor of a Bernoulli shift.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.