Partitions of groups into large subsets
Abstract
Let G be a group and let k be a cardinal. A subset A of G is called left (right) k-large if there exists a subset F of G such that |F| < and G = FA (G = AF). We say that A is k-large if A is left and right k-large. It is known that every infinite group G can be partitioned into countably many 0-large subsets. On the other hand, every amenable (in particular Abelian) group G cannot be partitioned into > 0 0-large subsets. We prove that every infinite group G of cardinality k can be partitioned into k left- 1-large subsets and every free group Fk in the infinite alphabet k can be partitioned into k 4-large subsets.
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.