2000 character limit reached
Definably amenable NIP groups
Published 15 Feb 2015 in math.LO, math.DS, and math.GR | (1502.04365v3)
Abstract: We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications include: characterization of regular ergodic measures, a proof of the conjecture of Petrykowski connecting existence of bounded orbits with definable amenability in the NIP case, and the Ellis group conjecture of Newelski and Pillay connecting the model-theoretic connected component of an NIP group with the ideal subgroup of its Ellis enveloping semigroup.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.