ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let π\pi be a 123123-avoiding permutation, and let its boundary grid be the associated skew Young diagram. The downcore graph has the boxes of the boundary grid as vertices, with an edge between (i,j)(i,j) and (k,ℓ)(k,\ell) when either i<ki<k and j>ℓj>\ell, or i>ki>k and j<ℓj<\ell, and both opposite-corner boxes (i,ℓ)(i,\ell) and (k,j)(k,j) lie in the skew Young diagram. A graph is pure if every maximal independent set has the same size. Bean–Tannock–Ulfarsson's purity conjecture. The downcore graph of the boundary grid of π\pi is pure if and only if π\pi avoids 21432143. This conjecture concerns a structural characterization of 123123-avoiding permutations through their boundary-grid graphs; the supplied text gives no resolution, so its status remains open.

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.