Exponential path-length conjecture for comma-sequence graphs
Statement
For a base , let be the finite graph constructed from comma-sequence danger intervals, and let be a uniformly randomly chosen path in . Write for the number of vertices in , and let and denote its mean and variance. Path-length conjecture. As , the path length is approximately exponentially distributed with rate close to . In particular, and . This is an empirical model intended to estimate comma-sequence behavior; the source supplies no resolution beyond the reported empirical testing.
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.