Abstract
We prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of 1,2,⋯,n is equal to the sum of weights of Motzkin paths of length n, where the weight of a Motzkin path is a product of certain fractions involving Fibonacci numbers. We provide two proofs of their conjecture: one uses continued fractions and the other is combinatorial.
| Original language | English |
|---|---|
| Pages (from-to) | 3421-3425 |
| Number of pages | 5 |
| Journal | Discrete Mathematics |
| Volume | 310 |
| Issue number | 23 |
| DOIs | |
| State | Published - 6 Dec 2010 |
| Externally published | Yes |
Keywords
- Continued fraction
- Dyck path
- Fibonacci number
- Motzkin path
- Schrder path