The infinite-group partition conjecture for covering numbers
Statement
Let be an infinite group of cardinality . For a subset , define
Partition conjecture. The group can be partitioned into countably many subsets
such that
for every . This conjecture strengthens the preceding question about partitions into fewer than cells and asks for uniformly maximal covering numbers of the difference sets of all cells; its status is not resolved in the supplied source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.