The covering number of the difference sets in partitions of GG-spaces and groups

preprint2014arXivOpen access

Abstract

We prove that for every finite partition G=A1∪⋯∪AnG=A_1\cup\dots\cup A_n of a group GG either cov(AiAi−1)≤ncov(A_iA_i^{-1})\le n for all cells AiA_i or else cov(AiAi−1Ai)<ncov(A_iA_i^{-1}A_i)<n for some cell AiA_i of the partition. Here cov(A)=min⁡{∣F∣:F⊂G,  G=FA}cov(A)=\min\{|F|:F\subset G,\;G=FA\} is the covering number of AA in GG. A similar result is proved also of partitions of GG-spaces. This gives two partial answers to a problem of Protasov posed in 1995.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.