ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Define f(N)f(N) be the minimal kk such that the following holds: if GG is an abelian group of size NN and A⊆GA\subseteq G is a random set of size kk then, with probability ≥1/2\geq 1/2, all elements of GG can be written as ∑x∈Sx\sum_{x\in S}x for some S⊆AS\subseteq A. Is f(N)≤log⁡2N+o(log⁡log⁡N)?f(N) \leq \log_2 N+o(\log\log N)?

Record

Added
Links

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.