ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the path on nn vertices, and let ρR(Pn)\rho_R(P_n) denote its replication number. The notation O(n)O(n) means a quantity bounded in absolute value by a constant multiple of nn for all sufficiently large nn. The quadratic asymptotic conjecture. For every n≥1n\geq 1,

ρR(Pn)=n2/4+n2/16+O(n).\rho_R(P_n)=n^2/4+n^2/16+O(n).

The paper reports exact computations through n=16n=16 and observes that the proven upper bound is close to these values; the displayed asymptotic assertion remains conjectural.

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.