ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an infinite group of cardinality ϰ\varkappa. For a subset A⊆GA\subseteq G, define

cov⁡(A)=min⁡{∣X∣:X⊆G, G=XA}.\operatorname{cov}(A)=\min\{|X|:X\subseteq G,\ G=XA\}.

Partition conjecture. The group GG can be partitioned into countably many subsets

G=⋃n<ωAnG=\bigcup_{n<\omega}A_n

such that

cov⁡(AnAn−1)=ϰ\operatorname{cov}(A_nA_n^{-1})=\varkappa

for every n<ωn<\omega. This conjecture strengthens the preceding question about partitions into fewer than ∣G∣|G| 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.