Inverting the Rational Sweep Map
classification
🧮 math.CO
keywords
sweepalgorithminvertingrationalsimpleworkco-primedyck
read the original abstract
We present a simple algorithm for inverting the sweep map on rational $(m,n)$-Dyck paths for a co-prime pair $(m,n)$ of positive integers. This work is inspired by Thomas-Williams work on the modular sweep map. A simple proof of the validity of our algorithm is included.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.