Inverting the Sweep Map on (kn,n)-Dyck Paths: A Simple Algorithm
Combinatorics
2017-03-30 v1
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.
Keywords
Cite
@article{arxiv.1703.09737,
title = {Inverting the Sweep Map on (kn,n)-Dyck Paths: A Simple Algorithm},
author = {Erin Milne},
journal= {arXiv preprint arXiv:1703.09737},
year = {2017}
}