Convergence of uniform 231-avoiding permutations to the Brownian binary tree
Statement
Let , let be a uniform -avoiding permutation of , and define its normalized graph by
View as a random compact subset of , taking values in , where is the Hausdorff metric. Conjecture. As , converges in law to the Brownian binary tree on , with respect to the Hausdorff topology on . The conjecture proposes a universality connection between large uniform pattern-avoiding permutations and the Brownian binary tree, motivated by the comparison with the limiting tree associated with Rémy's tree growth chain; its resolution is not indicated here.
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.