Inverting the Sweep Map on (2n,n)-Dyck Paths: A Simple Algorithm

Abstract

We introduce a simple, rank-based algorithm for inverting the sweep map on (2n,n)-Dyck paths.

References in corpus (3)

• Sweeping up Zeta
• An efficient search algorithm for inverting the sweep map on rational Dyck paths
• Inverting the Rational Sweep Map