References

1. Drew Armstrong (2009): The sorting order on a Coxeter group. Journal of Combinatorial Theory 116(8), pp. 1285–1305.
2. Robert Bédard (1999): On commutation classes of reduced words in Weyl groups. European J. Combin. 20(6), pp. 483–505, doi:10.1006/eujc.1999.0296.
3. Anders Björner & Francesco Brenti (2005): Combinatorics of Coxeter Groups. Springer, New York, doi:10.1016/j.jcta.2009.03.009.
4. Graham Brightwell & Peter Winkler (1991): Counting linear extensions. Order 8(3), pp. 225–242, doi:10.1007/BF00383444.
5. Delong Meng (2010): Reduced decompositions and commutation classes. Available at http://arxiv.org/abs/1009.0886.
6. Hariharan Narayanan (2006): On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients (English summary). J. Algebraic Combin. 24(3), pp. 347–354, doi:10.1007/s10801-006-0008-5.
7. Richard P. Stanley (1984): On the number of reduced decompositions of elements of Coxeter groups. European J. Combin. 5(4), pp. 359–372.
8. Richard P. Stanley (1997): Enumerative Combinatorics Volume I. Cambridge University Press, New York.
9. Bridget E. Tenner (2006): Reduced decompositions and permutation patterns. Journal of Algebraic Combinatorics 24(3), pp. 263–284, doi:10.1007/s10801-006-0015-6.
10. M. Widom, N. Destainville, R. Mosseri & F. Bailly (2005): Random tilings of high symmetry. II. Boundary conditions and numerical studies. J. Stat. Phys. 120(5), pp. 837–873, doi:10.1007/s10955-005-6998-x.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org