Asymptotic expected-length conjecture for grand zigzag knight's paths
Statement
Let a grand zigzag knight's path be a path whose number of steps has an expected value determined by the corresponding family of paths ending on the -axis at size . Asymptotic expected-length conjecture. An asymptotic approximation for the expected number of steps of a grand zigzag knight's path ending on the -axis of size is
The even-size case is established in the preceding theorem, while the source presents the odd-size analogue as suggested by Mathematica calculations and does not provide a proof.
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.