Inverting the rational sweep map

DOI10.4310/JOC.2018.V9.N4.A5MaRDI QIDQ1630696zbMATH OpenWikidataFDO

Authors Guoce Xin, Adriano M. Garsia

Publication date 10 December 2018

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.02346

zbMATH Keywords

path diagramsrational Dyck pathssweep maps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Symmetric functions and generalizations (05E05)

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.

Recommendations

• On the sweep map for \(\vec{k}\)-Dyck paths
• On the sweep map for fuss rational Dyck paths
• Sweeping up zeta
• Sweep maps: a continuous family of sorting algorithms
• Sweeping up zeta

Cited in

(8)

• Dinv, area, and bounce for \(\overrightarrow{k} \)-Dyck paths
• On the sweep map for fuss rational Dyck paths
• On the sweep map for \(\vec{k}\)-Dyck paths
• Sweep maps for lattice paths (extended abstract)
• Sweep maps: a continuous family of sorting algorithms
• Dinv and area
• Sweeping up zeta
• Sweeping up zeta

This page was built for publication: Inverting the rational sweep map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630696)