2000 character limit reached
Product set phenomena for countable groups
Published 17 Sep 2013 in math.DS, math.GR, and math.NT | (1309.4262v2)
Abstract: We develop in this paper general techniques to analyze local combinatorial structures in product sets of two subsets of a countable group which are "large" with respect to certain classes of (not necessarily invariant) means on the group. As applications of our methods, we extend and quantify a series of recent results by Jin, Bergelson-Furstenberg-Weiss, Beiglb\"ock-Bergelson-Fish, Griesmer and DiNasso-Lupini to general countable groups.
Paper Prompts
Sign up for free to create and run prompts on this paper.