ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, let u u be a partition of nn, and let II be an interval whose endpoints are consecutive entries in the Farey sequence of nn. Write λT⁡\lambda^{\operatorname{T}} for the transpose partition of λ\lambda, and let DI1D_I^1 and DI2D_I^2 denote the quantities defined by the paper's two wall-crossing algorithms.

Bezrukavnikov's conjecture. For every partition λ\lambda of nn and every such interval II, one has

DI1(λ)=DI2(λT⁡).D_I^1(\lambda)=D_I^2(\lambda^{\operatorname{T}}).

This conjecture asserts a transpose symmetry between the two combinatorial wall-crossing algorithms and relates their outputs through partition conjugation. Its resolution is not specified in the supplied source material.

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.