The fast-embedding quadrant traversal-time asymptotic
Statement
Let be the fast continuous-time embedding of the simple harmonic urn, let
and write for expectation conditional on and . Let be the constant appearing in Theorem above. Fast-embedding traversal-time conjecture. As ,
This asymptotic was motivated by numerical calculations and predicts that the expected time to traverse a quadrant approaches with exponentially small error. The supplied text gives no resolution, so the conjecture remains open.
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.