Abstract
The aim of this paper is to find explicit formulae for the number of rooted hypermaps with a given number of darts on an orientable surface of genus \(g\le 3\). Such formulae were obtained earlier for \(g=0\) and \(g=1\) by Walsh and Arques respectively. We first employ the Egorychev’s method of counting combinatorial sums to obtain a new version of the Arques formula for genus \(g=1\). Then we apply the same approach to get new results for genus \(g=2,3\). We could do it due to recent results by Giorgetti, Walsh, and Kazarian, Zograf who derived two different, but equivalent, forms of the generating functions for the number of hypermaps of genus two and three.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
