ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ω\omega be the permutation governing the switching algorithm, and let O∈Orb⁡(ω)\mathcal{O}\in\operatorname{Orb}(\omega) be one of its orbits. A genomic tableau is a tableau counted by the relevant type B Littlewood–Richardson rule, and standardization and reverse standardization order refer to the two traversal procedures in the switching algorithm. Orbit-by-orbit conjecture. There are at least ∣O∣−1|\mathcal{O}|-1 genomic tableaux traversed in standardization order and at least ∣O∣−1|\mathcal{O}|-1 traversed in reverse standardization order in the computation of O\mathcal{O} using the switching algorithm. This refines the global inequality by requiring the contribution ∣O∣−1|\mathcal{O}|-1 separately for every orbit; the paper reports computer evidence but does not establish the claim.

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.