ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix p∈(0,1)p\in(0,1). In the limit game, an admissible strategy is a countable sequence of coefficients, with all but finitely many coefficients zero in the stated candidate solutions; solutions are equivalent under the relevant permutations. Limit-game conjecture. The optimal solution has the form

a1=a2=⋯=aqa_1=a_2=\cdots=a_q

for some q∈{1,2,3,5}q\in\{1,2,3,5\}, with all other coefficients equal to 00, and this is the only optimal solution up to equivalence. This conjecture summarizes the paper’s analysis of the limit problem; no proof or disproof is supplied.

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.