ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer. An up-down permutation of size 2n2n is a permutation of {1,…,2n}\{1,\ldots,2n\} whose successive entries alternately rise and fall, and a permutation avoids 12341234 if it has no increasing subsequence of length four. Let a weighted Dyck path be a Dyck path together with the weights described in Borie's construction; denote the relevant class by WD2nWD_{2n}. Borie's conjecture. There exists a combinatorial bijection between up-down permutations of size 2n2n avoiding 12341234 and a certain class of weighted Dyck paths. This conjecture proposes a new correspondence between two families counted by the three-dimensional Catalan numbers. The paper presents a more structured bijection resolving this existence claim, so the original conjecture is solved.

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.