Is there a formula for the number of maximal chains between two permutation in the (strong) Bruhat order?
2
-
2$\begingroup$ I think your question is pretty terse -- maybe you could expand a bit? $\endgroup$– Stefan Kohl ♦Commented Oct 21, 2014 at 8:53
-
$\begingroup$ Related: mathoverflow.net/questions/31772/… $\endgroup$– Alex R.Commented Oct 21, 2014 at 20:10
Add a comment
|