A note on 2-distant noncrossing partitions and weighted Motzkin paths

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.

6 pages, 2 figures

References in corpus (1)

• Schröder Paths and Pattern Avoiding Partitions