The Edelman–Greene coefficient bound

Let ww be a permutation and let aw,λa_{w,\lambda} denote the corresponding Edelman–Greene coefficient for a partition λ\lambda, with fλf^{\lambda} the number of standard Young tableaux of shape λ\lambda. Edelman–Greene coefficient bound. One has

aw,λfλ.a_{w,\lambda}\leq f^{\lambda}.

This bound was stated in the paper as a conjecture and has since been proved by G. Orelowitz in private communication.

Sources & referencesView supporting material

Primary source

Cara Monical, Benjamin Pankow and Alexander Yong, “Reduced word enumeration, complexity, and randomization”, arXiv:1901.03247 (2019).

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.