|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
18 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Reduction of $m$-Regular Noncrossing Partitions | | William Y. C. Chen
; Eva Y. P. Deng
; Rosena R. X. Du
; | | Date: |
9 Jun 2004 | | Subject: | Combinatorics MSC-class: 05A18, 05A15, 92D20 | math.CO | | Abstract: | In this paper, we present a reduction algorithm which transforms $m$-regular partitions of $[n]={1, 2, ..., n}$ to $(m-1)$-regular partitions of $[n-1]$. We show that this algorithm preserves the noncrossing property. This yields a simple explanation of an identity due to Simion-Ullman and Klazar in connection with enumeration problems on noncrossing partitions and RNA secondary structures. For ordinary noncrossing partitions, the reduction algorithm leads to a representation of noncrossing partitions in terms of independent arcs and loops, as well as an identity of Simion and Ullman which expresses the Narayana numbers in terms of the Catalan numbers. | | Source: | arXiv, math.CO/0406180 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER