ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer kk, define

q(k):=min⁡∑i=1s(ω(2ki+1)−1),q(k):=\min \sum_{i=1}^{s}\left(\omega(2k_i+1)-1\right),

where the minimum is over positive integers k1,…,ksk_1,\ldots,k_s with k1+⋯+ks=kk_1+\cdots+k_s=k and s≥1s\geq 1, and set q(0):=0q(0):=0. Here ω(m)\omega(m) denotes the Ramsey number parameter used in the paper. The two-part decomposition conjecture. The previous statement holds with s=2s=2. Even more,

q(k)=ω(2k+1)−1q(k)=\omega(2k+1)-1

for all kk except for k=4k=4. This would identify the minimum defining q(k)q(k) using at most two summands, with the only exceptional value occurring at k=4k=4.

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.