The genomic Q-tableaux upper-bound conjecture for symplectic Schubert constants

Let Z=LG(n,2n)Z={\rm LG}(n,2n) be the Lagrangian Grassmannian, and let cλ,μνc_{\lambda,\mu}^{\nu} denote its Schubert structure constants for strict partitions λ\lambda, μ\mu, and ν\nu. Let QBallotμ(ν/λ)\mathtt{QBallot}_{\mu}(\nu/\lambda) be the set of ballot genomic QQ-tableaux of shape ν/λ\nu/\lambda with content μ\mu. The genomic Q-tableaux upper-bound conjecture.

cλ,μν#QBallotμ(ν/λ).|c_{\lambda,\mu}^{\nu}|\leq \#\mathtt{QBallot}_{\mu}(\nu/\lambda).

The bound has been verified computationally for n6n\leq 6 and is sharp when μ\mu has one part or when νλ+μ|\nu|\leq |\lambda|+|\mu|. The conjecture proposes a combinatorial upper bound for the absolute values of the symplectic Schubert structure constants.

Sources & referencesView supporting material

Primary source

Oliver Pechenik and Alexander Yong, “Genomic Tableaux”, arXiv:1603.08490 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.