The quadratic asymptotic conjecture for replication numbers of paths
Statement
Let be the path on vertices, and let denote its replication number. The notation means a quantity bounded in absolute value by a constant multiple of for all sufficiently large . The quadratic asymptotic conjecture. For every ,
The paper reports exact computations through 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.