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

Abstract

We prove that for every finite partition G=A1… An of a group G either cov(AiAi-1) n for all cells Ai or else cov(AiAi-1Ai)<n for some cell Ai of the partition. Here cov(A)=\|F|:F⊂ G,\;G=FA\ is the covering number of A in G. A similar result is proved also of partitions of G-spaces. This gives two partial answers to a problem of Protasov posed in 1995.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…