Skip to main content

Weak order and reduced words

  • Chapter
Combinatorics of Coxeter Groups

Part of the book series: Graduate Texts in Mathematics ((GTM,volume 231))

  • 4917 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. C. Berge, Principles of Combinatorics, Academic Press, New York, 1971. [87]

    Google Scholar 

  2. A Björner, The weak ordering of a Coxeter group, unpublished notes, 1981. [87]

    Google Scholar 

  3. A. Björner, Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings, Adv. Math. 52 (1984), 173–212. [88, 200]

    Article  MATH  Google Scholar 

  4. A. Björner, Essential chains and homotopy type of posets, Proc. Amer. Math. Soc. 116 (1992), 1179–1181. [88]

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Björner, The Möbius function of factor order, Theoret. Computer Sci. 117 (1993), 91–98. [88]

    Article  MATH  Google Scholar 

  6. N. Bourbaki, Groupes et algébres de Lie, Ch. 4–6, Éléments de Mathématique, Fasc. XXXIV, Hermann, Paris, 1968; Masson, Paris, 1981. pp. 40–44 [24, 88, 127, 129, 130, 170]

    Google Scholar 

  7. K. S. Brown, Buildings, Springer, New York, 1989. [24, 88]

    Google Scholar 

  8. F. du Cloux, Un algorithme de forme normal pour les groupes de Coxeter, preprint, École Polytechn. Palaiseau, 1990. [82, 87]

    Google Scholar 

  9. F. du Cloux, A transducer approach to Coxeter groups, J. Symb. Comput. 27 (1999), 311–324. [82, 87]

    Article  MATH  Google Scholar 

  10. J. H. Conway, N. J. A. Sloane, A. R. Wilks, Gray codes for reflection groups, Graphs Combin. 5 (1989), 315–325. [88]

    Article  MathSciNet  Google Scholar 

  11. H. Eriksson, Computational and combinatorial aspects of Coxeter groups, Ph.D. Thesis, KTH, Stockholm, Sweden, 1994. [88, 125, 130, 294]

    Google Scholar 

  12. K. Eriksson, Polygon posets and the weak order of Coxeter groups. J. Algebraic Combin. 4 (1995), 233–252. [88]

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Knutson, E. Miller, Subword complexes in Coxeter groups, Adv. Math. 184 (2004), 161–176. [88]

    Article  MathSciNet  Google Scholar 

  14. E. L. Lehmann, Some concepts of dependence, Ann. Math. Statist. 37 (1966), 1137–1153. [87]

    MATH  MathSciNet  Google Scholar 

  15. G. Markowsky, Permutation lattices revisited, Math. Social Sci. 27 (1994), 59–72. [88]

    Article  MATH  MathSciNet  Google Scholar 

  16. N. Reading, The order dimension of the poset of regions in a hyperplane arrangement, J. Combin. Theory Ser. A 104 (2003), 265–285. [88]

    Article  MATH  MathSciNet  Google Scholar 

  17. M. Ronan, Lectures on Buildings, Academic Press, San Diego, 1989. [88]

    Google Scholar 

  18. I. R. Savage, Contributions to the theory of rank order statistics: Applications of lattice theory, Rev Int. Statist. Inst. 32 (1964), 52–64. [87]

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Tits, Le problème des mots dans les groupes de Coxeter, Symposia Mathematica (INDAM, Rome, 1967/68), Academic Press, London, 1969, vol. 1, pp. 175–185. [87]

    Google Scholar 

  20. J. Tits, Buildings of Spherical Type and Finite BN-pairs, Lecture Notes in Math. No. 386, Springer, Berlin, 1974. [24, 88]

    Google Scholar 

  21. P. Ungar, 2N noncollinear points determine at least 2N directions, J. Combin. Theory, Ser. A 33 (1982), 343–347. [88]

    Article  MATH  MathSciNet  Google Scholar 

  22. T. Yanagimoto, M. Okamoto, Partial orderings of permutations and monotonicity of a rank correlation statistics, Ann. Inst. Statist. Math. 21 (1969), 489–506. [87]

    MathSciNet  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

(2005). Weak order and reduced words. In: Combinatorics of Coxeter Groups. Graduate Texts in Mathematics, vol 231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27596-7_3

Download citation

Publish with us

Policies and ethics