A bijection between noncrossing and nonnesting partitions of types A, B and C
The total number of noncrossing partitions of type is the nth Catalan number 1 n+1 2n n when = An−1, and the coefficient binomial 2n n when = Bn or Cn, and these numbers coincide with the correspondent number of nonnesting partitions. For type A, there are several bijective proofs of this equality;...
| Autor principal: | |
|---|---|
| Formato: | other |
| Idioma: | eng |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/11176 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/11176 |