Orbit-by-orbit inequality for genomic tableaux in the orthogonal Grassmannian
Statement
Let be the permutation governing the switching algorithm, and let 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 genomic tableaux traversed in standardization order and at least traversed in reverse standardization order in the computation of using the switching algorithm. This refines the global inequality by requiring the contribution 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.