Citations of

William Y.C. Chen, Eva Y.P. Deng, Rosena R.X. Du, Richard P. Stanley and Catherine H. Yan, Crossings and nestings of matchings and partitions, Trans. Amer. Math. Soc. 359 (4) (2007) 1555–1575; arXiv: math.CO/0501230.


  1. D. Armstrong, C. Stump and H. Thomas, A uniform bijection between nonnesting and noncrossing partitions, Trans. Amer. Math. Soc. 365(2013) 4121-4151.

  2. D. Armstrong, Generalized noncrossing partitions and combinatorics of Coxeter groups, Amer. Math. Soc. 2009.

  3. H. Acan and B. Pittel, Formation of a giant component in the intersection graph of a random chord diagram, arXiv:1406.2867.

  4. B. Bényi, Inversions in 312–permutations, Creative math. & Inf. 23 (2014) 147-152.

  5. N. Blitvic, The (q, t)-gaussian process, J. Funct. Anal. 263(2012) 3270-3305.

  6. N. Blitvic, Two-parameter non-commutative central limit theorem, Probabilités et Statistiques. 50, 2014.

  7. J. Bloom, Pattern avoiding permutations & rook placements, Dartmouth College, 2014.

  8. S. Burrill, Crossings and nestings in four combinatorial families, 2009.

  9. J. Bloom and S. Elizalde, Pattern avoidance in matchings and partitions, arXiv:1211.3442.

  10. J. Bloom and S. Elizalde, Patterns in matchings and rook placements, Discrete Math. Theor. Comput. Sci. (2013) 909-920.

  11. G. Benkart and T. Halverson, Tensor power multiplicities for symmetric and alternating groups and dimensions of irreducible modules for partition algebras, arXiv:1605.06543.

  12. J. Baik and R. Jenkins, Limiting distribution of maximal crossing and nesting of Poissonized random matchings, Ann. Probab. 41(2013) 4359-4406.

  13. J. Baik and Z. Liu, Discrete toeplitz/hankel determinants and the width of nonintersecting processes, Int. Math. Res. Not. IMRN (2013) rnt143.

  14. J. Bloom and D. Saracino, Pattern avoidance for set partitions\a la Klazar, arXiv:1511.00192.

  15. M. Bousquet-Mélou, Multitriangulations, pseudotriangulations et quelques problèmes de réalisation de polytopes Vincent PILAUD, 2010.

  16. M. Bousquet-Mélou, A. Claesson and M. Dukes, (2+ 2)-free posets, ascent sequences and pattern avoiding permutations, J. Combin. Theory Ser. A, 117(2010) 884-909.

  17. M. Bousquet-Mélou, A. Claesson, M. Dukes and and S. Kitaev, Unlabeled (2+ 2)-free posets, ascent sequences and pattern avoiding permutations, DMTCS Proceedings 1(2009) 217-228.

  18. M. Bousquet-Mélou and G. Xin, On partitions avoiding 3-crossings, Séminaire Lotharingien de Combinatoire, 54(2006) 5-30.

  19. S. Burrill, S. Elizalde, M. Mishna and L. Yen, A generating tree approach to k-nonnesting partitions and permutations, arXiv:1108.5615.

  20. S. Burrill, S. Elizalde, M. Mishna and L. Yen, Generating trees for partitions and permutations with no k-nestings, DMTCS Proceedings 1(2012) 409-420.

  21. S. Burrill, J. Courtiel, E. Fusy, S. Melczer and M. Mishna, Tableau sequences, open diagrams, and baxter families, arXiv:1506.03544.

  22. S. Burrill, S. Melczer and M. Mishna, A baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape, arXiv:1411.6606.

  23. S. Burrill, M. Mishna and J. Post, On k-crossings and k-nestings of permutations, arXiv:0912.0239.

  24. S. Burrill and L. Yen, Constructing skolem sequences via generating trees, arXiv:1301.6424.

  25. B. Bényi, Advances in bijective combinatorics, SZTE, 2014.

  26. A. Claesson and S. Linusson, n! matchings, n! posets, Proc. Amer. Math. Soc. 139(2011) 435-449.

  27. A. Conflitti and R. Mamede, On noncrossing and nonnesting partitions of type D, Ann. Comb. 15(2011) 637-654.

  28. B. Chern, P. Diaconis, D.M. Kane and R.C. Rhoades, Central limit theorems for some set partition statistics, Adv. in Appl. Math. 70(2015) 92-105.

  29. B. Chern, P. Diaconis, D.M. Kane and R.C. Rhoades, Closed expressions for averages of set partition statistics, Res. Math. Sci. 1(2014) 1-32.

  30. J.H.C. Chan, An infinite family of inv-wilf-equivalent permutation pairs, European J. Combin. 44(2015) 57-76.

  31. J.K.H. Chiu and Y.P.P. Chen, Conformational features of topologically classified RNA secondary structures, PloS one 7(2012) e39907.

  32. W.Y.C. Chen, A.Y.Z. Wang, C.H. Yan, A.F.Y. Zhao, Mixed statistics on 01-fillings of moon polyominoes, SIAM J. Discrete Math. 24(2010) 1272-1290.

  33. W. Chen, Enumeration of set partitions refined by crossing and nesting numbers, Diss. Science, 2014.

  34. W.Y.C. Chen, H.S.W. Han and C.M. Reidys, Random k-noncrossing RNA structures, Proc. Natl. Acad. Sci. 106(2009) 22061-22066.

  35. W.Y.C. Chen, I.M. Gessel, C.H. Yan and A.L.B Yang, A major index for matchings and set partitions, J. Combin. Theory, Ser. A, 115(2008) 1069-1076.

  36. W.Y.C. Chen, J. Qin and C.M. Reidys, Crossings and nestings in tangled diagrams, Electron. J. Combin. 15(2008).

  37. W.Y.C. Chen, J. Qin and C.M. Reidys, Efficient counting and asymptotics of k-noncrossing tangled diagrams, Electron. J. Combin. 16.R37(2009) 1.

  38. W.Y.C. Chen, Log-concavity and q-Log-convexity Conjectures on the Longest Increasing Subsequences of Permutations, arXiv:0806.3392.

  39. W.Y.C. Chen, N.J.Y. Fan and A.F.Y. Zhao, Partitions and partial matchings avoiding neighbor patterns, European J. Combin. 33(2012) 491-504.

  40. W.Y.C. Chen and P.L. Guo, Oscillating rim hook tableaux and colored matchings, Adv. Appl. Math. 48(2012) 393-406.

  41. W.Y.C. Chen, P.L. Guo and S.X.M. Pang, Vacillating hecke tableaux and linked partitions, Mathematische Zeitschrift, 281(2015) 661-672.

  42. W.Y.C. Chen, Q.H. Guo, L.H. Sun and J. Wang, Zigzag stacks and m-regular linear stacks, J. Comput. Biol. 21(2014) 915-935.

  43. W.Y.C. Chen, S. Poznanovic, C.H. Yan and A.L.B. Yang, Major index for 01-fillings of moon polyominoes, J. Combin. Theory, Ser. A 117(2010) 1058-1081.

  44. W.Y.C. Chen, S.X.M. Pang, E.X.Y. Qu and R.P. Stanley, Pairs of noncrossing free dyck paths and noncrossing partitions, Discrete Math. 309(2009) 2834-2838.

  45. W.Y.C. Chen, S.Y.J. Wu and C.H. Yan, Linked partitions and linked cycles, European J. Combin. 29(2008) 1408-1426.

  46. W.Y.C. Chen, T. Mansour and S.H.F. Yan, Matchings avoiding partial patterns, J. Comb. 13(2006) R112.

  47. S. Corteel, Crossings and alignments of permutations, Adv. in Appl. Math. 38(2007) 149-163.

  48. Y. Cai, New perspectives of quantum analogues, 2016.

  49. A. De Mier, On the symmetry of the distribution of k-crossings and k-nestings, J. Comb. 13(2006) N21.

  50. A. De Mier, k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams, Combinatorica 27(2007) 699-720.

  51. C.P. Dong, Folded bump diagrams for partitions of classical types, Adv. in Appl. Math. 62(2015) 141-159.

  52. D. Drake, Bijections from weighted dyck paths to Schroeder paths, J. Integer Seq. 13(2010) #P3.

  53. D. Drake and J.S. Kim, k -distant crossings and nestings of matchings and partitions, arXiv:0812.2725.

  54. D. Drake, The combinatorics of associated hermite polynomials, European J. Combin. 30(2009) 1005-1021.

  55. M. Dukes, S.Kitaev and Mireille Bousquet, (2 + 2)-free posets, ascent sequences and pattern avoiding permutations, J. Combin. Theory Ser. A, 117(2010) 884-909.

  56. T. Doslic and D. Veljan, Secondary structures, plane trees and motzkin numbers, Math. Commun. 12(2007) 163-169.

  57. S. Elizalde, A bijection between 2-triangulations and pairs of non-crossing dyck paths, J. Combin. Theory Ser. A 114(2007)1481-1503.

  58. S.P. Eu, T.S. Fu, J.T. Hou and T.W. Hsu, Standard Young tableaux and colored Motzkin paths, J. Combin. Theory Ser. A 120(2013) 1786-1803.

  59. A.M. Goyt, Avoidance of partitions of a three-element set, Adv. in Appl. Math. 41(2008) 95-114.

  60. A. Hamdi, Symmetric distribution of crossings and nestings in permutations of type B, Electron. J. Combin. 18(2011) P200.

  61. F.W.D. Huang and C.M. Reidys, On the uniform generation of modular diagrams, Electron. J. Combin. 17(2010) R175.

  62. F.W.D. Huang and C.M. Reidys, Statistics of canonical RNA pseudoknot structures, J. Theoret. Biol. 253(2008) 570-578.

  63. F.W.D. Huang, L.Y.M. Li and C.M. Reidys, Sequence-structure relations of pseudoknot RNA, BMC bioinformatics 10(2009) 1.

  64. F.W.D. Huang, M.E. Nebel and C.M. Reidys, Generation of RNA pseudoknot structures with topological genus filtration, Math. Biosci. 245(2013) 216-225.

  65. F.W.D. Huang, W.W.J. Peng and C.M. Reidys, Folding 3-noncrossing RNA pseudoknot structures, J. Comput. Biol. 16(2009) 1549-1575.

  66. G. Fertin, D. Hermelin, R. Rizzi and S. Vialette, Finding common structured patterns in linear graphs, Theoret. Comput. Sci. 411(2010) 2475-2486.

  67. V. Féray, Weighted dependency graphs, arXiv:1605.03836.

  68. H.S.W. Han and C.M. Reidys, Pseudoknot RNA structures with arc-length 4, J. Comput. Biol. 15(2008) 1195-1208.

  69. H.S.W. Han and C.M. Reidys, Stacks in canonical RNA pseudoknot structures, Math. Biosci. 219(2009) 7-14.

  70. H.S.W. Han and C.M. Reidys, The 5'-3' distance of RNA secondary structures, J. Comput. Biol. 19(2012) 867-878.

  71. S. Heubach and T. Mansour, Combinatorics of compositions and words, CRC Press, 2009.

  72. S. Hopkins and I. Zhang, A note on statistical averages for oscillating tableaux, arXiv:1408.6183.

  73. T. Halverson and E. delMas, Representations of the rook-Brauer algebra, Comm. Algebra 42(2014) 423-443.

  74. T. Halverson and N. Thiem, q-Partition algebra combinatorics, J. Combin. Theory Ser. A 117(2010) 507-527.

  75. V. Jelinek and T. Mansour, Matchings and partial patterns, Electron. J. Combin. 17(2010) 1.

  76. V. Jelínek, Dyck paths and pattern-avoiding matchings, European J. Combin. 28(2007) 202-213.

  77. V. Jelínek, T. Mansour and M. Shattuck, On multiple pattern avoiding set partitions, Adv. in Appl. Math. 50(2013) 292-326.

  78. E.Y. Jin and C.M. Reidys, K -noncrossing RNA structures with arc-length 3, arXiv:0711.2346.

  79. E.Y. Jin and C.M. Reidys, Central and local limit theorems for RNA structures, J. Theoret. Biol. 250(2008) 547-559.

  80. E.Y. Jin and C.M. Reidys, Combinatorial design of pseudoknot RNA, Adv. in Appl. Math. 42(2009) 135-151.

  81. E.Y. Jin and C.M. Reidys, On the decomposition of k-noncrossing RNA structures, Adv. in Appl. Math. 44(2010) 53-70.

  82. E.Y. Jin and C.M. Reidys, Pseudoknot RNA Structures with Arc-Length 3, arXiv:0708.3134.

  83. E.Y. Jin, C.M. Reidys and R.R. Wang, Asymptotic analysis of k -noncrossing matchings, arXiv:0803.0848.

  84. E.Y. Jin and C.M. Reidys, RNA pseudoknot structures with arc-length 3 and stack-length σ, Discrete Appl. Math. 158(2010) 25-36.

  85. E.Y. Jin and C.M. Reidys, RNA-Lego: combinatorial design of pseudoknot RNA, arXiv:0711.1405.

  86. E.Y. Jin and C.M. Reidys, Asymptotic enumeration of RNA structures with pseudoknots, Bull. Math. Biol. 70(2008) 951-970.

  87. E.Y. Jin, J. Qin and C.M. Reidys, Combinatorics of RNA structures with pseudoknots, Bull. Math. Biol. 70(2008) 45-67.

  88. E.Y. Jin, J. Qin and C.M. Reidys, On k-noncrossing partitions, arXiv:0710.5014.

  89. E.Y. Jin, J. Qin and M.R. Christian, On 2-regular, k-noncrossing partitions, arXiv:0710.5014.

  90. M. Josuat-Vergès, Stammering tableaux-Tableaux Begayants, arXiv:1601.02212.

  91. A. Kasraoui, Ascents and descents in 01-fillings of moon polyominoes, European J. Combin. 31(2010) 87-105.

  92. A. Kasraoui, Average values of some z-parameters in a random set partition, Electron. J. Combin. 18 (2011) 1.

  93. A. Kasraoui, Increasing and decreasing sequences of length two in 01-fillings of moon polyominoes, arXiv:0812.0799.

  94. A. Kasraoui, d-Regular set partitions and rook placements, Séminaire Lotharingien de Combinatoire 62(2009) B62a.

  95. A. Kasraoui, études combinatoires sur les permutations et partitions d'ensemble, 2009.

  96. C. Krattenthaler, Bijections between oscillating tableaux and (semi) standard tableaux via growth diagrams, arXiv:1412.5646.

  97. C. Krattenthaler, Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes, Adv. in Appl. Math. 37 (2006) 404-431.

  98. J.S. Kim, Bijections on two variations of noncrossing partitions, Discrete Math. 311(2011) 1057-1063.

  99. J.S. Kim, Front representation of set partitions, Discrete Math. 25(2011) 447-461.

  100. K.S. Kedlaya and A.V. Sutherland, Hyperelliptic curves, L-polynomials, and random matrices, Contemp. Math. 14(2009) 119.

  101. M. Kiwi and M. Loebl, Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs, Electron. J. Combin. 15(2008) #R135.

  102. M. Klazar and A. Marcus, Extensions of the linear bound in the Füredi–Hajnal conjecture, Adv. in Appl. Math. 38(2007) 258-266.

  103. M. Klazar and M. Loebl, Enumeration workshop, 2007.

  104. M. Klazar, On identities concerning the numbers of crossings and nestings of two edges in matchings, SIAM J. Discrete Math. 20(2006) 960-976.

  105. W.J. Lloyd, Autonomous management of cost, performance, and resource uncertainty for migration of applications to infrastructure-as-a-service (IaaS) clouds, Colorado State University, 2014.

  106. W. Lloyd, S. Pallickara, O. David, J. Lyon,D.C. Sci, C.S. Univ, F. Collins and C. USA, Performance modeling to support multi-tier application deployment to infrastructure-as-a-service clouds, Utility and Cloud Computing (UCC), 2012 IEEE Fifth International Conference on. IEEE, 2012.

  107. Z. Liu, Discrete toeplitz determinants and their applications, University of Michigan, 2014.

  108. E. Marberg, Crossings and nestings in colored set partitions, arXiv:1203.5738.

  109. E. Marberg, Combinatorial methods of character enumeration for the unitriangular group, J. Algebra 345(2011) 295-323.

  110. G. Ma and C.M. Reidys, Canonical RNA pseudoknot structures, J. Comput. Biol. 15(2008) 1257-1273.

  111. T. Mansour, M. Schork and M. Shattuck, Catalan numbers and pattern restricted set partitions, Discrete Math. 312(2012) 2979-2991.

  112. T. Mansour and M. Shattuck, Counting peaks and valleys in a partition of a set, J. Integer Seq. 13(2010), Article 10.6.8 .

  113. T. Mansour and M. Shattuck, Counting subwords in a partition of a set, Electron. J. Combin. 17(2010) #R19.

  114. T. Mansour and M. Shattuck, Partial matchings and pattern avoidance, Appl. Anal. 7(2013) 25-50.

  115. T. Mansour and M. Shattuck, Some enumerative results related to ascent sequences, Discrete Math. 315(2014) 29-41.

  116. T. Mansour and N. Mbarieky, Partitions of a set satisfying certain set of conditions, Discrete Math. 309(2009) 4481-4488.

  117. T. Mansour and S. Severini, Enumeration of (k, 2)-noncrossing partitions, Discrete Math. 308(2008) 4570-4577.

  118. A.W. Marcus, New combinatorial techniques for nonlinear orders,Georgia Institute of Technology, 2008.

  119. M. Mishna and L. Yen, Set partitions with no m-nesting, Advances in Combinatorics. Springer Berlin Heidelberg, 2013, 249-258.

  120. P.L. Méliot, Partitions aléatoires et théorie asymptotique des groupes symétriques, des algèbres d'Hecke et des groupes de Chevalley finis, Université Paris-Est, 2010.

  121. P.L. Méliot, Random partitions and asymptotic theory of symmetric groups, Hecke algebras and finite Chevalley groups, arXiv:1012.4067.

  122. R.J. Marsh and P. Martin, Tiling bijections between paths and Brauer diagrams, J. Algebraic Combin. 33(2011) 427-453.

  123. M.E. Nebel, C.M. Reidys and R.R. Wang, Loops in canonical RNA pseudoknot structures, J. Comput. Biol. 18(2011) 1793-1806.

  124. J. Post, Combinatorics of arc diagrams, Ferrers fillings, Young tableaux and lattice paths, Simon Fraserf University, 2009.

  125. M. Phillipson, C.H. Yan and J. Yeh, Chains of length 2 in fillings of layer polyominoes, Electron. J. Combin. 20(2013) #P51.

  126. M.A. Phillipson, Monotone mequences in combinatorial structures, Texas A&M University, 2015.

  127. P. Pylyavskyy, Non-crossing tableaux, Ann. Comb. 13(2009) 323-339.

  128. R. Parviainen, Some bijections on set partitions, arXiv:0710.1132.

  129. S. Poznanović and C.H. Yan, Maximal increasing sequences in fillings of almost-moon polyominoes, Adv. in Appl. Math. 66(2015) 1-21.

  130. S. Poznanovic and C. Yan, Crossings and nestings of two edges in set partitions, SIAM J. Discrete Math. 23(2009) 787-804.

  131. S. Poznanovikj, Research on combinatorial statistics: crossings and nestings in discrete structures, Texas A&M University, 2010.

  132. V. Pilaud and J. Rué, Analytic combinatorics of chord and hyperchord diagrams with k crossings, Adv. in Appl. Math. 57(2014) 60-100.

  133. V. Pilaud, Multitriangulations, pseudotriangulations and some problems of realization of polytopes, arXiv:1009.1605.

  134. W. Y. C. Chen and P. X. M. Sabrina, Pairs of noncrossing free dyck paths and noncrossing partitions, Discrete Math. 309(2009) 2834-2838.

  135. J. Qin and C.M. Reidys, A combinatorial framework for RNA tertiary interaction, arXiv:0710.3523.

  136. J. Qin and C.M. Reidys, Random 3-noncrossing partitions, arXiv:0910.2608.

  137. C. Reidys, Probabilistic analysis, combinatorial computational biology of RNA, Springer New York, 2011, 143-186.

  138. C.M. Reidys and R.R. Wang, Shapes of RNA pseudoknot structures, J. Comput. Biol. 17(2010) 1575-1590.

  139. C. Reidys, Tangled diagrams, combinatorial computational biology of RNA. Springer New York, 2011 67-83.

  140. C.M. Reidysa, R.R. Wangb and .Y.Y. Zhao, Modular, k-noncrossing diagrams, Electron. J. Combin. 17(2010) #R76.

  141. C. Reidys, Basic concepts, combinatorial computational biology of RNA, Springer New York, 2011, 23-65.

  142. K. Raschel, Counting walks in a quadrant: a unified approach via boundary value problems, arXiv:1003.1362.

  143. M. Rubey, B.E. Sagan and B.W. Westbury, Descent sets for symplectic groups, J. Algebraic Combin. 40(2014) 187-208.

  144. M. Rubey and C. Stump, Crossings and nestings in set partitions of classical types, Electron. J. Combin. 17(2010) #R120.

  145. M. Rubey, Increasing and decreasing sequences in fillings of moon polyominoes, Adv. in Appl. Math. 47(2011) 57-87.

  146. R.P. Stanley, Permutations, unpublished notes for 2010 AMS Colloquium Lectures..

  147. R.P. Stanley, Increasing and decreasing subsequences and their variants, Proceedings of the International Congress of Mathematicians, 1(2007) 545-579.

  148. R.P. Stanley, Increasing and decreasing subsequences of permutations and their variants, arXiv:math/0512035.

  149. V. VJelinek and T. Mansour, On pattern-avoiding partitions, Electron. J. Combin. 15 (2008) #R39.

  150. A.Y.Z. Wang and C.H. Yan, Positive and negative chains in charged moon polyominoes, Adv. in Appl. Math. 51(2013) 467-482.

  151. G. Xin, Determinant formulas relating to tableaux of bounded height, Adv. in Appl. Math. 45(2010) 197-211.

  152. G. Xin and T.Y.J. Zhang, Enumeration of bilaterally symmetric 3-noncrossing partitions, Discrete Math. 309 (2009) 2497-2509.

  153. G. Xin and T.Y.J. Zhang, Symmetry property of the cddsy correspondence for set partitions, preliminary Version, 2007.

  154. L. Yen, A bijection for crossings and nestings, arXiv:1209.3082.

  155. L. Yen, Crossings and nestings for arc-coloured permutations and automation, Electron. J. Combin. 22(2015) #P1.14.

  156. L. Yen, Crossings and nestings for arc-coloured permutations, arXiv:1211.3472.

  157. M. Yip, Genus one partitions, University of Waterloo, 2006.

  158. S.H.F. Yan, Ascent sequences and 3-nonnesting set partitions, European J. Combin. 39(2014) 80-94.

  159. S.H.F. Yan, Schröder paths and pattern avoiding partitions, arXiv:0805.2465.

  160. I. Zhang, S. Hopkins, Homomesy of alignments in perfect matchings, 2014.

back to homepage