Dyck paths on colored lattices

Abstract

Fried recently enumerated Dyck paths having equally many black and white cells below them, for the chessboard coloring (Narayana numbers) and the column-alternating coloring (Fuss--Catalan numbers). We prove a generalization here: for the coloring of columns modulo any c2, the number of Dyck paths of semilength n whose c residue classes carry equal weight is the Raney number c+1,r(m), where n=cm+r-1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…