Source: OpenCitations
Noncrossing sets and a Graßmannian associahedron
Discrete Mathematics & Theoretical Computer Science
Journal reference : Volume DMTCS Proceedings vol. AT,..., 2014, pp.
DOI : 10.46298/dmtcs.2427NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON
Forum of Mathematics Sigma
Journal reference : Volume 5, 2017, pp.
DOI : 10.1017/fms.2017.1Charmed roots and the Kroweras complement
Journal of the London Mathematical Society
Journal reference : Volume 110, 2024, pp.
DOI : 10.1112/jlms.70025Pattern avoiding permutations and independent sets in graphs
arXiv (Cornell University)
Journal reference : Volume 11, 2020, pp. 705-732
DOI : 10.4310/joc.2020.v11.n4.a7Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
Theoretical Computer Science
Journal reference : Volume 592, 2015, pp. 87-96
DOI : 10.1016/j.tcs.2015.05.021A uniform bijection between nonnesting and noncrossing partitions
Transactions of the American Mathematical Society
Journal reference : Volume 365, 2013, pp. 4121-4151
DOI : 10.1090/s0002-9947-2013-05729-7On Noncrossing and Nonnesting Partitions of Type D
Annals of Combinatorics
Journal reference : Volume 15, 2011, pp. 637-654
DOI : 10.1007/s00026-011-0114-5Folded bump diagrams for partitions of classical types
Advances in Applied Mathematics
Journal reference : Volume 62, 2014, pp. 141-159
DOI : 10.1016/j.aam.2014.09.008New interpretations for noncrossing partitions of classical types
Journal of Combinatorial Theory Series A
Journal reference : Volume 118, 2011, pp. 1168-1189
DOI : 10.1016/j.jcta.2010.12.005