ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a random walk of length 2n+12n+1 be generated from a uniform random permutation, and let 2k2k be the number of its edges lying above the origin. Write α2n,2k\alpha_{2n,2k} for the corresponding simple-random-walk probability in the discrete arcsine law. Uniform permutation-walk arcsine conjecture. The probability that the walk has 2k2k edges above the origin equals

α2n,2k.\alpha_{2n,2k}.

This conjecture asserts that the relevant edge-count distribution for a uniform permutation-generated random walk coincides with that of a simple random walk; the supplied context reports strong numerical evidence but does not establish the claim.

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.