ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let be a partition, and let lexicographic bitableaux be the combinatorial objects introduced in the paper, with prescribed shape and weights. A reading word is Yamanouchi when it satisfies the usual lattice-word condition.

Bitableaux conjecture. The Kronecker coefficient with the corresponding partitions is counted by lexicographic bitableaux of the given shape and weights whose pair of reading words are both Yamanouchi.

A positive combinatorial interpretation of Kronecker coefficients is a long-standing open problem in combinatorial representation theory. The conjecture is motivated by the role of lexicographic bitableaux as a possible generalization of the RSK and dual RSK insertion algorithms.

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.