  We prove a common generalization of the fact that the weighted number of
maximal chains in the strong Bruhat order on the symmetric group is ${n \choose
2}!$ for both the code weights and the Chevalley weights. We also define
weights which give a one-parameter family of strong order analogues of
Macdonald's reduced word identity for Schubert polynomials.

Combinatorics