Paired patterns in lattice paths

Ran Pan, Jeffrey B. Remmel

Let ${\mathcal{L}}_n$ denote the set of all paths from $[0,0]$ to $[n,n]$ which consist of either unit north steps $N$ or unit east steps $E$ or, equivalently, the set of all words…