Abstract

We provide generating functions for the number of equivalence classes of rooted planar maps where two maps are equivalent whenever their representations in shuffles of Dyck words coincide on all occurrences of a given pattern.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call