Skip to main content
Log in

On Noncrossing and Nonnesting Partitions of Type D

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

We present an explicit bijection between noncrossing and nonnesting partitions of Coxeter systems of type D which preserves openers, closers, and transients.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Armstrong D.: Generalized Noncrossing Partitions and Combinatorics of Coxeter Groups. Mem. Amer. Math. Soc. 202, 949 (2009)

    MathSciNet  Google Scholar 

  2. Athanasiadis C.A.: On noncrossing and nonnesting partitions for classical reflection groups. Electron. J. Combin. 5, 42 (1998)

    MathSciNet  Google Scholar 

  3. Athanasiadis C.A., Brady T., Watt C.: Shellability of noncrossing partition lattices. Proc. Amer. Math. Soc. 135(4), 939–949 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Athanasiadis C.A., Reiner V.: Noncrossing partitions for the group D n . SIAM J. Discrete Math. 18(2), 397–417 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Biane P.: Some properties of crossings and partitions. Discrete Math. 175(1-3), 41–53 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Björner A., Brenti F.: Combinatorics of Coxeter Groups. Springer, New York (2005)

    MATH  Google Scholar 

  7. Brady T., Watt C.: K(π, 1)’s for Artin groups of finite type. Geom. Dedicata 94, 225–250 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen W.Y.C., Deng E.Y.P., Du R.R.X., Stanley R.P., Yan C.H.: Crossings and nestings of matchings and partitions. Trans. Amer. Math. Soc. 359(4), 1555–1575 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dershowitz N., Zaks S.: Ordered trees and noncrossing partitions. Discrete Math. 62(2), 215–218 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  10. Edelman P.H.: Chain enumeration and noncrossing partitions. Discrete Math. 31(2), 171–180 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fink A., Giraldo B.I.: Bijections between noncrossing and nonnesting partitions for classical reflection groups. Port. Math. 67(3), 369–401 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Humphreys J.E.: Reflection Groups and Coxeter Groups. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  13. Kasraoui A., Zeng J.: Distribution of crossings, nestings and alignments of two edges in matchings and partitions. Electron. J. Combin. 13(1),#R33 (2006)

    MathSciNet  Google Scholar 

  14. Krattenthaler, C.: The M-triangle of generalised non-crossing partitions for the types E 7 and E 8. Sém. Lothar. Combin. 54, Art. B541 (2005/07)

  15. Kreweras G.: Sur les partitions non roisées d’un cycle. Discrete Math. 1(4), 333–350 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  16. Liaw S.C., Yeh H.G., Hwang F.K., Chang G.J.: A simple and direct derivation for the number of noncrossing partitions. Proc. Amer. Math. Soc. 126(6), 1579–1581 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mamede, R.: A bijection between noncrossing and nonnesting partitions of types A and B. In: Krattenthaler, C., Strehl, V., Kauers, M. (eds.) 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), pp. 597–610. Discrete Math. Theor. Comput. Sci. Proceedings (2009)

  18. Mamede, R.: A bijection between noncrossing and nonnesting partitions of types A, B and C. Contrib. Discrete Math. (to appear)

  19. Nica A., Speicher R.: Lectures on the Combinatorics of Free Probability. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  20. Reiner V.: Non-crossing partitions for classical reflection groups. Discrete Math. 177(1-3), 195–222 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  21. Rubey M., Stump C.: Crossing and nestings in set partitions of classical types. Electron. J. Combin. 17(1),#R120 (2010)

    MathSciNet  Google Scholar 

  22. Simion R.: Combinatorial statistics on noncrossing partitions. J. Combin. Theory Ser. A 66(2), 270–301 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  23. Simion R.: Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations. Electron. J. Combin. 7,#R9 (2000)

    MathSciNet  Google Scholar 

  24. Simion R.: Noncrossing partitions. Discrete Math. 217(1-3), 367–409 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  25. Speicher, R.: Free probability theory and non-crossing partitions. Sém. Lothar. Combin. 39, Art. B39c (1997)

  26. Speicher R.: Combinatorial theory of the free product with amalgamation and operatorvalued free probability theory. Mem. Amer. Math. Soc. 132, 627 (1998)

    MathSciNet  Google Scholar 

  27. Stump, C.: Non-crossing partitions, non-nesting partitions and Coxeter sortable elements in types A and B. arXiv:0808.2822 (2008)

  28. Thomas H.: Tamari lattices and noncrossing partitions in type B. Discrete Math. 306(21), 2711–2723 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alessandro Conflitti.

Additional information

Both authors were supported by CMUC — Centro de Matemática da Universidade Coimbra. The first author was also supported by FCT Portuguese Foundation of Science and Technology (Fundação para a Ciência e a Tecnologia) Grant SFRH/BPD/30471/2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conflitti, A., Mamede, R. On Noncrossing and Nonnesting Partitions of Type D . Ann. Comb. 15, 637–654 (2011). https://doi.org/10.1007/s00026-011-0114-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-011-0114-5

Mathematics Subject Classification

Keywords

Navigation