Inverting the Sweep Map on (kn,n)-Dyck Paths: A Simple Algorithm
arXiv:1703.09737
Abstract
We show that our algorithm for inverting the sweep map on (2n, n)-Dyck paths works for any (kn, n)-Dyck path, where k is an arbitrary positive integer.
arXiv:1703.09737
We show that our algorithm for inverting the sweep map on (2n, n)-Dyck paths works for any (kn, n)-Dyck path, where k is an arbitrary positive integer.