$m$-noncrossing partitions and $m$-clusters
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) (2009).

Voir la notice de l'article provenant de la source Episciences

Let $W$ be a finite crystallographic reflection group, with root system $\Phi$. Associated to $W$ there is a positive integer, the generalized Catalan number, which counts the clusters in the associated cluster algebra, the noncrossing partitions for $W$, and several other interesting sets. Bijections have been found between the clusters and the noncrossing partitions by Reading and Athanasiadis et al. There is a further generalization of the generalized Catalan number, sometimes called the Fuss-Catalan number for $W$, which we will denote $C_m(W)$. Here $m$ is a positive integer, and $C_1(W)$ is the usual generalized Catalan number. $C_m(W)$ counts the $m$-noncrossing partitions for $W$ and the $m$-clusters for $\Phi$. In this abstract, we will give an explicit description of a bijection between these two sets. The proof depends on a representation-theoretic reinterpretation of the problem, in terms of exceptional sequences of representations of quivers.
@article{DMTCS_2009_special_256_a41,
     author = {Bakke Buan, Aslak and Reiten, Idun and Thomas, Hugh},
     title = {$m$-noncrossing partitions and $m$-clusters},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)},
     year = {2009},
     doi = {10.46298/dmtcs.2719},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2719/}
}
TY  - JOUR
AU  - Bakke Buan, Aslak
AU  - Reiten, Idun
AU  - Thomas, Hugh
TI  - $m$-noncrossing partitions and $m$-clusters
JO  - Discrete mathematics & theoretical computer science
PY  - 2009
VL  - DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2719/
DO  - 10.46298/dmtcs.2719
LA  - en
ID  - DMTCS_2009_special_256_a41
ER  - 
%0 Journal Article
%A Bakke Buan, Aslak
%A Reiten, Idun
%A Thomas, Hugh
%T $m$-noncrossing partitions and $m$-clusters
%J Discrete mathematics & theoretical computer science
%D 2009
%V DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2719/
%R 10.46298/dmtcs.2719
%G en
%F DMTCS_2009_special_256_a41
Bakke Buan, Aslak; Reiten, Idun; Thomas, Hugh. $m$-noncrossing partitions and $m$-clusters. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) (2009). doi : 10.46298/dmtcs.2719. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2719/

Cité par Sources :