Random walks on Dyck's paths
Statement
Consider the Markov chain on the set of Dyck's paths, which moves by choosing uniformly at random two coordinates and exchanging their value ( or ) provided the resulting path remains a Dyck's path. What is the mixing time?
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.