ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S7k,nS_{7k,n} be the staircase graph of width 7k7k, and let πopt⁡(G)\pi_{\operatorname{opt}}(G) denote its optimal pebbling number.

Multiples-of-seven staircase conjecture. For all k≥1k\ge 1,

πopt⁡(S7k,n)=kn+O(1).\pi_{\operatorname{opt}}(S_{7k,n})=kn+O(1).

The conjecture is motivated by duplicating an optimal distribution for S7,nS_{7,n} kk times. It predicts the asymptotically optimal pebbling size for staircase widths that are positive multiples of seven.

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.