<%@ Page Language="C#" MasterPageFile="~/Main.master" AutoEventWireup="true" Title="Volume 13 Issue 3" %>
On Noncrossing and Nonnesting Partitions of Type D
Alessandro Conflitti and Ricardo Mamede
CMUC, Centro de Matemática, Universidade de Coimbra, Apartado 3008, 3001-454 Coimbra, Portugal
{conflitt, mamede}@mat.uc.pt
Annals of Combinatorics 15 (4) pp.637-654 December, 2011
AMS Subject Classification: 05A18; 05E15
Abstract:
We present an explicit bijection between noncrossing and nonnesting partitions of Coxeter systems of type D which preserves openers, closers, and transients.
Keywords: root systems, noncrossing partitions, nonnesting partitions, bijection

References:

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

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

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

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

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

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

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

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)

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

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

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

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

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)

14. Krattenthaler, C.: The M-triangle of generalised non-crossing partitions for the types E7 and E8. 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)

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)

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)

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

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

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

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

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

25. Speicher, R.: Free probability theory and non-crossing partitions. S´em. 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, no. 627 (1998)

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)