The Edelman–Greene coefficient bound
The Edelman–Greene coefficient bound
Let be a permutation and let denote the corresponding Edelman–Greene coefficient for a partition , with the number of standard Young tableaux of shape . Edelman–Greene coefficient bound. One has
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
Sign in to submit a solution.
No solutions have been posted yet.