Inverting the Sweep Map on (kn,n)-Dyck Paths: A Simple Algorithm
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.
math.CO↗
arXiv subjects
Publications and source records attributed to Erin Milne.
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.
We introduce a simple, rank-based algorithm for inverting the sweep map on (2n,n)-Dyck paths.